Estimation of Achievable Rates in Additive Gaussian Mixture Noise Channels

被引:0
|
作者
Duc-Anh Le [1 ]
Vu, Hung V. [2 ]
Tran, Nghi H. [1 ]
Gursoy, Mustafa Cenk [3 ]
Tho Le-Ngoc [2 ]
机构
[1] Univ Akron, Dept Elect & Comp Engn, Akron, OH 44325 USA
[2] McGill Univ, Dept Elect & Comp Engn, Montreal, PQ, Canada
[3] Syracuse Univ, Dept Elect Engn & Comp Sci, Syracuse, NY 13244 USA
关键词
Gaussian mixture; Achievable rates; Gaussian input; Pulse amplitude modulation; CAPACITY; SYSTEMS;
D O I
10.1109/ICC.2016.7510799
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper details novel methods to accurately estimate the achievable rates of channels with additive Gaussian mixture (GM) noise. Attention is paid to a Gaussian input and discrete inputs. Such discrete inputs represent a wide range of signaling strategies and include the capacity-achieving input as a special case. At first, we propose a simple technique to calculate the GM noise entropy. Specifically, when the noise level is high, a lower bound on the integrand of the noise entropy is established and the noise entropy can be estimated in closed-form. In the low noise region, the piecewise-linear curve fitting (PWLCF) method is applied to calculate the noise entropy. It is then demonstrated this can be estimated in both regions with a predetermined accuracy. We then extend this result to calculate the output entropy and the achievable rate when the input is Gaussian distributed, which is shown to be asymptotically optimal. Next, we propose a simple PWLCF-based method to estimate the output entropy for a given discrete input. In particular, the output entropy is evaluated by examining the output in high and low regions of amplitude using a lower bound on the integrand of the output entropy and PWLCF, respectively. It is demonstrated that the output entropy, and consequently, the achievable rates, can be computed to achieve any desired accuracy level.
引用
收藏
页码:856 / 861
页数:6
相关论文
共 50 条
  • [1] Approximation of Achievable Rates in Additive Gaussian Mixture Noise Channels
    Duc-Anh Le
    Vu, Hung V.
    Tran, Nghi H.
    Gursoy, Mustafa Cenk
    Tho Le-Ngoc
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2016, 64 (12) : 5011 - 5024
  • [2] Achievable Rates for Additive Isotropic α-Stable Noise Channels
    Egan, Malcolm
    de Freitas, Mauro
    Clavier, Laurent
    Goupil, Alban
    Peters, Gareth W.
    Azzaoui, Nourddine
    [J]. 2016 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2016, : 1874 - 1878
  • [3] On the capacity of additive white mixture Gaussian noise channels
    Sheikh-Hosseini, Mohsen
    Hodtani, Ghosheh Abed
    [J]. TRANSACTIONS ON EMERGING TELECOMMUNICATIONS TECHNOLOGIES, 2019, 30 (07)
  • [4] Constellation Constrained Capacity of Additive Gaussian Mixture Noise Channels
    Harshan, J.
    Viterbo, Emanuele
    [J]. 2014 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA), 2014, : 110 - 114
  • [5] Intersymbol interference channels with signal-dependent non-Gaussian noise: Estimation of achievable information rates
    Zhang, Z
    Duman, TM
    Kurtas, EM
    [J]. IEEE TRANSACTIONS ON MAGNETICS, 2006, 42 (05) : 1629 - 1631
  • [6] On Achievable Rates for Gaussian MIMO Relay Channels
    Chen, Liang
    [J]. 2013 47TH ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS (CISS), 2013,
  • [7] Achievable rates in Gaussian MISO channels with secrecy constraints
    Shafiee, Shabnam
    Mukus, Sennur
    [J]. 2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7, 2007, : 2466 - 2470
  • [8] On Additive Channels with Generalized Gaussian Noise
    Dytso, Alex
    Bustin, Ronit
    Poor, H. Vincent
    Shamai , Shim
    [J]. 2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2017, : 426 - 430
  • [9] ON QUANTUM ADDITIVE GAUSSIAN NOISE CHANNELS
    Idel, Martin
    Konig, Robert
    [J]. QUANTUM INFORMATION & COMPUTATION, 2017, 17 (3-4) : 283 - 302
  • [10] Robust Frequency Estimation Under Additive Symmetric α-Stable Gaussian Mixture Noise
    Wang, Peng
    Tian, Yulu
    Men, Bolong
    Song, Hailong
    [J]. INTELLIGENT AUTOMATION AND SOFT COMPUTING, 2023, 36 (01): : 83 - 95