By Topic

LQG Control Approach to Gaussian Broadcast Channels With Feedback

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ehsan Ardestanizadeh ; ASSIA Inc., Redwood City, CA, USA ; Paolo Minero ; Massimo Franceschetti

A code for communication over the k-receiver complex additive white Gaussian noise broadcast channel (BC) with feedback is presented and analyzed using tools from the theory of linear quadratic Gaussian optimal control. It is shown that the performance of this code depends on the noise correlation at the receivers and it is related to the solution of a discrete algebraic Riccati equation. For the case of independent noises, the sum rate achieved by the proposed code, satisfying average power constraint P, is characterized as 1/2 log(1+Pφ), where the coefficient φ ∈ [1,k] quantifies the power gain due to the presence of feedback. This includes a previous result by Elia and strictly improves upon the codes by Ozarow and Leung and by Kramer. When the noises are correlated, the prelog of the sum capacity of the BC with feedback can be strictly greater than 1. It is established that for all noise covariance matrices of rank r the prelog of the sum capacity is at most k-r+1 and, conversely, there exists a noise covariance matrix of rank r for which the proposed code achieves this upper bound. This generalizes a previous result by Gastpar et al. for the two-receiver BC.

Published in:

IEEE Transactions on Information Theory  (Volume:58 ,  Issue: 8 )