2000 character limit reached
Achievability of the Rate ${1/2}\log(1+\es)$ in the Discrete-Time Poisson Channel (0809.3370v1)
Published 19 Sep 2008 in cs.IT and math.IT
Abstract: A simple lower bound to the capacity of the discrete-time Poisson channel with average energy $\es$ is derived. The rate ${1/2}\log(1+\es)$ is shown to be the generalized mutual information of a modified minimum-distance decoder, when the input follows a gamma distribution of parameter 1/2 and mean $\es$.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.