For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Near-Optimal Signal Detection Based on the MMSE Detection Using Multi-Dimensional Search for Correlated MIMO Channels
Liming ZHENG Kazuhiko FUKAWA Hiroshi SUZUKI Satoshi SUYAMA
IEICE TRANSACTIONS on Communications
Publication Date: 2011/08/01
Online ISSN: 1745-1345
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Wireless Communication Technologies
correlated MIMO channel, signal detection, low complexity, MMSE, noise enhancement, multi-dimensional search,
Full Text: FreePDF
This paper proposes a low-complexity signal detection algorithm for spatially correlated multiple-input multiple-output (MIMO) channels. The proposed algorithm sets a minimum mean-square error (MMSE) detection result to the starting point, and searches for signal candidates in multi-dimensions of the noise enhancement from which the MMSE detection suffers. The multi-dimensional search is needed because the number of dominant directions of the noise enhancement is likely to be more than one over the correlated MIMO channels. To reduce the computational complexity of the multi-dimensional search, the proposed algorithm limits the number of signal candidates to O(NT) where NT is the number of transmit antennas and O( ) is big O notation. Specifically, the signal candidates, which are unquantized, are obtained as the solution of a minimization problem under a constraint that a stream of the candidates should be equal to a constellation point. Finally, the detected signal is selected from hard decisions of both the MMSE detection result and unquantized signal candidates on the basis of the log likelihood function. For reducing the complexity of this process, the proposed algorithm decreases the number of calculations of the log likelihood functions for the quantized signal candidates. Computer simulations under a correlated MIMO channel condition demonstrate that the proposed scheme provides an excellent trade-off between BER performance and complexity, and that it is superior to conventional one-dimensional search algorithms in BER performance while requiring less complexity than the conventional algorithms.