Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
153 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On the Ozarow-Leung Scheme for the Gaussian Broadcast Channel with Feedback (1412.6782v1)

Published 21 Dec 2014 in cs.IT and math.IT

Abstract: In this work, we consider linear-feedback schemes for the two-user Gaussian broadcast channel with noiseless feedback. We extend the transmission scheme of [Ozarow and Leung, 1984] by applying estimators with memory instead of the memoryless estimators used by Ozarow and Leung (OL) in their original work. A recursive formulation of the mean square errors achieved by the proposed estimators is provided, along with a proof for the existence of a fixed point. This enables characterizing the achievable rates of the extended scheme. Finally, via numerical simulations it is shown that the extended scheme can improve upon the original OL scheme in terms of achievable rates, as well as achieve a low probability of error after a finite number of channel uses.

Citations (6)

Summary

We haven't generated a summary for this paper yet.