.png){kind=icon}
Return
A Fast Recursive Algorithm for G-STBC
.png){kind=icon}
OA
AI
DOI：10.1109/TCOMM.2011.063011.100104.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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:
Fast recursive algorithms
MIMO
V-BLAST
G-STBC
DSTTD
Alamouti structure
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveSynthesis and Characterization of Uniform Zirconia Particles by Homogeneous Precipitation MethodOAAI
OAAIShareSaveShareSave
ShareSave
View more