Embedded Rank Distance Codes for ISI channels

Details Embedded Rank Distance Codes for ISI channels Embedded Rank Distance Codes for ISI channels

2007-07-29

arxiv.org/abs/0707.4311v1

Computer Science

Information Theory

Submitted to IEEE Transactions on Information Theory

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Embedded Rank Distance Codes for ISI channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Embedded Rank Distance Codes for ISI channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Embedded Rank Distance Codes for ISI channels will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-358958