A SIMPLIFIED QRD-M SIGNAL DETECTION ALGORITHM FOR MIMO-OFDM SYSTEMS

QR Decompositon with an M-algorithm(QRD-M) has good performance with low complexity,which is considered as a promising technique in Multiple-Input Multiple-Output(MIMO) detections.This paper presented a simplified QRD-M algorithm for MIMO Orthogonal Frequency Division Multiplexing(MIMO-OFDM) systems.In the proposed scheme,each surviving path is expanded only to partial branches in order to carry out a limited tree search.The nodes are expanded on demand and sorted in a distributed manner,based on the novel expansion scheme which can pre-determine the children’s ascending order by their local distances.Consequently,the proposed scheme can significantly decrease the complexity compared with conventional QRD-M algorithm.Hence,it is especially attractive to VLSI implementation of the high-throughput MIMO-OFDM systems.Simulation results prove that the proposed scheme can achieve a performance very close to the conventional QRD-M algorithm.