Fast multiple-antenna differential decoding

Fast multiple-antenna differential decoding

We present an algorithm based on lattice reduction for the fast decoding of diagonal differential modulation across multiple antenna. While the complexity of the maximum-likelihood (ML) algorithm is exponential both in the number of antenna and the rate, the complexity of our approximate lattice alg...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on communications 2001-02, Vol.49 (2), p.253-261
Hauptverfasser: Clarkson, K.L., Sweldens, W., Zheng, A.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Antenna arrays
Antennas
Approximation
Channel capacity
Complexity
Decoding
Errors
Fading
Lattices
Maximum likelihood decoding
Modulation
Modulation coding
Phase shift keying
Polynomials
Receiving antennas
Wireless communication
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We present an algorithm based on lattice reduction for the fast decoding of diagonal differential modulation across multiple antenna. While the complexity of the maximum-likelihood (ML) algorithm is exponential both in the number of antenna and the rate, the complexity of our approximate lattice algorithm is polynomial in the number of antennas and the rate. We show that the error performance of our lattice algorithm is very close to the ML algorithm.
ISSN:0090-6778
1558-0857
DOI:10.1109/26.905879