By Topic

A New Low Complexity Iterative Detection for Space-Time Bit-Interleaved Coded Modulation Schemes

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)
Ying Li ; Xidian Univ., Xi''an ; Hongmei Xie ; Xudong Guo ; Xinmei Wang

To reduce the detection complexity of the space-time bit-interleaved coded modulation(ST-BICM) scheme, a turbo type iterative receiver structure consisting of a new group Gaussian approximation(GGA) algorithm and an a posteriori probability(APP) decoder is presented. When calculating the log-likelihood ratio(LLR) of the i-th transmitted symbol, the GGA algorithm first divide the N transmitted signals into two groups, a detecting group consisting of G signals with the i-th transmitted signal included, and an interfering group consisting of the other N-G signals. Taking the superposition of the N-G signals as a Gaussian random variable, the GGA algorithm implements the maximum a posteriori(MAP) detection to obtain the LLR of the signal transmitted from antenna i. At high SNR values or if the receiver has more than two replicas of each transmitted signal, the GGA detection exhibits a good performance as well as low decoding complexity.

Published in:

Advanced Information Networking and Applications, 2008. AINA 2008. 22nd International Conference on

Date of Conference:

25-28 March 2008