.png){kind=icon}
.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
space-time coding
multiple-antenna arrays
transmit diversity
Maximum Likelihood (ML) decoding
wireless communications
Journal
IF:
10.7
Papers:
1.3W
Citations:
5.3W
Organization
No organization information available