TY - GEN
T1 - On the transmission of a bivariate Gaussian source over the Gaussian broadcast channel with feedback
AU - Murin, Yonathan
AU - Kaspi, Yonatan
AU - Dabora, Ron
AU - Gündüz, Deniz
N1 - Publisher Copyright: © 2015 IEEE.
PY - 2015/6/24
Y1 - 2015/6/24
N2 - We study the uncoded transmission of a bivariate Gaussian source over a two-user symmetric Gaussian broadcast channel with a unit-delay noiseless feedback (GBCF), assuming that each (uncoded) source sample is transmitted using a finite number of channel uses, and that the transmission scheme is linear. We consider three transmission schemes: The scheme of Ardestanizadeh et al., which is based on linear quadratic Gaussian (LQG) control theory, the scheme of Ozarow and Leung (OL), and a novel scheme derived in this work designed using a dynamic programing (DP) approach. For the LQG scheme we characterize the minimal number of channel uses needed to achieve a specified mean-square error (MSE). For the OL scheme we present lower and upper bounds on the minimal number of channel uses needed to achieve a specified MSE, which become tight when the signal-to-noise ratio approaches zero. Finally, we show that for any fixed and finite number of channel uses, the proposed DP scheme achieves MSE lower than the MSE achieved by either the LQG or the OL schemes.
AB - We study the uncoded transmission of a bivariate Gaussian source over a two-user symmetric Gaussian broadcast channel with a unit-delay noiseless feedback (GBCF), assuming that each (uncoded) source sample is transmitted using a finite number of channel uses, and that the transmission scheme is linear. We consider three transmission schemes: The scheme of Ardestanizadeh et al., which is based on linear quadratic Gaussian (LQG) control theory, the scheme of Ozarow and Leung (OL), and a novel scheme derived in this work designed using a dynamic programing (DP) approach. For the LQG scheme we characterize the minimal number of channel uses needed to achieve a specified mean-square error (MSE). For the OL scheme we present lower and upper bounds on the minimal number of channel uses needed to achieve a specified MSE, which become tight when the signal-to-noise ratio approaches zero. Finally, we show that for any fixed and finite number of channel uses, the proposed DP scheme achieves MSE lower than the MSE achieved by either the LQG or the OL schemes.
UR - http://www.scopus.com/inward/record.url?scp=84938921352&partnerID=8YFLogxK
U2 - 10.1109/ITW.2015.7133100
DO - 10.1109/ITW.2015.7133100
M3 - Conference contribution
T3 - 2015 IEEE Information Theory Workshop, ITW 2015
BT - 2015 IEEE Information Theory Workshop, ITW 2015
T2 - 2015 IEEE Information Theory Workshop, ITW 2015
Y2 - 26 April 2015 through 1 May 2015
ER -