Computer Science – Information Theory
Scientific paper
2008-09-19
Computer Science
Information Theory
Scientific paper
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$.
No associations
LandOfFree
Achievability of the Rate ${1/2}\log(1+\es)$ in the Discrete-Time Poisson Channel does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Achievability of the Rate ${1/2}\log(1+\es)$ in the Discrete-Time Poisson Channel, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Achievability of the Rate ${1/2}\log(1+\es)$ in the Discrete-Time Poisson Channel will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-157725