Separation Theorems for Phase-Incoherent Multiple-User Channels
Hamidreza Ebrahimzadeh Saffar, Ehsan Haj Mirza Alian, Patrick Mitran

TL;DR
This paper establishes the optimality of source-channel separation for phase-incoherent multi-user channels with unknown phase shifts, providing necessary and sufficient conditions for reliable transmission of correlated sources.
Contribution
It derives tight separation theorems for various phase-incoherent multi-user channels, extending the understanding of source-channel coding in the presence of unknown phase shifts.
Findings
Derived outer bounds based on source entropy content.
Established conditions under which separation is optimal.
Conjectured general optimality of separation for all channel coefficients.
Abstract
We study the transmission of two correlated and memoryless sources over several multiple-user phase asynchronous channels. Namely, we consider a class of phase-incoherent multiple access relay channels (MARC) with both non-causal and causal unidirectional cooperation between encoders, referred to as phase-incoherent unidirectional non-causal cooperative MARC (PI-UNCC-MARC), and phase-incoherent unidirectional causal cooperative MARC (PI-UCC-MARC) respectively. We also consider phase-incoherent interference channels (PI-IC), and interference relay channel (PI-IRC) models in the same context. In all cases, the input signals are assumed to undergo non-ergodic phase shifts due to the channel. The shifts are assumed to be unknown to the transmitters and known to the receivers as a realistic assumption. Both necessary and sufficient conditions in order to reliably send the correlated…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsWireless Communication Security Techniques · Cooperative Communication and Network Coding · Cellular Automata and Applications
