Search: onr:"swepub:oai:research.chalmers.se:b0d75c72-a68a-46c7-a5bd-78479fe240c6" >
High SNR Bounds for...
High SNR Bounds for the BICM Capacity
-
- Alvarado, Alex, 1982 (author)
- Chalmers tekniska högskola,Chalmers University of Technology
-
- Brännström, Fredrik, 1974 (author)
- Chalmers tekniska högskola,Chalmers University of Technology
-
- Agrell, Erik, 1965 (author)
- Chalmers tekniska högskola,Chalmers University of Technology
-
(creator_code:org_t)
- 2011
- 2011
- English.
-
In: IEEE Information Theory Workshop ITW 2011, Paraty, Brazil. ; , s. 360-364
- Related links:
-
http://publications.... (primary) (free)
-
show more...
-
https://doi.org/10.1...
-
https://research.cha...
-
show less...
Abstract
Subject headings
Close
- 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.
Subject headings
- TEKNIK OCH TEKNOLOGIER -- Elektroteknik och elektronik -- Telekommunikation (hsv//swe)
- ENGINEERING AND TECHNOLOGY -- Electrical Engineering, Electronic Engineering, Information Engineering -- Telecommunications (hsv//eng)
Publication and Content Type
- kon (subject category)
- ref (subject category)
To the university's database