A New Upper Bound For the Capacity of Free Space Optical Intensity Channel By Using A Simple Mathematical Inequality

Farid-hranilovic (fh), in an interesting way, found a capacity-achieving discrete input distribution for free space optical (fso) channel by numerically maximizing the inputparameter (β) dependent mutual information between channel input and the scaled output. in this paper, first, by using a simple mathematical inequality, we find an u pper bound for fh input-scaled output mutual information and then maximize the obtained upper bound to reach to a third order equation for the optimum β as β*. our equation (i) determines β* exactly in contrary to the fh work where β* is found numerically through an exhaustive search and also, (ii) is consistent with the estimated equation for β* in the fh work. our upper bound is shown to be tighter than the proposed upper bound in the fh work that is found through sphere packing argument at very high snrs. using numerical illustrations at different snrs, we compare our β*s, mass point spacing as ℓ*, and upper bound with previous works