Low-complexity adaptive tree search algorithm for MIMO detection

In this paper, a reduced-complexity multiple-input multiple-output (MIMO) detector for the spatial multiplexing systems is described. It incorporates the idea of Ungerboeck's set partitioning in the tree search to reduce the computational complexity. An algorithm that adapts the number of parti...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on wireless communications 2009-07, Vol.8 (7), p.3716-3726
Hauptverfasser:	LAI, Kuei-Chiang, LIN, Li-Wei
Format:	Artikel
Sprache:	eng
Schlagworte:	Adaptive algorithms Algorithms Applied sciences Channels Complexity Computational complexity Detection algorithms Detectors Effectiveness Exact sciences and technology Information, signal and communications theory Maximum likelihood decoding MIMO MIMO detection Multiplexing Object detection Partitioning algorithms Receiving antennas Signal and communications theory signal set partitioning Telecommunications and information theory Throughput Transmitting antennas tree search Trees Wireless communication
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!