loading...
A New Low Complexity Iterative Detection for Space-Time Bit-Interleaved Coded Modulation Schemes
March 25-March 28
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/AINA.2008.6422nd International Conference on Adva ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
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.
Index Terms:
Group Gaussian Approximation, Maximum a Posteriori, Iterative Decoding, ST-BICM
Citation:
Ying Li, Hongmei Xie, Xudong Guo, Xinmei Wang, "A New Low Complexity Iterative Detection for Space-Time Bit-Interleaved Coded Modulation Schemes," aina, pp.869-874, 22nd International Conference on Advanced Information Networking and Applications (aina 2008), 2008
Usage of this product signifies your acceptance of the Terms of Use.