A Fast Recursive Algorithm for 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. Multiple-Input Multiple-Output (MIMO) wireless communication systems possess huge channel capacities when the multipath scattering is sufficiently rich. A MIMO system can provide two types of gains simultaneously, i.e. spatial multiplexing gain and diversity gain, while usually the increase in one type of gain needs the sacrifice in the other type of gain.