Fast maximum-likelihood decoding of the golden code

Authors:
Mohanned O. Sinnokrot;John R. Barry
Affiliations:
Department of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA;Department of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA
Venue:
IEEE Transactions on Wireless Communications
Year:
2010

Citing 7
Cited 3

On fast-decodable space-time block codes

IEEE Transactions on Information Theory
A New Full-Rate Full-Diversity Space-Time Block Code With Nonvanishing Determinants and Simplified Maximum-Likelihood Decoding

IEEE Transactions on Signal Processing
Space-time codes for high data rate wireless communication: performance criterion and code construction

IEEE Transactions on Information Theory
Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels

IEEE Transactions on Information Theory
The golden code: a 2×2 full-rate space-time code with nonvanishing determinants

IEEE Transactions on Information Theory
An optimal two transmit antenna space-time code and its stacked extensions

IEEE Transactions on Information Theory
A simple transmit diversity technique for wireless communications

IEEE Journal on Selected Areas in Communications

Efficient soft-output demodulators for the golden code

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
The Asymmetric Golden Code for Fast Decoding on Time-Varying Channels

Wireless Personal Communications: An International Journal
Performance evaluation of 2×2 space-time block coded OFDM systems under time-varying fading channels

ICHIT'11 Proceedings of the 5th international conference on Convergence and hybrid information technology

Quantified Score

Hi-index	0.01

Visualization

Abstract

Because each golden code codeword conveys four information symbols from an M-ary QAM alphabet, the complexity of an exhaustive-search decoder is proportional to M4. In this paper we prove that the golden code is fast-decodable, meaning that maximum-likelihood decoding is possible with a worst-case complexity proportional to only M2.5. The golden code retains its fast-decodable property regardless of whether the channel varies with time. We also present an efficient implementation of a fast maximum-likelihood decoder that exhibits a low average complexity.