Posterior Matching Scheme for Gaussian Multiple Access Channel with Feedback
Lan V. Truong

TL;DR
This paper extends the posterior matching scheme to the Gaussian multiple access channel with feedback, achieving capacity and sum-capacity, and generalizes known schemes like Ozarow's within this framework.
Contribution
It introduces a time-varying posterior matching scheme for Gaussian MAC with feedback, unifying and extending existing capacity-achieving schemes.
Findings
Achieves the capacity of two-user Gaussian channels.
Obtains the linear-feedback sum-capacity for symmetric multiuser Gaussian MAC.
Generalizes Ozarow's and Schalkwijk-Kailath's schemes within the posterior matching framework.
Abstract
Posterior matching is a method proposed by Ofer Shayevitz and Meir Feder to design capacity achieving coding schemes for general point-to-point memoryless channels with feedback. In this paper, we present a way to extend posterior matching based encoding and variable rate decoding ideas for the Gaussian MAC with feedback, referred to as time-varying posterior matching scheme, analyze the achievable rate region and error probabilities of the extended encoding-decoding scheme. The time-varying posterior matching scheme is a generalization of the Shayevitz and Feder's posterior matching scheme when the posterior distributions of the input messages given output are not fixed over transmission time slots. It turns out that the well-known Ozarow's encoding scheme, which obtains the capacity of two-user Gaussian channel, is a special case of our extended posterior matching framework as the…
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.
