Capacity of a Class of Diamond Channels

DOI10.1109/TIT.2011.2158877MaRDI QIDQ5272405zbMATH OpenOpenAlexFDO

Authors Wei Kang, Sennur Ulukus

Publication date 12 July 2017

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

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

Mathematics Subject Classification ID

Source coding (94A29) Channel models (including quantum) in information and communication theory (94A40)

Abstract: We study a special class of diamond channels which was introduced by Schein in 2001. In this special class, each diamond channel consists of a transmitter, a noisy relay, a noiseless relay and a receiver. We prove the capacity of this class of diamond channels by providing an achievable scheme and a converse. The capacity we show is strictly smaller than the cut-set bound. Our result also shows the optimality of a combination of decode-and-forward (DAF) and compress-and-forward (CAF) at the noisy relay node. This is the first example where a combination of DAF and CAF is shown to be capacity achieving. Finally, we note that there exists a duality between this diamond channel coding problem and the Kaspi-Berger source coding problem.

Cited in

(1)

• Broadcast diamond channel: transmission strategies and bounds

This page was built for publication: Capacity of a Class of Diamond Channels

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