Title
Upper bounds on the capacity of discrete-time blockwise white Gaussian channels with feedback
Abstract
Although it is well known that feedback does not increase the capacity of an additive white Gaussian channel, Yanagi (1992) gave the necessary and sufficient condition under which the capacity Cn,FB (P) of a discrete time nonwhite Gaussian channel is increased by feedback. In this correspondence we show that the capacity Cn,FB (P) of the Gaussian channel with feedback is a concave function of P, and give two types of inequalities: both 1/α Cn,FB(αP) and Cn,FB(αP)+½ln 1/α are decreasing functions of α>0. As their application we can obtain two upper bounds on the capacity of the discrete-time blockwise white Gaussian channel with feedback. The results are quite useful when power constraint P is relatively not large
Year
DOI
Venue
2000
10.1109/18.841195
IEEE Transactions on Information Theory
Keywords
Field
DocType
sufficient condition,gaussian channel,running head: gaussian channel capacity with feedback key words: gaussian channel,concave function,upper bound,feedback,discrete-time blockwise white gaussian,additive white gaussian channel,blockwise white gaussian channel,capacity,capacity cn,discrete time nonwhite gaussian,power constraint p,discrete time,decoding,computer science,gaussian noise,gaussian processes,white noise,signal processing,stochastic processes,channel capacity
Discrete mathematics,Combinatorics,Upper and lower bounds,Concave function,White noise,Gaussian process,Decoding methods,Discrete time and continuous time,Channel capacity,Gaussian noise,Mathematics
Journal
Volume
Issue
ISSN
46
3
0018-9448
Citations 
PageRank 
References 
2
0.41
6
Authors
2
Name
Order
Citations
PageRank
Han Wu Chen182.03
K. Yanagi220.41