On the capacity of certain space-time coding schemes

DOI10.1155/S1110865702000811MaRDI QIDQ1607642zbMATH OpenFDO

Authors Constantinos B. Papadias, Gerard J. Foschini

Publication date 10 July 2003

Published in EURASIP Journal on Applied Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1155/S1110865702000811

zbMATH Keywords

Bell labs layered space time (BLAST)channel capacityMIMO systemsShannon capacityspace-time codingspace-time processingspace-time spreading (STS)transmit diversity

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Channel models (including quantum) in information and communication theory (94A40)

Review text

The authors present a framework for analyzing Space-Time Coding (STC) architectures in terms of Shannon capacity. While the Shannon capacity of multiple-input multiple-output channels has been known for a number of years, the attainment of these capacities remains a challenging issue in many cases. The introduction of space-time coding schemes in the last few years has, however, begun paving the way towards the attainment of the promised capacities. The authors have made an attempt to describe what are the attainable information rates of certain STC schemes by quantifying their inherent capacity penalties.

Recommendations

• On performance limits of space-time codes: a sphere-packing bound approach
• Performance of Space–Time Codes: Gallager Bounds and Weight Enumeration
• A Quasi-Random Approach to Space–Time Codes
• On the Existence of Perfect Space–Time Codes
• Space-time coding. Theory and practice.
• On Space–Time Coding in the Presence of Spatio-Temporal Correlation
• Properties of Space-Time Codes for Frequency-Selective Channels
• Space–Time Codes From Sum-Rank Codes
• Performance bounds for space-time trellis codes
• On low-complexity space-time coding for quasi-static channels

Cited in

(4)

• Application of Randomization Techniques to Space-Time Convolutional Codes
• Capacity-approaching space-time codes for systems employing four transmitter antennas
• On low-complexity space-time coding for quasi-static channels
• On the Existence of Perfect Space–Time Codes

This page was built for publication: On the capacity of certain space-time coding schemes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1607642)