Low complexity distributed STBCs with unitary relay matrices for any number of relays

Authors:
G. Susinder Rajan;B. Sundar Rajan
Affiliations:
Atheros India, LLC, Chennai, India;ECE Department, Indian Institute of Science, Bangalore, India
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Year:
2009

Citing 9
Cited 0

Code design for multihop wireless relay networks

EURASIP Journal on Advances in Signal Processing
Leveraging coherent distributed space-time codes for noncoherent communication in relay networks via training

IEEE Transactions on Wireless Communications
D-MG tradeoff and optimal codes for a class of AF and DF cooperative communication protocols

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

IEEE Transactions on Information Theory
Distributed Space-Time Coding in Wireless Relay Networks

IEEE Transactions on Wireless Communications
Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks

IEEE Transactions on Information Theory
Single-symbol maximum likelihood decodable linear STBCs

IEEE Transactions on Information Theory
Using Orthogonal and Quasi-Orthogonal Designs in Wireless Relay Networks

IEEE Transactions on Information Theory
Asymptotically optimal cooperative wireless networks with reduced signaling complexity

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Jing and Hassibi introduced a distributed space time block coding scheme for symbol synchronous, coherent, amplify and forward relay networks with half duplex constrained relay nodes. In this two phase transmission scheme, the source transmits a vector of complex symbols to the relays during the first phase and each relay applies a pre-assigned unitary transformation to the received vector or its conjugate before transmitting it to the destination during the second phase. The destination then perceives a certain structured distributed space time block code (DSTBC) whose maximum likelihood (ML) decoding complexity in general, is very high. In this paper, explicit constructions of minimum delay, full diversity, four group ML decodable DSTBCs with unitary relay matrices are provided for even number of relay nodes. Prior constructions of DSTBCs with the same features were either limited to power of two number of relay nodes or had non-unitary relay matrices which leads to large peak to average power ratio of the relay's transmitted signals. For the case of odd number of relays, constructions of minimum delay, full diversity, two group ML decodable DSTBCs are given.