Achievability of the Rate \${1-2}log1 es\$ in the Discrete-Time Poisson Channel - Computer Science > Information Theory

Achievability of the Rate \${1-2}log1 es\$ in the Discrete-Time Poisson Channel - Computer Science > Information Theory - Download this document for free, or read online. Document in PDF available to download.

Abstract: A simple lower bound to the capacity of the discrete-time Poisson channelwith average energy \$\es\$ is derived. The rate \${1-2}\log1+\es\$ is shown tobe the generalized mutual information of a modified minimum-distance decoder,when the input follows a gamma distribution of parameter 1-2 and mean \$\es\$.

Author: Alfonso Martinez

Source: https://arxiv.org/