A Reduced-Complexity Tree Search Detection Algorithm for MIMO Systems

In this correspondence, we propose a simplified QR-decomposition- M algorithm for coded multiple-input multiple-output systems based on the idea of selective branch extension. The proposed algorithm results in significant complexity reductions without observable performance losses, especially for la...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on signal processing 2009-06, Vol.57 (6), p.2420-2424
Main Authors: KIM, Yongsang, CHEUN, Kyungwhoon
Format: Article
Language:English
Subjects:
Algorithms
Applied sciences
Complexity
Computational complexity
Detection algorithms
Exact sciences and technology
Fading
Gaussian noise
Information technology
Information, signal and communications theory
M -algorithm
MIMO
MIMO systems
Miscellaneous
Modulation
Modulation, demodulation
Performance loss
Receiving antennas
Reduction
Searching
Signal and communications theory
Signal processing
Signal processing algorithms
Telecommunications and information theory
Transmitting antennas
tree search detection
Trees
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this correspondence, we propose a simplified QR-decomposition- M algorithm for coded multiple-input multiple-output systems based on the idea of selective branch extension. The proposed algorithm results in significant complexity reductions without observable performance losses, especially for large modulation orders where complexity reduction is most important.
ISSN:1053-587X
1941-0476
DOI:10.1109/TSP.2009.2015121