Geometrical Relations Between Space–Time Block Code Designs and Complexity Reduction

DOI10.1109/TIT.2006.885457MaRDI QIDQ3548077zbMATH OpenOpenAlexFDO

Authors Oliver Henkel

Publication date 21 December 2008

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

Full work available at URL https://arxiv.org/abs/cs/0510047

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Abstract: In this work, the geometric relation between space time block code design for the coherent channel and its non-coherent counterpart is exploited to get an analogue of the information theoretic inequality $I(X;S)leI((X,H);S)$ in terms of diversity. It provides a lower bound on the performance of non-coherent codes when used in coherent scenarios. This leads in turn to a code design decomposition result splitting coherent code design into two complexity reduced sub tasks. Moreover a geometrical criterion for high performance space time code design is derived.

Recommendations

• Noncoherent Space–Time Coding: An Algebraic Perspective
• Non-coherent space-time code based on full diversity space-time block coding
• New space-time block codes for non-coherent MIMO systems
• Space-time block codes from orthogonal designs
• Signal design and convolutional coding for noncoherent space-time communication on the block-Rayleigh-fading channel

Cited in

(2)

• New space-time block codes for non-coherent MIMO systems
• Maximal Orders in the Design of Dense Space-Time Lattice Codes

This page was built for publication: Geometrical Relations Between Space–Time Block Code Designs and Complexity Reduction

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