[Paper Review] High Date-Rate Single-Symbol ML Decodable Distributed STBCs for Cooperative Networks

Zhihang Yi, Il‐Min Kim|arXiv (Cornell University)|Sep 11, 2006

Cooperative Communication and Network Coding24 references9 citations

TL;DR

This paper proposes high-rate Distributed Orthogonal Space-Time Block Codes (DOSTBCs) that achieve single-symbol maximum-likelihood (ML) decodability and full diversity in cooperative networks. By introducing row-monomial DOSTBCs with diagonal noise covariance, the authors derive an upper bound on data rate—approximately double that of conventional repetition-based schemes—and present systematic construction methods to achieve this bound.

ABSTRACT

High data-rate Distributed Orthogonal Space-Time Block Codes (DOSTBCs) which achieve the single-symbol decodability and full diversity order are proposed in this paper. An upper bound of the data-rate of the DOSTBC is derived and it is approximately twice larger than that of the conventional repetition-based cooperative strategy. In order to facilitate the systematic constructions of the DOSTBCs achieving the upper bound of the data-rate, some special DOSTBCs, which have diagonal noise covariance matrices at the destination terminal, are investigated. These codes are referred to as the row-monomial DOSTBCs. An upper bound of the data-rate of the row-monomial DOSTBC is derived and it is equal to or slightly smaller than that of the DOSTBC. Lastly, the systematic construction methods of the row-monomial DOSTBCs achieving the upper bound of the data-rate are presented.

Motivation & Objective

• To address the low data-rate limitation of conventional cooperative communication schemes based on repetition diversity.
• To develop Distributed Orthogonal Space-Time Block Codes (DOSTBCs) that support high data rates while maintaining single-symbol ML decodability.
• To derive an upper bound on the achievable data rate for DOSTBCs and identify conditions under which this bound can be approached or reached.
• To introduce and analyze a special class of DOSTBCs—row-monomial DOSTBCs—featuring diagonal noise covariance matrices to simplify design and decoding.
• To provide systematic construction methods for row-monomial DOSTBCs that achieve the theoretical data-rate upper bound.

Proposed method

• Deriving an upper bound on the data rate of general DOSTBCs, showing it is approximately twice that of conventional repetition-based cooperative strategies.
• Introducing row-monomial DOSTBCs, a subclass of DOSTBCs where the noise covariance matrix at the destination is diagonal, simplifying ML decoding.
• Deriving an upper bound on the data rate of row-monomial DOSTBCs, which is equal to or slightly less than the bound for general DOSTBCs.
• Designing systematic construction procedures for row-monomial DOSTBCs that achieve the derived data-rate upper bound.
• Ensuring the constructed codes maintain full diversity order and single-symbol decodability through structural constraints on code matrices.

Experimental results

Research questions

• RQ1 What is the theoretical maximum data rate achievable by DOSTBCs in cooperative networks while preserving single-symbol ML decodability and full diversity?
• RQ2 How does the data rate of the proposed DOSTBCs compare to conventional repetition-based cooperative schemes?
• RQ3 Can a subclass of DOSTBCs—row-monomial DOSTBCs—achieve the same data-rate upper bound as general DOSTBCs?
• RQ4 What structural properties enable systematic construction of high-rate, single-symbol decodable DOSTBCs with diagonal noise covariance?
• RQ5 What conditions ensure that the constructed DOSTBCs maintain full diversity and efficient ML decoding?

Key findings

• The upper bound on the data rate of DOSTBCs is approximately twice that of conventional repetition-based cooperative strategies.
• Row-monomial DOSTBCs achieve a data-rate upper bound that is equal to or only slightly smaller than that of general DOSTBCs.
• The proposed systematic construction methods for row-monomial DOSTBCs successfully achieve the derived data-rate upper bound.
• The use of diagonal noise covariance matrices in row-monomial DOSTBCs enables single-symbol ML decodability with reduced decoding complexity.
• The constructed codes maintain full diversity order, ensuring reliable communication over fading channels.
• The theoretical data-rate upper bound for DOSTBCs is shown to be achievable through the proposed construction framework.