Low complexity affine MMSE detector for iterative detection-decoding MIMO OFDM systems

Iterative turbo processing between detection and decoding shows near-capacity performance on a multiple-antenna system. Combining iterative processing with optimum frontend detection is particularly challenging because the front-end maximum a posteriori (MAP) algorithm has a computational complexity that is exponential. Sub-optimum detector such as the soft interference cancellation linear minimum mean square error (SIC-LMMSE) detector with near front-end MAP performance has been proposed in the literature. The asymptotic computational complexity of SIC-LMMSE is O(n2 t nr +ntn3 r +ntMc2Mc ) per detection-decoding cycle where nt is number of transmit antenna, nr is number of receive antenna, and Mc is modulation size. A lower complexity detector is the hard interference cancellation LMMSE (HIC-LMMSE) detector. HIC-LMMSE has asymptotic complexity of O(n2 t nr + ntMc2Mc ) but suffers extra performance degradation. In this paper, two front-end detection algorithms are introduced that not o...

• Type: Journal
• Year: 2008
• Where: TCOM
• Authors: Daniel N. Liu, Michael P. Fitz
• Keywords: Asymptotic Computational Complexity, Computational Complexity, Interference Cancellation, TCOM 2008