Characterizing the discrete capacity achieving distribution with peak power constraint at the transition points

The capacity-achieving input distribution for many channels like the additive white Gaussian noise (AWGN) channels under a peak power constraint is discrete with a finite number of mass points. The number of mass points is itself a variable and figuring it out is part of the optimization problem. We wish to understand the behavior of the optimal input distribution at the transition points where the number of mass points changes. We give a new set of necessary and sufficient conditions at the transition points, which offer new insights into the transition and make the computation of the optimal distribution easier. These conditions can be simplified, at least in the real channel case, by assuming the conjecture that the number of mass points increases monotonically and by at most one as the constraint on the input is relaxed. In particular, we show that for zero mean, unit variance Gaussian noise, the peak amplitude A of 1:671 and 2:786 mark the points where the binary and ternary signaling respectively are no longer optimal.

[1]  R. Sundaram A First Course in Optimization Theory: Optimization in ℝ n , 1996 .

[2]  M. Deakin Catastrophe theory. , 1977, Science.

[3]  Shlomo Shamai,et al.  On the capacity-achieving distribution of the discrete-time noncoherent and partially coherent AWGN channels , 2004, IEEE Transactions on Information Theory.

[4]  Jun Chen,et al.  Capacity Results for Block-Stationary Gaussian Fading Channels With a Peak Power Constraint , 2006, IEEE Transactions on Information Theory.

[5]  Joel G. Smith,et al.  The Information Capacity of Amplitude- and Variance-Constrained Scalar Gaussian Channels , 1971, Inf. Control..

[6]  Pravin Varaiya,et al.  Capacity of fading channels with channel side information , 1997, IEEE Trans. Inf. Theory.

[7]  Shlomo Shamai,et al.  The capacity of average and peak-power-limited quadrature Gaussian channels , 1995, IEEE Trans. Inf. Theory.

[8]  Amos Lapidoth,et al.  On the asymptotic capacity of stationary Gaussian fading channels , 2005, IEEE Transactions on Information Theory.

[9]  D. Luenberger Optimization by Vector Space Methods , 1968 .

[10]  Jesse Freeman,et al.  in Morse theory, , 1999 .

[11]  Ibrahim C. Abou-Faycal,et al.  The capacity of discrete-time memoryless Rayleigh-fading channels , 2001, IEEE Trans. Inf. Theory.

[12]  Yingbin Liang,et al.  Capacity of noncoherent time-selective Rayleigh-fading channels , 2004, IEEE Transactions on Information Theory.

[13]  Sean P. Meyn,et al.  Characterization and computation of optimal distributions for channel coding , 2005, IEEE Transactions on Information Theory.

[14]  H. Vincent Poor,et al.  The noncoherent rician fading Channel-part I: structure of the capacity-achieving input , 2005, IEEE Transactions on Wireless Communications.

[15]  Aslan Tchamkerten,et al.  On the discreteness of capacity-achieving distributions , 2004, IEEE Transactions on Information Theory.