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
N1 - Funding Information:
Manuscript received August 30, 2005; revised September 24, 2008. Current version published February 04, 2009. This work was supported by the National Science Council, Taiwan, under Contract NSC 95-2115-M-003-006-MY3. H.-C. Li is with the Department of Mathematics, National Taiwan Normal University, Taipei 116, Taiwan (e-mail: [email protected]). M.-Y. Chen is with the Department of Electrical Engineering, Stanford University, Stanford, CA 94305 USA (e-mail: [email protected]). Communicated by B. S. Rajan, Associate Editor for Coding Theory. Digital Object Identifier 10.1109/TIT.2008.2009795
PY - 2009
Y1 - 2009
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
SN - 0018-9448
VL - 55
SP - 557
EP - 563
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 2
ER -