A Source-Channel Separation Theorem With Application to the Source Broadcast Problem

DOI10.1109/TIT.2016.2528279MaRDI QIDQ2976900zbMATH OpenOpenAlexFDO

Authors Kia Khezeli, Jun Chen

Publication date 28 April 2017

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

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

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Abstract: A converse method is developed for the source broadcast problem. Specifically, it is shown that the separation architecture is optimal for a variant of the source broadcast problem and the associated source-channel separation theorem can be leveraged, via a reduction argument, to establish a necessary condition for the original problem, which unifies several existing results in the literature. Somewhat surprisingly, this method, albeit based on the source-channel separation theorem, can be used to prove the optimality of non-separation based schemes and determine the performance limits in certain scenarios where the separation architecture is suboptimal.

Cited in

(2)

• Outer Bounds on the Admissible Source Region for Broadcast Channels With Correlated Sources
• Any two N × N costas signals must have at least one common ambiguity sidelobe if N > 3—A proof

This page was built for publication: A Source-Channel Separation Theorem With Application to the Source Broadcast Problem

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