By Topic

EXIT-Chart-Matching-Aided Near-Capacity Coded Modulation Design and a BICM-ID Design Example for Both Gaussian and Rayleigh Channels

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Qiuliang Xie ; Digital TV Nat. Eng. Lab. Co., Ltd., Beijing, China ; Zhixing Yang ; Jian Song ; Hanzo, L.

Bit-interleaved coded modulation with iterative decoding (BICM-ID) is investigated, wherein a novel method of designing amplitude phase-shift keying (APSK) constellations is proposed, which is capable of outperforming both traditional quadrature amplitude modulation (QAM) and nonuniformly spaced QAM (NU-QAM). It is shown that the channel capacity can be approached by the proposed M-APSK constellation as M tends to infinity. Additionally, a new algorithm is introduced for finding the best bit-to-symbol mapping. Furthermore, when signal space diversity is also employed, our extrinsic information transfer (EXIT) chart analysis and Monte Carlo simulations demonstrate that the proposed BICM-ID schemes exhibit a near-Shannon-capacity performance for transmission over both additive white Gaussian noise (AWGN) and Rayleigh fading channels. For a block length of 64 800 bits, the bit-error-rate (BER) curve of the proposed BICM-ID 16/64-APSK scheme is only about 0.8 and 1.0 dB away from the Gaussian-input Shannon limit over AWGN and Rayleigh fading channels, respectively, at the BER of 10-5 and for a code rate of 1/2.

Published in:

Vehicular Technology, IEEE Transactions on  (Volume:62 ,  Issue: 3 )