Posterior Matching for Gaussian Broadcast Channels with Feedback
Summary :
In this paper, the posterior matching scheme proposed by Shayevits and Feder is extended to the Gaussian broadcast channel with feedback, and the error probabilities and achievable rate region are derived for this coding strategy by using the iterated random function theory. A variant of the Ozarow-Leung code for the general two-user broadcast channel with feedback can be realized as a special case of our coding scheme. Furthermore, for the symmetric Gaussian broadcast channel with feedback, our coding scheme achieves the linear-feedback sum-capacity like the LQG code and outperforms the Kramer code.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E100-A No.5 pp.1165-1178
- Publication Date
- 2017/05/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E100.A.1165
- Type of Manuscript
- PAPER
- Category
- Information Theory
Authors
Lan V. TRUONG
National University of Singapore
Hirosuke YAMAMOTO
The University of Tokyo
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Lan V. TRUONG, Hirosuke YAMAMOTO, "Posterior Matching for Gaussian Broadcast Channels with Feedback" in IEICE TRANSACTIONS on Fundamentals,
vol. E100-A, no. 5, pp. 1165-1178, May 2017, doi: 10.1587/transfun.E100.A.1165.
Abstract: In this paper, the posterior matching scheme proposed by Shayevits and Feder is extended to the Gaussian broadcast channel with feedback, and the error probabilities and achievable rate region are derived for this coding strategy by using the iterated random function theory. A variant of the Ozarow-Leung code for the general two-user broadcast channel with feedback can be realized as a special case of our coding scheme. Furthermore, for the symmetric Gaussian broadcast channel with feedback, our coding scheme achieves the linear-feedback sum-capacity like the LQG code and outperforms the Kramer code.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E100.A.1165/_p
Copy
@ARTICLE{e100-a_5_1165,
author={Lan V. TRUONG, Hirosuke YAMAMOTO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Posterior Matching for Gaussian Broadcast Channels with Feedback},
year={2017},
volume={E100-A},
number={5},
pages={1165-1178},
abstract={In this paper, the posterior matching scheme proposed by Shayevits and Feder is extended to the Gaussian broadcast channel with feedback, and the error probabilities and achievable rate region are derived for this coding strategy by using the iterated random function theory. A variant of the Ozarow-Leung code for the general two-user broadcast channel with feedback can be realized as a special case of our coding scheme. Furthermore, for the symmetric Gaussian broadcast channel with feedback, our coding scheme achieves the linear-feedback sum-capacity like the LQG code and outperforms the Kramer code.},
keywords={},
doi={10.1587/transfun.E100.A.1165},
ISSN={1745-1337},
month={May},}
Copy
TY - JOUR
TI - Posterior Matching for Gaussian Broadcast Channels with Feedback
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1165
EP - 1178
AU - Lan V. TRUONG
AU - Hirosuke YAMAMOTO
PY - 2017
DO - 10.1587/transfun.E100.A.1165
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E100-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 2017
AB - In this paper, the posterior matching scheme proposed by Shayevits and Feder is extended to the Gaussian broadcast channel with feedback, and the error probabilities and achievable rate region are derived for this coding strategy by using the iterated random function theory. A variant of the Ozarow-Leung code for the general two-user broadcast channel with feedback can be realized as a special case of our coding scheme. Furthermore, for the symmetric Gaussian broadcast channel with feedback, our coding scheme achieves the linear-feedback sum-capacity like the LQG code and outperforms the Kramer code.
ER -
English
