DocumentCode
2390851
Title
Sphere decoding of space-time codes
Author
Damen, Oussama ; Chkeif, Ammar ; Belflore, J.-C.
Author_Institution
Ecole Nat. Superieure des Telecommun., Paris, France
fYear
2000
fDate
2000
Firstpage
362
Abstract
We explore in this paper the lattice sphere packing representation of a multi-antenna system and the algebraic space-time (ST) codes. We apply the sphere decoding (SD) algorithm to the resulting lattice code. For the uncoded system, SD yields, with a small increase in complexity, a huge improvement over the well-known V-BLAST detection algorithm. SD of algebraic ST codes exploits the full diversity of the coded multi-antenna system, and makes the proposed scheme very appealing to take advantage of the richness of the multi-antenna environment. The fact that the SD does not depend on the constellation size, gives rise to systems with very high spectral efficiency, maximum likelihood (ML) performance, and low decoding complexity
Keywords
algebraic codes; antenna arrays; antenna theory; computational complexity; diversity reception; lattice theory; maximum likelihood decoding; algebraic ST codes; algebraic space-time codes; antenna arrays; coded multi-antenna system; complexity; decoding complexity; diversity; lattice code; lattice sphere packing representation; maximum likelihood performance; multi-antenna system; space-time codes; spectral efficiency; sphere decoding; Detection algorithms; Error analysis; Lattices; Maximum likelihood decoding; Maximum likelihood detection; Mobile communication; Modulation coding; Redundancy; Space time codes; Transmitters;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2000. Proceedings. IEEE International Symposium on
Conference_Location
Sorrento
Print_ISBN
0-7803-5857-0
Type
conf
DOI
10.1109/ISIT.2000.866660
Filename
866660
Link To Document