Abstract
Nonvanishing determinants have emerged as an attractive criterion enabling a space-time code achieve the optimal diversity-multiplexing gains tradeoff. It seems that cyclic division algebras play the most crucial role in designing a space-time code with nonvanishing determinants. In this paper, we explicitly construct space-time codes for arbitrary numbers of transmit antennas that achieve nonvanishing determinants and the optimal diversity-multiplexing gains tradeoff over Z [i]. Unlike previous methods usually arising a field compositum for two or more fields, our scheme, which only requires one simple extension, constitutes a much more efficient and feasible advancement whether in theory or practice.
| Original language | English |
|---|---|
| Pages (from-to) | 557-563 |
| Number of pages | 7 |
| Journal | IEEE Transactions on Information Theory |
| Volume | 55 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 2009 Mar 4 |
Fingerprint
Keywords
- Field extensions
- Galois theory
- Optimal diversitymultiplexing gains tradeoff
- Space-time codes
ASJC Scopus subject areas
- Information Systems
- Computer Science Applications
- Library and Information Sciences
Cite this
Generally explicit space-time codes with nonvanishing determinants for arbitrary numbers of transmit antennas. / Li, Hua Chieh; Chen, Ming Yang.
In: IEEE Transactions on Information Theory, Vol. 55, No. 2, 04.03.2009, p. 557-563.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Generally explicit space-time codes with nonvanishing determinants for arbitrary numbers of transmit antennas
AU - Li, Hua Chieh
AU - Chen, Ming Yang
PY - 2009/3/4
Y1 - 2009/3/4
N2 - Nonvanishing determinants have emerged as an attractive criterion enabling a space-time code achieve the optimal diversity-multiplexing gains tradeoff. It seems that cyclic division algebras play the most crucial role in designing a space-time code with nonvanishing determinants. In this paper, we explicitly construct space-time codes for arbitrary numbers of transmit antennas that achieve nonvanishing determinants and the optimal diversity-multiplexing gains tradeoff over Z [i]. Unlike previous methods usually arising a field compositum for two or more fields, our scheme, which only requires one simple extension, constitutes a much more efficient and feasible advancement whether in theory or practice.
AB - Nonvanishing determinants have emerged as an attractive criterion enabling a space-time code achieve the optimal diversity-multiplexing gains tradeoff. It seems that cyclic division algebras play the most crucial role in designing a space-time code with nonvanishing determinants. In this paper, we explicitly construct space-time codes for arbitrary numbers of transmit antennas that achieve nonvanishing determinants and the optimal diversity-multiplexing gains tradeoff over Z [i]. Unlike previous methods usually arising a field compositum for two or more fields, our scheme, which only requires one simple extension, constitutes a much more efficient and feasible advancement whether in theory or practice.
KW - Field extensions
KW - Galois theory
KW - Optimal diversitymultiplexing gains tradeoff
KW - Space-time codes
UR - http://www.scopus.com/inward/record.url?scp=61349199621&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=61349199621&partnerID=8YFLogxK
U2 - 10.1109/TIT.2008.2009795
DO - 10.1109/TIT.2008.2009795
M3 - Article
AN - SCOPUS:61349199621
VL - 55
SP - 557
EP - 563
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
SN - 0018-9448
IS - 2
ER -