Error exponents for channel coding with application to signal constellation design
Authors:
- S. MeynSMS. Meyn
- M. MedardMMM. Medard
- 31 July 2006
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 24 (8) , 1647-1661
Abstract
This paper concerns error exponents and the structure of input distributions maximizing the random coding exponent for a stochastic channel model. The following conclusions are obtained under general assumptions on the channel statistics. 1) The optimal distribution has a finite number of mass points, or in the case of a complex channel, the amplitude has finite support. 2) A new class of algorithms is introduced based on the cutting-plane method to construct an optimal input distribution. The algorithm constructs a sequence of discrete distributions, along with upper and lower bounds on the random coding exponent at each iteration. 3) In some numerical example considered, the resulting code significantly outperforms traditional signal constellation schemes such as quadrature amplitude modulation and phase-shift keying for all rates below the capacityKeywords
This publication has 41 references indexed in Scilit:
- Noncoherent Rician fading Channel-part II: spectral efficiency in the low-power regimeIEEE Transactions on Wireless Communications, 2005
- The noncoherent rician fading Channel-part I: structure of the capacity-achieving inputIEEE Transactions on Wireless Communications, 2005
- Characterization and Computation of Optimal Distributions for Channel CodingIEEE Transactions on Information Theory, 2005
- Coding theorems for turbo code ensemblesIEEE Transactions on Information Theory, 2002
- Power Limited Channels: Coding, Multiaccess, and Spread Spectrum2002
- The capacity of discrete-time memoryless Rayleigh-fading channelsIEEE Transactions on Information Theory, 2001
- A large deviations approach to error exponents in source coding and hypothesis testingIEEE Transactions on Information Theory, 1990
- The random coding bound is tight for the average code (Corresp.)IEEE Transactions on Information Theory, 1973
- Asymptotically Optimal Tests for Multinomial DistributionsThe Annals of Mathematical Statistics, 1965
- Low-density parity-check codesIEEE Transactions on Information Theory, 1962