Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
