On the design of delay-tolerant distributed space-time codes with minimum length

Authors:
Mehdi Torbatian;Mohamed Oussama Damen
Affiliations:
Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, Ontario;Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, Ontario
Venue:
IEEE Transactions on Wireless Communications
Year:
2009

Citing 13
Cited 1

Space-time block codes for quasi-synchronous cooperative diversity

MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Space-Time code designs based on the generalized binary rank criterion with applications to cooperative diversity

WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
Algebraic tools to build modulation schemes for fading channels

IEEE Transactions on Information Theory
Space-time codes for high data rate wireless communication: performance criterion and code construction

IEEE Transactions on Information Theory
On the theory of space-time codes for PSK modulation

IEEE Transactions on Information Theory
A new approach to layered space-time coding and signal processing

IEEE Transactions on Information Theory
Universal space-time coding

IEEE Transactions on Information Theory
On maximum-likelihood detection and the search for the closest lattice point

IEEE Transactions on Information Theory
Systematic construction of full diversity algebraic constellations

IEEE Transactions on Information Theory
A unified construction of space-time codes with optimal rate-diversity tradeoff

IEEE Transactions on Information Theory
Shift-full-rank matrices and applications in space-time trellis codes for relay networks with asynchronous cooperative diversity

IEEE Transactions on Information Theory
Delay-Tolerant Distributed-TAST Codes for Cooperative Diversity

IEEE Transactions on Information Theory
A simple transmit diversity technique for wireless communications

IEEE Journal on Selected Areas in Communications

DMT analysis of asynchronous OFDM decode-and-forward cooperative networks

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications

Quantified Score

Hi-index	0.01

Visualization

Abstract

The construction of distributed space-time codes for asynchronous relays is considered. A novel algebraic structure is proposed and shown to achieve full diversity for arbitrary number of relays, arbitrary input alphabets, and arbitrary delay profiles among the relays. Unlike previously proposed delay tolerant schemes, the new design has minimum length which translates into smaller decoding complexity at the same transmission rate. Full-rate and full-diversity are achieved by the new designs with or without the use of guard intervals between successive transmissions. Simulation results confirm the mathematical analysis of the proposed codes.