Fast Maximum-Likelihood Decoding of the Golden Code - Computer Science > Information TheoryReportar como inadecuado




Fast Maximum-Likelihood Decoding of the Golden Code - Computer Science > Information Theory - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: The golden code is a full-rate full-diversity space-time code for twotransmit antennas that has a maximal coding gain. Because each codeword conveysfour information symbols from an M-ary quadrature-amplitude modulationalphabet, the complexity of an exhaustive search decoder is proportional toM^2. In this paper we present a new fast algorithm for maximum-likelihooddecoding of the golden code that has a worst-case complexity of only O2M^2.5.We also present an efficient implementation of the fast decoder that exhibits alow average complexity. Finally, in contrast to the overlaid Alamouti codes,which lose their fast decodability property on time-varying channels, we showthat the golden code is fast decodable on both quasistatic and rapidtime-varying channels.



Autor: Mohanned O. Sinnokrot, John R. Barry

Fuente: https://arxiv.org/







Documentos relacionados