论文标题
G-STBC的快速递归算法
A Fast Recursive Algorithm for G-STBC
论文作者
论文摘要
本文提出了针对小组时空块代码（G-STBC）的快速递归算法，该算法充分利用了等效通道矩阵中的Alamouti结构，以降低计算复杂性。关于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 algorithm achieves better performance and usually requires less computational complexity.
