.png){kind=icon}
返回
A Fast Recursive Algorithm for G-STBC
.png){kind=icon}
OA
AI
DOI：10.1109/TCOMM.2011.063011.100104.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Fast recursive algorithms
MIMO
V-BLAST
G-STBC
DSTTD
Alamouti structure
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
引用论文
.png){kind=icon}
Synthesis and Characterization of Uniform Zirconia Particles by Homogeneous Precipitation MethodOAAI
OAAI分享收藏分享收藏Prognostic and Predictive Relevance of Primary Tumor Location in Patients With RAS Wild-Type Metastatic Colorectal CancerRAS 野生型转移性结直肠癌患者原发肿瘤位置的预后和预测相关性
OAAI
OAAI分享收藏
查看更多内容