Rank distance codes for ISI channels

Published

Journal Article

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 by using sets of binary matrices with rank distance guarantees over the binary field and mapping them onto QAM and PSK constellations. In this paper we give the design of diversity embedded space-time codes for fading Inter-Symbol Interference (ISI) channels with provable rank distance guarantees. In the process of doing so we also get a (asymptotic) characterization of the rate-diversity trade-off for multiple antenna fading ISI channels when there is a fixed transmit alphabet constraint. The key idea is to construct and analyze properties of binary matrices with the particular structure induced by ISI channels. ©2007 IEEE.

Full Text

Duke Authors

Cited Authors

  • Dusad, S; Diggavi, SN; Calderbank, AR

Published Date

  • December 1, 2007

Published In

  • Proceedings of the 2007 Ieee Information Theory Workshop on Information Theory for Wireless Networks, Itw

Start / End Page

  • 32 - 36

Digital Object Identifier (DOI)

  • 10.1109/ITWITWN.2007.4318026

Citation Source

  • Scopus