On optimal quasi-orthogonal space-time block codes with minimum decoding complexity
IEEE Transactions on Information Theory
Quasi-orthogonal STBC with minimum decoding complexity
IEEE Transactions on Wireless Communications
IEEE Transactions on Information Theory
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
Orthogonal designs with maximal rates
IEEE Transactions on Information Theory
Single-symbol maximum likelihood decodable linear STBCs
IEEE Transactions on Information Theory
IEEE Transactions on Communications
Hi-index | 0.00 |
Space-time block codes (STBC) using coordinate interleaved orthogonal designs (CIOD) proposed recently by Khan and Rajan allow single-complex symbol decoding while offering higher data rates than orthogonal STBC. In this paper, we present the equivalent channels of CIOD codes. A new maximum likelihood metric is also derived, which is simpler than the one shown by Khan and Rajan. The exact symbol pairwise error probability and a tight union bound on symbol error rate are derived. The tight union bound can be used to analyze the performance of CIOD codes with arbitrary constellations. We provide new optimal rotation angles based on minimizing the union bound for various constellations. Furthermore, a new signal design combining signal rotation and power allocation is presented for rectangular quadrature amplitude modulation.