The Asymmetric Golden Code for Fast Decoding on Time-Varying Channels

  • Authors:
  • Mohanned O. Sinnokrot;John R. Barry;Vijay K. Madisetti

  • Affiliations:
  • School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, USA 30339;School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, USA 30339;School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, USA 30339

  • Venue:
  • Wireless Personal Communications: An International Journal
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

The golden code is a full-rate full-diversity space---time code for the two-input two-output channel with good performance but high decoding complexity. The overlaid Alamouti codes were recently proposed as an alternative; in exchange for a slight performance penalty, they have lower decoding complexity on quasistatic channels with QAM alphabets. However, the complexity advantage of the overlaid codes vanishes for time-varying channels. This paper proposes the asymmetric golden code, a novel full-rate and full-diversity space---time code for the two-input two-output channel that offers reduced-complexity decoding on both quasistatic and time-varying channels.