Distributed STBCs with Full-diversity Partial Interference Cancellation Decoding

TL;DR

This paper demonstrates that certain distributed space-time block codes can achieve full diversity in relay networks using low-complexity PIC and PIC-SIC decoding, and introduces new codes with improved rates and performance.

Contribution

The paper provides conditions for full-diversity decoding with PIC/PIC-SIC and constructs a new class of low-complexity, high-rate, full-diversity DSTBCs based on complex orthogonal designs.

Findings

DSTBCs achieve full diversity with PIC/PIC-SIC decoders.

New codes outperform existing low-complexity DSTBCs in BER.

Proposed codes have higher rates than previous multigroup ML decodable codes.

Abstract

Recently, Guo and Xia introduced low complexity decoders called Partial Interference Cancellation (PIC) and PIC with Successive Interference Cancellation (PIC-SIC), which include the Zero Forcing (ZF) and ZF-SIC receivers as special cases, for point-to-point MIMO channels. In this paper, we show that PIC and PIC-SIC decoders are capable of achieving the full cooperative diversity available in wireless relay networks. We give sufficient conditions for a Distributed Space-Time Block Code (DSTBC) to achieve full diversity with PIC and PIC-SIC decoders and construct a new class of DSTBCs with low complexity full-diversity PIC-SIC decoding using complex orthogonal designs. The new class of codes includes a number of known full-diversity PIC/PIC-SIC decodable Space-Time Block Codes (STBCs) constructed for point-to-point channels as special cases. The proposed DSTBCs achieve higher rates (in complex symbols per channel use) than the multigroup ML decodable DSTBCs available in the literature. Simulation results show that the proposed codes have better bit error rate performance than the best known low complexity, full-diversity DSTBCs.