Rank Distance Codes for ISI channel

Designs for transmit alphabet constrained spacetime 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. The key idea is to construct and analyze properties of binary matrices with the particular structure induced by ISI channels.


Published in:
Proceedings of the 2007 IEEE Information Theory Workshop, 32-36
Presented at:
2007 IEEE Information Theory Workshop, Bergen, Norway, Norway, July 1 – 6, 2007
Year:
2007
Laboratories:


Note: The status of this file is: Involved Laboratories Only


 Record created 2007-05-24, last modified 2018-03-17

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)