A Fast Recursive Algorithm for G-STBC
Signal Processing
2020-03-11 v1
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.
Cite
@article{arxiv.2003.04496,
title = {A Fast Recursive Algorithm for G-STBC},
author = {Hufei Zhu and Wen Chen and Bin Li and Feifei Gao},
journal= {arXiv preprint arXiv:2003.04496},
year = {2020}
}
Comments
TCOM