Distributed Decode–Forward for Relay Networks

DOI10.1109/TIT.2017.2701198zbMATH Open1370.94015arXiv1510.00832OpenAlexW2963113796MaRDI QIDQ5358558FDOQ5358558

Authors: Sung Hoon Lim, Kwang Taik Kim, Younghan Kim 

Publication date: 21 September 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: A new coding scheme for general N-node relay networks is presented for unicast, multicast, and broadcast. The proposed distributed decode-forward scheme combines and generalizes Marton coding for single-hop broadcast channels and the Cover-El Gamal partial decode-forward coding scheme for 3-node relay channels. The key idea of the scheme is to precode all the codewords of the entire network at the source by multicoding over multiple blocks. This encoding step allows these codewords to carry partial information of the messages implicitly without complicated rate splitting and routing. This partial information is then recovered at the relay nodes and forwarded further. For N-node Gaussian unicast, multicast, and broadcast relay networks, the scheme achieves within 0.5N bits from the cutset bound and thus from the capacity (region), regardless of the network topology, channel gains, or power constraints. Roughly speaking, distributed decode-forward is dual to noisy network coding, which generalized compress-forward to unicast, multicast, and multiple access relay networks.

Full work available at URL: https://arxiv.org/abs/1510.00832

Mathematics Subject Classification ID

Communication theory (94A05)

Cited In (4)

• Coding and Decoding for the Dynamic Decode and Forward Relay Protocol
• Title not available (Why is that?)
• Partial Decode-Forward Relaying for the Gaussian Two-Hop Relay Network
• Single-Symbol ML Decodable Distributed STBCs for Cooperative Networks

This page was built for publication: Distributed Decode–Forward for Relay Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5358558)