Computer Science – Information Theory
Scientific paper
2010-10-12
Computer Science
Information Theory
Strict concavity assumption added to Propositions 2 and 3. This assumption is missing in the ICC 2011 proceedings version of t
Scientific paper
The capacity achieving probability mass function (PMF) of a finite signal constellation with an average power constraint is in most cases non-uniform. A common approach to generate non-uniform input PMFs is Huffman shaping, which consists of first approximating the capacity achieving PMF by a sampled Gaussian density and then to calculate the Huffman code of the sampled Gaussian density. The Huffman code is then used as a prefix-free modulation code. This approach showed good results in practice, can however lead to a significant gap to capacity. In this work, a method is proposed that efficiently constructs optimal prefix-free modulation codes for any finite signal constellation with average power constraint in additive noise. The proposed codes operate as close to capacity as desired. The major part of this work elaborates an analytical proof of this property. The proposed method is applied to 64-QAM in AWGN and numeric results are given, which show that, opposed to Huffman shaping, by using the proposed method, it is possible to operate very close to capacity over the whole range of parameters.
Altenbach Fabian
Böcherer Georg
Mathar Rudolf
No associations
LandOfFree
Capacity Achieving Modulation for Fixed Constellations with Average Power Constraint does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Capacity Achieving Modulation for Fixed Constellations with Average Power Constraint, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Capacity Achieving Modulation for Fixed Constellations with Average Power Constraint will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-608472