On performance limits of space-time codes: a sphere-packing bound approach

DOI10.1109/TIT.2003.817453MaRDI QIDQ3546885zbMATH OpenFDO

Authors Majid Fozunbal, Steven W. McLaughlin, Ronald W. Schafer

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2003.817453

zbMATH Keywords

average word-error probability (WEP)performance limits of space-time codesRayleigh block-fading channels under delay and maximum energy constraintssphere-packing bound (SPB)

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Recommendations

• Performance of Space–Time Codes: Gallager Bounds and Weight Enumeration
• Performance bounds for space-time trellis codes
• On the Performance Analysis of Space–Time Codes in Quasi-Static Rayleigh-Fading Channels
• The sphere packing bound for memoryless channels
• Space-time block codes from orthogonal designs

Cited in

(3)

• On the capacity of certain space-time coding schemes
• The sphere packing bound for memoryless channels
• Performance of Space–Time Codes: Gallager Bounds and Weight Enumeration

This page was built for publication: On performance limits of space-time codes: a sphere-packing bound approach

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