TY - GEN
T1 - Bounds on the achievable rate of noisy feedback Gaussian channels under linear feedback coding scheme
AU - Li, Chong
AU - Elia, Nicola
PY - 2011
Y1 - 2011
N2 - In this paper, we investigate the additive Gaussian noise channel with noisy feedback. We consider the setup of linear coding of the feedback information and Gaussian signaling of the message (i.e. Cover-Pombra Scheme). Then, we derive the upper and lower bounds on the largest achievable rate for this setup. We show that these two bounds can be obtained by solving two convex optimization problems. Finally, we present some simulations and discussion.
AB - In this paper, we investigate the additive Gaussian noise channel with noisy feedback. We consider the setup of linear coding of the feedback information and Gaussian signaling of the message (i.e. Cover-Pombra Scheme). Then, we derive the upper and lower bounds on the largest achievable rate for this setup. We show that these two bounds can be obtained by solving two convex optimization problems. Finally, we present some simulations and discussion.
UR - http://www.scopus.com/inward/record.url?scp=80054799511&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=80054799511&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2011.6033836
DO - 10.1109/ISIT.2011.6033836
M3 - Conference contribution
AN - SCOPUS:80054799511
SN - 9781457705953
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 169
EP - 173
BT - 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
T2 - 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
Y2 - 31 July 2011 through 5 August 2011
ER -