DocumentCode :
2453706
Title :
High SNR bounds for the BICM capacity
Author :
Alvarado, Alex ; Brännström, Fredrik ; Agrell, Erik
Author_Institution :
Dept. of Eng., Univ. of Cambridge, Cambridge, UK
fYear :
2011
fDate :
16-20 Oct. 2011
Firstpage :
360
Lastpage :
364
Abstract :
In this paper, different aspects of the bit-interleaved coded modulation (BICM) capacity for the Gaussian channel are analyzed. Analytical bounds for the BICM capacity are developed. These bounds suggest that the BICM capacity at high signal-to-noise ration (SNR) is determined by the multiplicity of the minimum Euclidean distance over all the subconstellations generated by the mapper. Based on this observation, we conjecture that for any constellation, the highest BICM capacity at high SNR is always obtained by a Gray code, if one exists. Ready-to-use expressions based on Gauss - Hermite quadratures to compute the coded modulation and BICM capacities for any SNR are also presented. Using these expressions, it is shown that the BICM capacity is in general a nonconvex, nonconcave function of the input bit distribution. For 8PAM and 8PSK, there exist 12 and 7 classes of mappings, respectively, with equivalent high-SNR behavior, of which the best class comprises all Gray codes.
Keywords :
Gaussian channels; Gray codes; concave programming; convex programming; interleaved codes; modulation coding; 8PAM; 8PSK; BICM capacity; Gauss-Hermite quadratures; Gaussian channel; Gray code; SNR; SNR bounds; bit-interleaved coded modulation capacity; input bit distribution; minimum Euclidean distance; nonconcave function; nonconvex function; signal-to-noise ration; Conferences; Interleaved codes; Reflective binary codes; Signal to noise ratio; Vectors;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory Workshop (ITW), 2011 IEEE
Conference_Location :
Paraty
Print_ISBN :
978-1-4577-0438-3
Type :
conf
DOI :
10.1109/ITW.2011.6089480
Filename :
6089480
Link To Document :
بازگشت