Computer Science – Information Theory
Scientific paper
2010-11-01
Computer Science
Information Theory
33 pages, 7 figures
Scientific paper
Perfect Space-Time Codes (STC) are optimal codes in their original construction for Multiple Input Multiple Output (MIMO) systems. Based on Cyclic Division Algebras (CDA), they are full-rate, full-diversity codes, have Non-Vanishing Determinants (NVD) and hence achieve Diversity-Multiplexing Tradeoff (DMT). In addition, these codes have led to optimal distributed space-time codes when applied in cooperative networks under the assumption of perfect synchronization between relays. However, they loose their diversity when delays are introduced and thus are not delay-tolerant. In this paper, using the cyclic division algebras of perfect codes, we construct new codes that maintain the same properties as perfect codes in the synchronous case. Moreover, these codes preserve their full-diversity in asynchronous transmission.
Belfiore Jean-Claude
Damen Mohamed Oussama
Othman Ghaya Rekaya-Ben
Sarkiss Mireille
No associations
LandOfFree
Construction of New Delay-Tolerant Space-Time Codes 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 Construction of New Delay-Tolerant Space-Time Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Construction of New Delay-Tolerant Space-Time Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-594223