A Non-Orthogonal Distributed Space-Time Coded Protocol Part II-Code Construction and DM-G Tradeoff

TL;DR

This paper introduces a new family of distributed space-time codes for the GNAF protocol that reduces decoding complexity and explores the use of Toeplitz and cyclic division algebra codes, establishing a DM-G tradeoff bound.

Contribution

It proposes a novel code construction based on CIOD for GNAF, demonstrating reduced ML decoding complexity and applicability of Toeplitz and algebraic codes within this framework.

Findings

New CIOD-based distributed space-time codes with lower decoding complexity

Toeplitz and cyclic division algebra codes are compatible with GNAF

The established DM-G tradeoff bound approaches the transmit diversity limit asymptotically

Abstract

This is the second part of a two-part series of papers. In this paper, for the generalized non-orthogonal amplify and forward (GNAF) protocol presented in Part-I, a construction of a new family of distributed space-time codes based on Co-ordinate Interleaved Orthogonal Designs (CIOD) which result in reduced Maximum Likelihood (ML) decoding complexity at the destination is proposed. Further, it is established that the recently proposed Toeplitz space-time codes as well as space-time block codes (STBCs) from cyclic division algebras can be used in GNAF protocol. Finally, a lower bound on the optimal Diversity-Multiplexing Gain (DM-G) tradeoff for the GNAF protocol is established and it is shown that this bound approaches the transmit diversity bound asymptotically as the number of relays and the number of channels uses increases.