Capacity-achieving discrete signaling over additive noise channels

被引:3
|
作者
Feiten, Anke [1 ]
Mathar, Rudolf [1 ]
机构
[1] Rhein Westfal TH Aachen, Inst Theoret Informat Technol, D-52074 Aachen, Germany
关键词
D O I
10.1109/ICC.2007.894
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Discrete input distributions are capacity-achieving for a variety of noise distributions whenever the input is subject to peak power or other bounding constraints. In this paper, we consider additive noise with arbitrary absolutely-continuous distribution and ask the question what the optimal input distribution over a set of fixed signaling points would be. The capacity-achieving distribution is characterized by constant Kullback Leibler distance between the shifted noise distribution and a certain mixture hereof. As an application, the optimal input distribution for binary symmetric signaling over exponential noise channels is determined. It further follows that in certain symmetric cases the uniform distribution over all signaling points is capacity-achieving.
引用
收藏
页码:5401 / 5405
页数:5
相关论文
共 50 条
  • [21] Feedback does not increase the capacity of discrete channels with additive noise
    Univ of Maryland, College Park, United States
    IEEE Trans Inf Theory, 2 (546-549):
  • [22] Capacity-achieving sequences
    Shokrollahi, MA
    CODES, SYSTEMS, AND GRAPHICAL MODELS, 2001, 123 : 153 - 166
  • [23] The uniqueness of the capacity-achieving distribution over non-coherent flat-fading channels
    Fozunbal, M
    McLaughlin, SW
    Schafer, RW
    2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2004, : 541 - 541
  • [24] Capacity-Achieving Polar Codes for Arbitrarily Permuted Parallel Channels
    Hof, Eran
    Sason, Igal
    Shamai , Shlomo
    Tian, Chao
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (03) : 1505 - 1516
  • [25] Capacity-achieving transmitter and receiver pairs for dispersive MISO channels
    Zangi, KC
    Krasny, LG
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2003, 2 (06) : 1204 - 1216
  • [26] Capacity-Achieving Codes for Noisy Feedback Channels: A Necessary Condition
    Li, Chong
    IEEE COMMUNICATIONS LETTERS, 2014, 18 (06) : 1007 - 1010
  • [27] On the discreteness of the capacity-achieving probability measure of conditional Gaussian channels
    Chan, TH
    Kschischang, FR
    2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2004, : 348 - 348
  • [28] Capacity-achieving probability measure for a reduced number of signaling points
    Schmeink, Anke
    Zhang, Haoqing
    WIRELESS NETWORKS, 2011, 17 (04) : 987 - 999
  • [29] Capacity Region and Capacity-Achieving Signaling Schemes for 1-bit ADC Multiple Access Channels in Rayleigh Fading
    Ranjbar, Mohammad
    Tran, Nghi H.
    Vu, Minh N.
    Nguyen, Truyen V.
    Cenk Gursoy, M.
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2020, 19 (09) : 6162 - 6178
  • [30] Capacity-achieving probability measure for a reduced number of signaling points
    Anke Schmeink
    Haoqing Zhang
    Wireless Networks, 2011, 17 : 987 - 999