.png){kind=icon}
返回
A new non-orthogonal space-time code with low decoding complexity
.png){kind=icon}
OA
AI
DOI：10.1109/TWC.2006.1633364.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A full diversity block space-time code over two transmit antennas and two symbol periods is introduced. In this method, each code is equal to the addition of two matrices; A(m) and DA(n), where A and D are the two constant matrices and m and n are the two data symbols. A is selected such that the set A(m), 0 <= m <= 2(b) - 1 is closed under the matrix multiplication. This structure allows a simple Maximum Likelihood (ML) decoding method, and at the same time, simplifies the optimization of the coding advantage. Simulations show that the performance of the new code is very close to that of the Damen code [1] which is the best known block space-time code in terms of the coding advantage. Moreover, the decoding complexity of the proposed method is significantly lower than that of the Damen code.
Keyword:
space-time coding
multiple-antenna arrays
transmit diversity
Maximum Likelihood (ML) decoding
wireless communications
期刊
IF:
10.7
论文数:
1.3W
被引数:
5.3W
机构
暂无机构信息
引用论文
Complementary Treatment of Varicose Veins — A Randomized, Placebo-Controlled, Double-Blind Trial
PREAI
分享收藏Space-time codes and concatenated channel codes for wireless communications.png)
PROCEEDINGS OF THE IEEEOAAI
PROCEEDINGS OF THE IEEEIF25.9
OAAI分享收藏分享收藏
查看更多内容