Construction of New Delay-Tolerant Space-Time Codes

• Published in: IEEE transactions on information theory Vol. 57; no. 6; pp. 3567 - 3581
• Main Authors: Sarkiss, M, Othman, Ghaya Rekaya-Ben, Damen, M O, Belfiore, Jean-Claude
• Format: Journal Article
• Language: English
• Published: New York, NY IEEE 01.06.2011; Institute of Electrical and Electronics Engineers; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algebra; Applied sciences; Codes; Coding, codes; Cooperative communication; cyclic division algebra; Data transmission; Delay; delay-tolerance; distributed space-time codes; Exact sciences and technology; Information theory; Information, signal and communications theory; Lattices; MIMO; Multiplexers; Multiplexing; perfect codes; Relays; Signal and communications theory; Space time codes; Synchronization; Systems, networks and services of telecommunications; Telecommunications; Telecommunications and information theory; tensor product; Transmission and modulation (techniques and equipments); Multiplexing; MIMO system; Space-time codes; Relay; delay-tolerance; Cooperative communication; Tensor product; Cooperative systems; Synchronization; distributed space-time codes; cyclic division algebra; Optimal code; Perfect code; Delay time; Driver information systems; Delayed time; Asynchronous transmission; perfect codes
• ISSN: 0018-9448; 1557-9654
• DOI: 10.1109/TIT.2011.2137230

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.