Generally explicit space-time codes with nonvanishing determinants for arbitrary numbers of transmit antennas

Hua Chieh Li, Ming Yang Chen

Research output: Contribution to journalArticle

2 Citations (Scopus)

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 languageEnglish
Pages (from-to)557-563
Number of pages7
JournalIEEE Transactions on Information Theory
Volume55
Issue number2
DOIs
Publication statusPublished - 2009 Mar 4

Fingerprint

Space time codes
determinants
Antennas
Multiplexing
Algebra
time

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 journalArticle

@article{abe2822a2ef143d1ac3caee8d24f3592,
title = "Generally explicit space-time codes with nonvanishing determinants for arbitrary numbers of transmit antennas",
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.",
keywords = "Field extensions, Galois theory, Optimal diversitymultiplexing gains tradeoff, Space-time codes",
author = "Li, {Hua Chieh} and Chen, {Ming Yang}",
year = "2009",
month = "3",
day = "4",
doi = "10.1109/TIT.2008.2009795",
language = "English",
volume = "55",
pages = "557--563",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "2",

}

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 -