Feedback Capacity of Gaussian Channels Revisited
2019 (Engelska)Ingår i: IEEE Transactions on Information Theory, ISSN 0018-9448, E-ISSN 1557-9654, Vol. 65, nr 3, s. 1948-1960, artikel-id 8552675Artikel i tidskrift (Refereegranskat) Published
Abstract [en]
In this paper, we revisit the problem of finding the average capacity of the Gaussian feedback channel. First, we consider the problem of finding the average capacity of the analog Gaussian noise channel where the noise has an arbitrary spectral density. We introduce a new approach to the problem where we solve the problem over a finite number of transmissions and then consider the limit of an infinite number of transmissions. Further, we consider the important special case of stationary Gaussian noise with finite memory. We show that the channel capacity at stationarity can be found by solving a semi-definite program, and hence computationally tractable. We also give new proofs and results of the non stationary solution which bridges the gap between results in the literature for the stationary and non stationary feedback channel capacities. It’s shown that a linear communication feedback strategy is optimal. Similar to the solution of the stationary problem, it’s shown that the optimal linear strategy is to transmit a linear combination of the information symbols to be communicated and the innovations for the estimation error of the state of the noise process.
Ort, förlag, år, upplaga, sidor
2019. Vol. 65, nr 3, s. 1948-1960, artikel-id 8552675
Nyckelord [en]
Channel capacity, Gaussian noise, Gaussian processes, Noise measurement, Optimization, Symmetric matrices, Zinc, Gaussian distribution, Problem solving, Spectral density, Feedback strategies, Gaussian noise channels, Linear combinations, Noise measurements, Semidefinite programs, Stationary problem, Gaussian noise (electronic)
Nationell ämneskategori
Elektroteknik och elektronik
Identifikatorer
URN: urn:nbn:se:ri:diva-37262DOI: 10.1109/TIT.2018.2884050Scopus ID: 2-s2.0-85057773721OAI: oai:DiVA.org:ri-37262DiVA, id: diva2:1280124
2019-01-182019-01-182020-01-23Bibliografiskt granskad