A Modified QRD-M Algorithm Based on Layer Branch Pruning for MIMO Systems

Abstract

In this paper, a low complexity Modified QRD-M (MQRD-M) algorithm based on limited tree search is proposed for MIMO systems. The sphere radius and candidate set of each branch are considered to reduce the computational complexity. The sphere radius is efficiently acquired through the QRD detection based on pruning off unnecessary survival branches at each layer. Moreover, the candidate set of each branch is used to cut down the metric computation for it is much smaller than modulation set. Simulation results show that the proposed MQRD-M algorithm can achieve near-MLD performance and its average metric computation is lower than conventional QRD-M algorithms.

Improved QRD-M Detection Algorithm for Generalized Spatial Modulation Scheme

“…Furthermore, from Figures 2 and 3, the optimal is equal to modulation order |Ω| plus 1 to achieve near-ML performance. However, from [21], the original QRD-M accomplishes the near-ML performance when is equal to modulation order in the conventional MIMO systems.…”

“…The QRD-M algorithm [19][20][21] can be directly applied to GSM systems by adding a zero as a constellation point in constellation set Ω to form the constellation set Ω 0 = Ω ∪ {0}. Based on QRD of channel matrix H = QR with Q and R denoting × unitary matrix and × upper triangular matrix, respectively, the QRD-M detector for GSM signals is formulated bŷ…”