Matrix computations (3rd ed.)
Quasi-orthogonal STBC with minimum decoding complexity
IEEE Transactions on Wireless Communications
Space-time block codes from orthogonal designs
IEEE Transactions on Information Theory
High-rate codes that are linear in space and time
IEEE Transactions on Information Theory
A simple transmit diversity technique for wireless communications
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
In this paper, we evaluate a few quasi-orthogonal space-time block coding (QO-STBC) schemes for four transmit antennas. Recently, QO-STBC with minimum decoding complexity (MDC-QO-STBC) was proposed. We provide a new analysis result on MDC-QO-STBC. We show that the encoding matrix of the MDC-QO-STBC is equivalent to the conventional QO-STBC. We also prove that this scheme can be linearly decoded at the receiver. This is achieved by modification of the encoding matrix via rotation of the channel correlation matrix.