Fast-Decodable MIDO Codes With Large Coding Gain

IEEE Transactions on Information Theory(2014)

引用 26|浏览65
暂无评分
摘要
In this paper, a new method is proposed to obtain full-diversity, rate-2 (rate of two complex symbols per channel use) space-time block codes (STBCs) that are full-rate for multiple input double output (MIDO) systems. Using this method, rate-2 STBCs for 4 $\\,\\times\\,$2, 6$\\,\\times\\,$2, 8$\\,\\times\\,$2, and 12 $\\,\\times\\,$2 systems are constructed and these STBCs are fast ML-decodable, have large coding gains, and STBC-schemes consisting of these STBCs have a non-vanishing determinant (NVD) so that they are DMT-optimal for their respective MIDO systems. It is also shown that the Srinath-Rajan code for the 4 $\\,\\times\\,$2 system, which has the lowest ML-decoding complexity among known rate-2 STBCs for the 4$\\,\\times\\,$2 MIDO system with a large coding gain for 4-/16-QAM, has the same algebraic structure as the STBC constructed in this paper for the 4 $\\,\\times\\,$2 system. This also settles in positive a previous conjecture that the STBC-scheme that is based on the Srinath-Rajan code has the NVD property and hence is DMT-optimal for the 4 $\\,\\times\\,$2 system.
更多
查看译文
关键词
Cyclic division algebra (CDA), fast-decodability, Galois group, multiple-input double-output (MIDO) systems, non-vanishing determinant (NVD), space-time block codes (STBCs)
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要