Title :
Construction of New Delay-Tolerant Space-Time Codes
Author :
Sarkiss, Mireille ; Othman, G.R.-B. ; Damen, Mohamed Oussama ; Belfiore, Jean-Claude
Author_Institution :
Dept. of Commun. & Electron., TELECOM ParisTech, Paris, France
fDate :
6/1/2011 12:00:00 AM
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.
Keywords :
MIMO communication; algebra; cooperative communication; space-time codes; MIMO system; asynchronous transmission; cooperative network; cyclic division algebra; delay-tolerant space-time code; diversity-multiplexing tradeoff; multiple-input multiple-output system; optimal code; optimal distributed space-time code; perfect code; Algebra; Delay; Lattices; MIMO; Relays; Space time codes; Synchronization; Cooperative communication; cyclic division algebra; delay-tolerance; distributed space-time codes; perfect codes; tensor product;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2011.2137230
