Multi-Antenna Transceiver Techniques for 3g and Beyond
Multi-Antenna Transceiver Techniques for 3g and Beyond
Low complexity essentially maximum likelihood decoding of perfect space-time block codes
ICASSP '09 Proceedings of the 2009 IEEE International Conference on Acoustics, Speech and Signal Processing
On fast-decodable space-time block codes
IEEE Transactions on Information Theory
High-rate codes that are linear in space and time
IEEE Transactions on Information Theory
The golden code: a 2×2 full-rate space-time code with nonvanishing determinants
IEEE Transactions on Information Theory
Perfect Space–Time Block Codes
IEEE Transactions on Information Theory
Bayesian Analysis of Interference Cancellation for Alamouti Multiplexing
IEEE Transactions on Information Theory
A simple transmit diversity technique for wireless communications
IEEE Journal on Selected Areas in Communications
Fast Essentially Maximum Likelihood Decoding of the Golden Code
IEEE Transactions on Information Theory
Finite precision analysis for space-time decoding
IEEE Transactions on Signal Processing
Highly parallel decoding of space-time codes on graphics processing units
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Construction of high rate super-orthogonal space-time block codes
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Hi-index | 754.84 |
This paper focuses on conditional optimization as a decoding primitive for high rate space-time codes that are obtained by multiplexing in the spatial and code domains. The approach is a crystallization of the work of Hottinen et al. which applies to space-time codes that are assisted by quasi-orthogonality. It is independent of implementation and is more general in that it can be applied to space-time codes such as the Golden Code and perfect space-time block codes, that are not assisted by quasi-orthogonality, to derive fast decoders with essentially maximum likelihood (ML) performance. The conditions under which conditional optimization leads to reduced complexity ML decoding are captured in terms of the induced channel at the receiver. These conditions are then translated back to the transmission domain leading to codes that are constructed by multiplexing orthogonal designs. The methods are applied to several block space-time codes obtained by multiplexing Alamouti blocks where it leads to ML decoding with complexity O(N2) where N is the size of the underlying QAM signal constellation. A new code is presented that tests commonly accepted design principles and for which decoding by conditional optimization is both fast and ML. The two design principles for perfect space-time codes are nonvanishing determinant of pairwise differences and cubic shaping, and it is cubic shaping that restricts the possible multiplexing structures. The new code shows that it is possible to give up on cubic shaping without compromising code performance or decoding complexity.