Name
Abstract | ||
|---|---|---|
We explore in this letter 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 resulted lattice code. For the uncoded system, SD yields, with 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 performance, and low decoding complexity. Index Terms—Diversity, lattices, maximum likelihood decoding, multi-antenna, rotated constellations, space-time codes. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1109/4234.846498 | Communications Letters, IEEE |
Keywords | Field | DocType |
Rayleigh channels,algebraic codes,computational complexity,maximum likelihood decoding,receiving antennas,signal detection,transmitting antennas,Rayleigh fading channel,V-BLAST detection algorithm,algebraic space-time codes,coded multi-antenna system,high spectral efficiency,lattice code decoder,lattice sphere packing representation,low decoding complexity,maximum likelihood decoding,maximum-likelihood performance,receiving antenna,sphere decoding algorithm,transmitting antenna,uncoded system | Space time,Algebraic number,Detection theory,Lattice (order),Computer science,Sphere packing,Algorithm,Theoretical computer science,Real-time computing,Constellation,Decoding methods,Computational complexity theory | Journal |
Volume | Issue | ISSN |
4 | 5 | 1089-7798 |
Citations | PageRank | References |
365 | 61.65 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Oussama Damen | 1 | 365 | 61.65 |
| Ammar Chkeif | 2 | 365 | 61.65 |
| Jean-Claude Belfiore | 3 | 366 | 62.75 |