Bounds on the Number of Mass Points of the Capacity Achieving Distribution of the Amplitude Constraint Poisson Noise Channel
share
This work considers a Poisson noise channel with an amplitude constraint. It is well-known that the capacity-achieving input distribution for this channel is discrete with finitely many points. We sharpen this result by introducing upper and lower bounds on the number of mass points. In particular, the upper bound of order 𝖠log^2(𝖠) and lower bound of order √(𝖠) are established where 𝖠 is the constraint on the input amplitude. In addition, along the way, we show several other properties of the capacity and capacity-achieving distribution. For example, it is shown that the capacity is equal to - log P_Y^⋆(0) where P_Y^⋆ is the optimal output distribution. Moreover, an upper bound on the values of the probability masses of the capacity-achieving distribution and a lower bound on the probability of the largest mass point are established.
READ FULL TEXT