Lattice code decoder for space-time codes
Oussama Damen, Ammar Chkeif, J.-C. Belfiore · IEEE Communications Letters · 2000
We explore 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.
Cited by 756 works. doi:10.1109/4234.846498
Authors
References
- Capacity of Multi‐antenna Gaussian Channels
- Space-time codes for high data rate wireless communication: performance criterion and code construction
- Space-time block codes from orthogonal designs
- Capacity of Multi-Antenna Gaussian Channels
- V-BLAST: an architecture for realizing very high data rates over the rich-scattering wireless channel
- Sphere Packings, Lattices and Groups.
- Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
- A universal lattice code decoder for fading channels
- Sphere Packings, Lattices and Groups