We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Electronics & Telecommunication Engineering/Lattice code decoder for space-time codes
PeriodicalsElectronics & Telecommunication Engineering

Lattice code decoder for space-time codes

Checking your access to this record.

Abstract & Overview

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.

Cite this record

Oussama Damen, A. Chkeif, J.-C. Belfiore (2000). Lattice code decoder for space-time codes. IEEE Communications Letters, 4(5), 161–163. https://doi.org/10.1109/4234.846498

Copy in another style

Damen, O., Chkeif, A., & Belfiore, J. (2000). Lattice code decoder for space-time codes. IEEE Communications Letters, 4(5), 161–163. https://doi.org/10.1109/4234.846498
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.