Shift-full-rank matrices and applications in space-time trellis codes for relay networks with asynchronous cooperative diversity

Authors:
Y. Shang;X. -G. Xia
Affiliations:
Dept. of Electr. & Comput. Eng., Delaware Univ., Newark, DE, USA;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 19

Computationally efficient equalization for asynchronous cooperative communications with multiple frequency offsets

IEEE Transactions on Wireless Communications
Distributed space-time trellis code for asynchronous cooperative communications under frequency-selective channels

IEEE Transactions on Wireless Communications
On the design of delay-tolerant distributed space-time codes with minimum length

IEEE Transactions on Wireless Communications
Distributed space-frequency codes for cooperative communication systems with multiple carrier frequency offsets

IEEE Transactions on Wireless Communications
Delay-tolerant distributed linear convolutional space-time code with minimum memory length under frequency-selective channels

IEEE Transactions on Wireless Communications
Time domain interference cancellation for Alamouti coded cooperative OFDM systems with insufficient CP

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Iteratively suboptimum decoder design for distributed space-time coding based on distributed interleavers

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
DMT analysis of asynchronous OFDM decode-and-forward cooperative networks

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
A distributed linear convolutive space-frequency coding for cooperative communication systems with multiple frequency offsets

ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Delay-tolerant distributed linear convolutional space-time code under frequency-selective channels

ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Distributed space-time code for asynchronous two-way wireless relay networks under frequency-selective channels

ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Rate-1 shift group-decodable STBC

ICICS'09 Proceedings of the 7th international conference on Information, communications and signal processing
A turbo-like symbol by symbol decoder for randomly distributed space-time coding in amplify-and-forward relay networks

IEEE Communications Letters
Shift-orthogonal space-time block codes

IEEE Transactions on Communications
Multigroup ML decodable collocated and distributed space-time block codes

IEEE Transactions on Information Theory
Constructions of DMT optimal vector codes for asynchronous cooperative networks using decode-and-forward protocols

IEEE Transactions on Wireless Communications
A simple orthogonal space-time coding scheme for asynchronous cooperative systems for frequency selective fading channels

IEEE Transactions on Communications
Performance of cooperative transmissions in flat fading environment with asynchronous transmitters

MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
A linear analog network coding for asynchronous two-way relay networks

IEEE Transactions on Wireless Communications

Quantified Score

Hi-index	754.90

Visualization

Abstract

To achieve full cooperative diversity in a relay network, most of the existing space-time coding schemes require the synchronization between terminals. A family of space-time trellis codes that achieve full cooperative diversity order without the assumption of synchronization has been recently proposed. The family is based on the stack construction by Hammons and El Gamal and its generalizations by Lu and Kumar. It has been shown that the construction of such a family is equivalent to the construction of binary matrices that have full row rank no matter how their rows are shifted, where a row corresponds to a terminal (or transmit antenna) and its length corresponds to the memory size of the trellis code on that terminal. We call such matrices as shift-full-rank (SFR) matrices. A family of SFR matrices has been also constructed, but the memory sizes of the corresponding space-time trellis codes (the number of columns of SFR matrices) grow exponentially in terms of the number of terminals (the number of rows of SFR matrices), which may cause a high decoding complexity when the number of terminals is not small. In this paper, we systematically study and construct SFR matrices of any sizes for any number of terminals. Furthermore, we construct shortest (square) SFR (SSFR) matrices that correspond to space-time trellis codes with the smallest memory sizes and asynchronous full cooperative diversity. We also present some simulation results to illustrate the performances of the space-time trellis codes associated with SFR matrices in asynchronous cooperative communications.