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 条
  • [41] ORBGRAND Is Almost Capacity-Achieving
    Liu, Mengxiao
    Wei, Yuejun
    Chen, Zhenyuan
    Zhang, Wenyi
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2023, 69 (05) : 2830 - 2840
  • [42] Optimum Discrete Signaling over Channels with Arbitrary Noise Distribution
    Mathar, Rudolf
    Schmeink, Anke
    Zivkovic, Milan
    ICSPCS: 2ND INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING AND COMMUNICATION SYSTEMS, PROCEEDINGS, 2008, : 214 - +
  • [43] CAPACITY-ACHIEVING FINGERPRINT DECODING
    Huang, Yen-Wei
    Moulin, Pierre
    2009 FIRST IEEE INTERNATIONAL WORKSHOP ON INFORMATION FORENSICS AND SECURITY (WIFS), 2009, : 51 - +
  • [44] Capacity-Achieving Rate-Compatible Polar Codes for General Channels
    Mondelli, Marco
    Hassani, S. Hamed
    Maric, Ivana
    Hui, Dennis
    Hong, Song-Nam
    2017 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE WORKSHOPS (WCNCW), 2017,
  • [45] Capacity-Achieving CPM Schemes
    Perotti, Alberto
    Tarable, Alberto
    Benedetto, Sergio
    Montorsi, Guido
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (04) : 1521 - 1541
  • [46] A Simple Capacity-Achieving Scheme for Channels With Polarization-Dependent Loss
    Shehadeh, Mohannad
    Kschischang, Frank R.
    JOURNAL OF LIGHTWAVE TECHNOLOGY, 2023, 41 (06) : 1712 - 1724
  • [47] On the ergodic capacity-achieving covariance matrix of certain classes of MIMO channels
    Rhee, Wonjong
    Taricco, Giorgio
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (08) : 3810 - 3817
  • [48] Capacity-Achieving Codes for Channels with Memory with Maximum-Likelihood Decoding
    Bae, Jung Hyun
    Anastasopoulos, Achilleas
    2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4, 2009, : 586 - 590
  • [49] On the Discreteness of Capacity-Achieving Distributions for Fading and Signal-Dependent Noise Channels With Amplitude-Limited Inputs
    ElMoslimany, Ahmad
    Duman, Tolga M.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (02) : 1163 - 1177
  • [50] The capacity-cost function of discrete additive noise channels with and without feedback
    Alajaji, F
    Whalen, N
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (03) : 1131 - 1140