[Paper Review] Distributed Space Time Codes with Low Decoding Complexity for Asynchronous Relay Networks

G. Susinder Rajan, B. Sundar Rajan|ArXiv.org|Sep 18, 2007

Cooperative Communication and Network Coding10 references3 citations

TL;DR

This paper proposes a distributed space-time coding scheme for asynchronous relay networks that achieves full cooperative diversity with low decoding complexity by leveraging OFDM and structured space-time codes. It extends the Li-Xia scheme to support any number of relays using four-group decodable codes, and integrates differential encoding to enable performance without channel or timing knowledge at the destination.

ABSTRACT

Recently Li and Xia have proposed a transmission scheme for wireless relay networks based on the Alamouti space time code and orthogonal frequency division multiplexing to combat the effect of timing errors at the relay nodes. This transmission scheme is amazingly simple and achieves a diversity order of two for any number of relays. Motivated by its simplicity, this scheme is extended to a more general transmission scheme that can achieve full cooperative diversity for any number of relays. The conditions on the distributed space time code (DSTC) structure that admit its application in the proposed transmission scheme are identified and it is pointed out that the recently proposed full diversity four group decodable DSTCs from precoded co-ordinate interleaved orthogonal designs and extended Clifford algebras satisfy these conditions. It is then shown how differential encoding at the source can be combined with the proposed transmission scheme to arrive at a new transmission scheme that can achieve full cooperative diversity in asynchronous wireless relay networks with no channel information and also no timing error knowledge at the destination node. Finally, four group decodable distributed differential space time codes applicable in this new transmission scheme for power of two number of relays are also provided.

Motivation & Objective

• Address the challenge of timing offsets in asynchronous relay networks that degrade performance in traditional cooperative diversity schemes.
• Develop a transmission scheme that achieves full cooperative diversity for any number of relays despite asynchronous relay operations.
• Reduce maximum-likelihood decoding complexity by enabling single-symbol decoding via structured space-time code design.
• Enable robust performance in the absence of channel state information and timing error knowledge at the destination using differential encoding.
• Extend existing synchronous distributed STC designs to asynchronous networks while preserving full diversity and low decoding complexity.

Proposed method

• Adapt the Li-Xia transmission scheme by applying OFDM at the source and using time reversal/conjugation at relay nodes to mitigate timing offsets.
• Design a general transmission framework where relay processing matrices are chosen such that the effective channel at the destination forms a structured space-time code with single-symbol decodable properties.
• Utilize four-group decodable distributed space-time codes from precoded coordinate interleaved orthogonal designs and extended Clifford algebras, which satisfy the required invariance conditions under relay processing.
• Integrate differential encoding at the source using unitary codeword matrices to eliminate the need for channel state information at the destination.
• Apply the four-group decodable distributed differential STC from [7] to the proposed scheme, ensuring applicability for power-of-two relay counts.
• Ensure that the relay processing matrices commute or anti-commute with the code matrices to preserve code structure and enable low-complexity decoding.

Experimental results

Research questions

• RQ1 Can a distributed space-time coding scheme achieve full cooperative diversity in asynchronous relay networks with low decoding complexity?
• RQ2 What structural conditions must a distributed space-time code satisfy to be compatible with the proposed transmission scheme?
• RQ3 Can differential encoding be effectively combined with the proposed scheme to eliminate the need for channel state information and timing error knowledge?
• RQ4 Are existing four-group decodable distributed STCs applicable in the proposed asynchronous transmission framework?
• RQ5 What is the performance trade-off between channel knowledge and differential transmission in terms of coding gain and SNR?

Key findings

• The proposed transmission scheme achieves full cooperative diversity for any number of relays in asynchronous networks, overcoming the diversity limitation of clustering-based schemes.
• Four-group decodable distributed STCs from [4,5,6] satisfy the required invariance conditions and are directly applicable in the proposed scheme, enabling low decoding complexity.
• The integration of differential encoding with the proposed scheme allows full diversity performance without requiring channel state information or knowledge of timing offsets at the destination.
• Simulation results show that the differential scheme performs approximately 5 dB worse than the coherent scheme due to signal set changes and rate loss from differential encoding.
• The scheme requires a large coherence interval and incurs a rate loss due to cyclic prefix, but both can be minimized by increasing the FFT size N.
• The proposed framework is extendable to frequency-offset scenarios, though this remains an open problem for future work.