Lattice code decoder for space-time codes

被引：523

作者：

Damen, O ^{[1
]}

Chkeif, A ^{[1
]}

Belfiore, JC ^{[1
]}

机构：

[1] Ecole Natl Super Telecommun, F-75634 Paris 13, France

来源：

IEEE COMMUNICATIONS LETTERS | 2000年 / 4卷 / 05期

关键词：

diversity lattices; maximum likelihood decoding; multi-antenna; rotated constellations; space-time codes;

D O I：

10.1109/4234.846498

中图分类号：

TN [电子技术、通信技术];

学科分类号：

0809 [电子科学与技术];

摘要：

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.

引用

页码：161 / 163

页数：3

共 10 条

[1]

Conway J. H., 1998, SPHERE PACKINGS LATT

[2]

DAMEN MO, 1999, JOINT CODING DECODIN

[3]

FINCKE U, 1985, MATH COMPUT, V44, P463, DOI 10.1090/S0025-5718-1985-0777278-8

[4]

Knuth P. M., 1987, GEOMETRY NUMBERS