Space-time codes based on Gaussian integers

Space-time codes based on Gaussian integers
复制标题

基于高斯整数的空时码

DOI:
--
复制
发表时间:
2002
期刊:
Proceedings IEEE International Symposium on Information Theory,
影响因子:
--
通讯作者:
Germany
Germany
中科院分区:
--
文献类型:
--
作者:
Martin Bossert;E. Gabidulin;P. Lusina;Ulm;Germany

文献摘要

被引文献

相似文献

空时码试图利用多天线传输场景的统计特性。我们专注于最大限度地提高代码的多样性,这是由码字差对之间的秩在高信噪比。这个标准必须在一个复杂的调制字母表C上进行评估。Liu等人(2000)的工作提出了一种选择GF(2/sup 2l/)上最大秩码的标准,该标准在映射到QAM调制时保留其秩属性。本文提出了一种不同的解决方案的问题的编码和调制。有限域码被认为是可以映射到复高斯整数域。任何满秩有限码构造在映射到高斯整数域时将实现最大分集。
Space time codes seek to exploit the statistical properties of a multi-antenna transmission scenario. We focus on maximizing a codes diversity which is determined by the rank between codeword difference pairs at high SNR. This criterion must be evaluated over a complex modulation alphabet C. Work by Liu et al. (2000) presents a criterion for selecting maximum rank codes over GF(2/sup 2l/) which preserve their rank properties when mapped to QAM modulation. This paper presents a different solution to the problem of coding and modulation. Finite field codes are considered which can be mapped to the complex Gaussian integer field. Any full rank finite code construction will achieve maximum diversity when mapped to the Gaussian integer field.