Power Control in Parallel Symmetric $\alpha$ -Stable Noise Channels

Parallel channels form a basic building block for communication systems, including those based on OFDM and CDMA. While parallel Gaussian noise channels have been widely studied, parallel impulsive noise channels have received significantly less attention despite their importance in a range of modern communication systems. In this paper, this problem is addressed and a power allocation strategy is developed for parallel symmetric $\alpha$ -stable noise channels—a key class of impulsive noise channels. We show that our strategy can improve achievable rates by up to a factor of 1.5 over the standard waterfilling algorithm that assumes the noise is Gaussian.

[1]  Jihad Fahs,et al.  On Properties of the Support of Capacity-Achieving Distributions for Additive Noise Channel Models With Input Cost Constraints , 2016, IEEE Transactions on Information Theory.

[2]  Gareth W. Peters,et al.  Achievable rates for additive isotropic α-stable noise channels , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[3]  J. McCulloch,et al.  Simple consistent estimators of stable distribution parameters , 1986 .

[4]  A. Bowman,et al.  Applied smoothing techniques for data analysis : the kernel approach with S-plus illustrations , 1999 .

[5]  Jean-Marie Gorce,et al.  Dynamic interference for uplink SCMA in large-scale wireless networks without coordination , 2018, EURASIP Journal on Wireless Communications and Networking.

[6]  Malcolm Egan.  On Capacity Sensitivity in Additive Vector Symmetric α-Stable Noise Channels , 2019, 2019 IEEE Wireless Communications and Networking Conference Workshop (WCNCW).

[7]  Richard E. Blahut,et al.  Computation of channel capacity and rate-distortion functions , 1972, IEEE Trans. Inf. Theory.

[8]  Ibrahim C. Abou-Faycal,et al.  A cauchy input achieves the capacity of a Cauchy channel under a logarithmic constraint , 2014, 2014 IEEE International Symposium on Information Theory.

[9]  Gareth W. Peters,et al.  Capacity Bounds for Additive Symmetric $\alpha $ -Stable Noise Channels , 2017, IEEE Transactions on Information Theory.

[10]  Suguru Arimoto,et al.  An algorithm for computing the capacity of arbitrary discrete memoryless channels , 1972, IEEE Trans. Inf. Theory.

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