A Fast Recursive Algorithm for G-STBC

This paper proposes a fast recursive algorithm for Group-wise Space-Time Block Code (G-STBC), which takes full advantage of the Alamouti structure in the equivalent channel matrix to reduce the computational complexity. With respect to the existing efficient algorithms for G-STBC, the proposed algor...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on communications Jg. 59; H. 8; S. 2084 - 2089
Hauptverfasser:	Zhu, Hufei, Chen, Wen, Li, Bin, Gao, Feifei
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York, NY IEEE 01.08.2011 Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Alamouti structure Algorithms Applied sciences Bit error rate Block codes Channels Coding, codes Complexity Complexity theory Computation Detection, estimation, filtering, equalization, prediction Detectors DSTTD Equivalence Exact sciences and technology Fast recursive algorithms G-STBC Information, signal and communications theory Interference MIMO Receiving antennas Recursive Signal and communications theory Signal to noise ratio Signal, noise Silicon carbide Telecommunications and information theory V-BLAST MIMO system Fast recursive algorithms Block code G-STBC Space-time codes Noise reduction V-BLAST Alamouti structure Recursive algorithm Computational complexity Interference suppression DSTTD Algorithm performance Signal processing MIMO Fast algorithm Signal detection
ISSN:	0090-6778, 1558-0857
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!