A Computationally Efficient Search Space for QRM-MLD Signal Detection

In this letter, we propose a computationally efficient search space for QRM-MLD that is used for spatially multiplexed multiple antenna systems. We perform a set of computer simulations to show that the proposed method achieves a performance that is near to that of the original QRM-MLD, while its co...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEICE Transactions on Communications 2009/03/01, Vol.E92.B(3), pp.1045-1048
Hauptverfasser:	HUR, Hoon, WOO, Hyunmyung, YANG, Won-Young, BAHNG, Seungjae, PARK, Youn-Ok, KIM, Jaekwon
Format:	Artikel
Sprache:	eng
Schlagworte:	Antennas Applied sciences Complexity Computation Computational efficiency Computer simulation Detection, estimation, filtering, equalization, prediction Exact sciences and technology Information, signal and communications theory MIMO Multiplexing QRM-MLD Radiocommunications ranking Searching Signal and communications theory Signal detection Signal, noise Telecommunications Telecommunications and information theory
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	In this letter, we propose a computationally efficient search space for QRM-MLD that is used for spatially multiplexed multiple antenna systems. We perform a set of computer simulations to show that the proposed method achieves a performance that is near to that of the original QRM-MLD, while its computational complexity is near to that of rank-QRM-MLD.
ISSN:	0916-8516 1745-1345
DOI:	10.1587/transcom.E92.B.1045