Lattice code decoder for space-time codes
Lattice code decoder for space-time codes
复制标题
DOI：
10.1109/4234.846498
复制
发表时间：
2000-05
期刊：
影响因子：
--
通讯作者：
M. O. Damen;A. Chkeif;J. Belfiore
中科院分区：
文献类型：
--
作者：
M. O. Damen;A. Chkeif;J. Belfiore
我们探讨了多安德滕纳系统和代数时空（ST）代码的晶格球体堆积表示。我们将球形解码（SD）算法应用于所得的晶格代码。对于未编码的系统，SD产量的复杂性略有增加，比众所周知的V-Blast检测算法有了巨大的改善。代数ST代码的SD利用了编码的多ANTENNA系统的全部多样性，并使拟议的计划非常吸引人，以利用多Aantenna环境的丰富性。 SD不取决于星座的大小，这一事实引起了具有很高光谱效率，最大样性能和低解码复杂性的系统。
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.