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)

zbMATH Keywords

Shannon capacityMIMO systemsspace-time codingchannel capacityspace-time processingtransmit diversityBell labs layered space time (BLAST)space-time spreading (STS)

Mathematics Subject Classification ID

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

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)

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

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)