Embedded Rank Distance Codes for ISI Channels

DOI10.1109/TIT.2008.929960MaRDI QIDQ3604862zbMATH OpenFDO

Authors Sanket Dusad, Robert Calderbank, Suhas N. Diggavi

Publication date 24 February 2009

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

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

zbMATH Keywords

Diversity embeddingfading channelsintersymbol interference (ISI)rank-distance codesspace-time codesunequal error protection

Mathematics Subject Classification ID

Source coding (94A29) Channel models (including quantum) in information and communication theory (94A40)

Abstract: Designs for transmit alphabet constrained space-time codes naturally lead to questions about the design of rank distance codes. Recently, diversity embedded multi-level space-time codes for flat fading channels have been designed from sets of binary matrices with rank distance guarantees over the binary field by mapping them onto QAM and PSK constellations. In this paper we demonstrate that diversity embedded space-time codes for fading Inter-Symbol Interference (ISI) channels can be designed with provable rank distance guarantees. As a corollary we obtain an asymptotic characterization of the fixed transmit alphabet rate-diversity trade-off for multiple antenna fading ISI channels. The key idea is to construct and analyze properties of binary matrices with a particular structure induced by ISI channels.

Recommendations

• Maximum rank distance codes as space~time codes
• A rank criterion for QAM space-time codes
• Space-time block codes from orthogonal designs
• scientific article; zbMATH DE number 2135153
• On the theory of space-time codes for PSK modulation

Cited in

(1)

• Maximum rank distance codes as space~time codes

This page was built for publication: Embedded Rank Distance Codes for ISI Channels

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