Efficient space-time codes from cyclic division algebras

Authors:
P. Vijay Kumar;Petros Elia;K. Vinodh
Affiliations:
Electrical Engineering-Systems, University of Southern California, Los Angeles, CA;Electrical Engineering-Systems, University of Southern California, Los Angeles, CA;Dept. of ECE, Indian Institute of Science, Bangalore
Venue:
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Year:
2006

Citing 17
Cited 0

Fundamentals of wireless communication

Fundamentals of wireless communication
Space-time codes achieving the DMD tradeoff of the MIMO-ARQ channel

IEEE Transactions on Information Theory
Distributed Space-Time Coding in Wireless Relay Networks

IEEE Transactions on Wireless Communications
Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels

IEEE Transactions on Information Theory
Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks

IEEE Transactions on Information Theory
Full-diversity, high-rate space-time block codes from division algebras

IEEE Transactions on Information Theory
Lattice coding and decoding achieve the optimal diversity-multiplexing tradeoff of MIMO channels

IEEE Transactions on Information Theory
Diversity-multiplexing tradeoff in multiple-access channels

IEEE Transactions on Information Theory
Cooperative diversity in wireless networks: Efficient protocols and outage behavior

IEEE Transactions on Information Theory
The golden code: a 2×2 full-rate space-time code with nonvanishing determinants

IEEE Transactions on Information Theory
STBC-schemes with nonvanishing determinant for certain number of transmit antennas

IEEE Transactions on Information Theory
On the achievable diversity-multiplexing tradeoff in half-duplex cooperative channels

IEEE Transactions on Information Theory
Approximately universal codes over slow-fading channels

IEEE Transactions on Information Theory
The MIMO ARQ Channel: Diversity–Multiplexing–Delay Tradeoff

IEEE Transactions on Information Theory
Explicit Space–Time Codes Achieving the Diversity–Multiplexing Gain Tradeoff

IEEE Transactions on Information Theory
Perfect Space–Time Block Codes

IEEE Transactions on Information Theory
Fading relay channels: performance limits and space-time signal design

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

An overview of space-time code construction based on cyclic division algebras (CDA) is presented. Applications of such space-time codes to the construction of codes optimal under the diversity-multiplexing gain (D-MG) tradeoff, to the construction of the so-called perfect space-time codes, to the construction of optimal space-time codes for the ARQ channel as well as to the construction of codes optimal for the cooperative relay network channel are discussed. We also present a construction of optimal codes based on CDA for a class of Orthogonal Amplify and Forward (OAF) protocols for the cooperative relay network.