DocumentCode
1275661
Title
A Fast Recursive Algorithm for G-STBC
Author
Zhu, Hufei ; Chen, Wen ; Li, Bin ; Gao, Feifei
Author_Institution
Dept. of Electron. Eng., Shanghai Jiao Tong Univ., Shanghai, China
Volume
59
Issue
8
fYear
2011
fDate
8/1/2011 12:00:00 AM
Firstpage
2084
Lastpage
2089
Abstract
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 algorithm achieves better performance and usually requires less computational complexity.
Keywords
computational complexity; matrix algebra; space-time block codes; Alamouti structure; G-STBC; channel matrix; computational complexity; fast recursive algorithm; group-wise space-time block code; Bit error rate; Complexity theory; Detectors; Interference; Receiving antennas; Signal to noise ratio; Silicon carbide; Alamouti structure; DSTTD; Fast recursive algorithms; G-STBC; MIMO; V-BLAST;
fLanguage
English
Journal_Title
Communications, IEEE Transactions on
Publisher
ieee
ISSN
0090-6778
Type
jour
DOI
10.1109/TCOMM.2011.063011.100104
Filename
5957239
Link To Document