Abstract
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 lose 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.
| Original language | English |
|---|---|
| Article number | 5773050 |
| Pages (from-to) | 3567-3581 |
| Number of pages | 15 |
| Journal | IEEE Transactions on Information Theory |
| Volume | 57 |
| Issue number | 6 |
| DOIs | |
| Publication status | Published - 1 Jun 2011 |
Keywords
- Cooperative communication
- cyclic division algebra
- delay-tolerance
- distributed space-time codes
- perfect codes
- tensor product
Fingerprint
Dive into the research topics of 'Construction of new delay-tolerant space-time codes'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver