By Topic

Joint maximum likelihood and QRD-M detection algorithm for MIMO system

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Li Liu ; School of Information Science & Engineering Northeastern University Shenyang, China ; Jinkuan Wang ; Dongmei Yan ; Bin Wang
more authors

Maximum likelihood detection (MLD) algorithm provides the best bit error rate (BER) performance for multiple-input multiple-output (MIMO) system. However, the computational complexity of ML detection algorithm grows exponentially with the number of transmit antennas, which results in impractical to use in practice system. The use of QR decomposition with an M-algorithm (QRD-M) has been proposed to provide near ML performance and low complexity. The QRD-M algorithm reduces the complexity by selecting M candidates with the smallest accumulated metrics at each level of the tree search. The trade-off between performance and complexity can be adjusted by setting the parameter M which cannot provide more valuable tradeoff options with better performance to complexity ratio. A new detection scheme, jointing MLD with QRD-M detection algorithm, is proposed in the paper. After performing QR decomposition of the channel matrix, the MLD with length L is done, the accumulated metrics are calculated and sorted, which gives an ordered set, then QRD-M algorithm are used to search the left layers. The proposed algorithm provides better tradeoff options by selecting different parameters L and M and getting more near-ML performance with lower complexity.

Published in:

2009 ISECS International Colloquium on Computing, Communication, Control, and Management  (Volume:3 )

Date of Conference:

8-9 Aug. 2009