On Gaussian mixture noise channels with minimum and peak amplitude constraints

In this paper, we consider a Gaussian mixture noise channel with both minimum and peak amplitude constraints. We show that the capacity-achieving input has a discrete distribution with a finite number of mass points. We also investigate optimal inputs and capacities via numerical computations.

[1]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

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

[3]  Lav R. Varshney,et al.  Transporting information and energy simultaneously , 2008, 2008 IEEE International Symposium on Information Theory.

[4]  Kamyar Moshksar,et al.  Capacity-Achieving Distributions in Gaussian Multiple Access Channel With Peak Power Constraints , 2014, IEEE Transactions on Information Theory.

[5]  Mehul Motani,et al.  Bounds on the Size and Asymptotic Rate of Subblock-Constrained Codes , 2018, IEEE Transactions on Information Theory.

[6]  Mehul Motani,et al.  Bounds on the asymptotic rate of binary constant subblock-composition codes , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[7]  Bruno Clerckx,et al.  On the capacity of vector Gaussian channels with bounded inputs , 2015, ICC.

[8]  W. Rudin.  Real and complex analysis, 3rd ed. , 1987 .

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

[10]  Ibrahim C. Abou-Faycal,et al.  Using Hermite Bases in Studying Capacity-Achieving Distributions Over AWGN Channels , 2012, IEEE Transactions on Information Theory.

[11]  Frank R. Kschischang,et al.  Capacity-achieving probability measure for conditionally Gaussian channels with bounded inputs , 2005, IEEE Transactions on Information Theory.

[12]  Mehul Motani,et al.  Subblock-Constrained Codes for Real-Time Simultaneous Energy and Information Transfer , 2015, IEEE Transactions on Information Theory.

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

[14]  Mehul Motani,et al.  Gaussian channels with minimum amplitude constraints: When is optimal input binary? , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).