Novel MIMO Detection With Improved Complexity for Near-ML Detection in MIMO-OFDM Systems

Abstract

In this paper, a novel efficient algorithm for MIMO detection in MIMO-OFDM systems has been proposed. This paper also shows that the complexity can be greatly reduced by applying the threshold in the breadth-first tree search algorithm step to eliminating paths. That is, this algorithm derives thresholds based on the LR-aided nonlinear algorithm and performs a simple tree search detection algorithm. This algorithm requires a lower computational complexity than the conventional QRD-M detection algorithm and achieves the same bit error performance. After the novel detection algorithm is proposed, this paper applies this algorithm to the MIMO-OFDM system for performance comparison in terms of error performance and complexity. In many cases of MIMO-OFDM receivers, the proposed method will be an excellent option for implementation.

Keywords

• MIMO systems
• OFDM
• signal detection
• M%22%2C%22default_operator%22%3A%22AND%22%7D%7D%7D"> QRD-<italic xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">M</italic>
• BFTS
• multiplexing gain