DocumentCode
7672
Title
Calculating LLRs via Saddlepoint Approximation in Front-End MIMO Receivers
Author
Senst, M. ; Krzymien, L. ; Szczecinski, Leszek ; Labeau, Fabrice
Author_Institution
Dept. of Integrated Signal Process. Syst., RWTH Aachen Univ., Aachen, Germany
Volume
61
Issue
6
fYear
2013
fDate
Jun-13
Firstpage
2330
Lastpage
2338
Abstract
In this work, we consider the front-end receivers for flat fading MIMO transmission, whose essential feature is the calculation of the log-likelihood ratios (LLRs) for the transmitted bits. When the number of transmit antennas and the modulation size grow, the exact calculation of the LLRs becomes unfeasible due to the necessity to enumerate the symbols affecting the output. In this work, to avoid the burden of explicit enumeration, instead of calculating the likelihoods exactly, we explore the possibilities offered by the saddlepoint approximation of the likelihood functions. The resulting fixed-complexity approach significantly outperforms the well known linear-filter based minimum mean square error detection. A complexity analysis identifies the main computational bottleneck of the proposed detection algorithm.
Keywords
MIMO communication; antenna arrays; approximation theory; computational complexity; fading channels; filtering theory; least mean squares methods; modulation; radio receivers; radio transmitters; transmitting antennas; LLR calculation; computational complexity; fading channel; fixed-complexity approach; flat fading MIMO transmission; front-end MIMO receiver; linear-filter based minimum mean square error detection; log-likelihood ratio; modulation; saddlepoint approximation; transmitting antenna; Approximation methods; Complexity theory; Detectors; MIMO; Noise; Receivers; Vectors; LMMSE; MAP; MIMO; ML; Saddlepoint approximation (SPA);
fLanguage
English
Journal_Title
Communications, IEEE Transactions on
Publisher
ieee
ISSN
0090-6778
Type
jour
DOI
10.1109/TCOMM.2013.032713.110736
Filename
6493989
Link To Document