By Topic

Low complexity linear MMSE detector with recursive update algorithm for iterative detection-decoding MIMO OFDM system

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

2 Author(s)
Liu, D.N. ; Dept. of Electr. Eng., California Los Angeles Univ. ; Fitz, M.P.

Iterative turbo processing between detection and decoding shows near-capacity performance on a multiple-antenna system. Combining iterative processing with optimum front-end detection is particularly challenging because the front-end maximum a posteriori (MAP) algorithm has a computational complexity that is exponential in the throughput. 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. The asymptotic computational complexity of SIC-LMMSE remains O(nE2tnr + ntnE3 r + ntMc2M c) 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(nE2tnr + ntMc2M c) but suffers extra performance degradation. In this paper, we introduce a low complexity front-end detection algorithm that not only achieves asymptotic computational complexity of O(nE2tnr + nt nE3r[Gamma (beta)] + ntMc2 M c) where [Gamma (beta) is a function with discrete output {-1,2,3, ...,nt}. Simulation results demonstrate that the proposed low complexity detection algorithm offers exactly same performance as its full complexity counterpart in an iterative receiver while being computational more efficient

Published in:

Wireless Communications and Networking Conference, 2006. WCNC 2006. IEEE  (Volume:2 )

Date of Conference:

3-6 April 2006