.png){kind=icon}
返回
Mixed-Q linear space-time codes
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2006.873990.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A new modulation method for linear space-time codes is proposed based on using constellations of different sizes for different symbols. It is shown that the proposed method significantly reduces the complexity of the sphere decoding algorithm. The complexity reduction is more pronounced in high-rate codes, where each code matrix carries a large number of symbols. We also show that the choice of constellation size provides a tradeoff between performance and complexity. Using this, some guidelines for choosing constellation size are presented. As one introduces more constellation disparity in the code, the complexity is further reduced, while the performance loss grows. Typically, a complexity reduction of one to two orders of magnitude can be achieved at the expense of about 3 dB coding gain. We suggest a simple modification in our design to reduce this loss to about 2 dB.
Keyword:
linear dispersion (LD) codes
multiple-input multiple-output (MIMO)
space-time codes (STCs)
sphere decoding (SD)
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
暂无机构信息
引用论文
.png){kind=icon}
查看更多内容