# Noncoherent Low-Decoding-Complexity Space-Time Codes for Wireless Relay   Networks

**Authors:** G. Susinder Rajan, B. Sundar Rajan

arXiv: 0704.2511 · 2016-11-17

## TL;DR

This paper extends differential encoding schemes for wireless relay networks to include scaled unitary matrices, proposing a low decoding complexity distributed differential space-time code scheme that enhances cooperative diversity.

## Contribution

It introduces a novel class of low decoding complexity distributed differential space-time codes using scaled unitary matrices for cooperative wireless networks.

## Key findings

- Proposed a new class of DDSTCs with full diversity and high rate.
- Established conditions for relay matrices and codebooks in the extended setup.
- First known low decoding complexity DDSTC scheme for cooperative networks.

## Abstract

The differential encoding/decoding setup introduced by Kiran et al, Oggier et al and Jing et al for wireless relay networks that use codebooks consisting of unitary matrices is extended to allow codebooks consisting of scaled unitary matrices. For such codebooks to be used in the Jing-Hassibi protocol for cooperative diversity, the conditions that need to be satisfied by the relay matrices and the codebook are identified. A class of previously known rate one, full diversity, four-group encodable and four-group decodable Differential Space-Time Codes (DSTCs) is proposed for use as Distributed DSTCs (DDSTCs) in the proposed set up. To the best of our knowledge, this is the first known low decoding complexity DDSTC scheme for cooperative wireless networks.

## Full text

Tomesphere does not host the full text of arXiv papers. Read it on arXiv: https://arxiv.org/abs/0704.2511

## References

11 references — full list in the complete paper: https://tomesphere.com/paper/0704.2511/full.md

---
Source: https://tomesphere.com/paper/0704.2511