Results 1 
4 of
4
Uncoded transmission of correlated Gaussian sources over broadcast channels with feedback
 in Proc. IEEE GlobalSIP Symp. on Network Theory
, 2014
"... Abstract—Motivated by the practical requirement for delay and complexity constrained broadcasting, we study uncoded transmission of a pair of correlated Gaussian sources over a twouser Gaussian broadcast channel with unitdelay noiseless feedback links (GBCF). Differently from previous works, in th ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
(Show Context)
Abstract—Motivated by the practical requirement for delay and complexity constrained broadcasting, we study uncoded transmission of a pair of correlated Gaussian sources over a twouser Gaussian broadcast channel with unitdelay noiseless feedback links (GBCF). Differently from previous works, in the present work we focus on the finite horizon regime. We present two joint sourcechannel coding schemes, one is based on the OzarowLeung (OL) coding scheme for the GBCF and the other is based on the linear quadratic Gaussian (LQG) code by Ardestanizadeh et al. Our LQGoriented code uses an improved decoder which outperforms the original decoder of Ardestanizadeh et al. in the finite horizon regime. We further derive lower and upper bounds on the minimal number of channel uses needed to achieve a specified pair of distortion levels for each scheme, and using these bounds, we explicitly characterize a range of transmit powers in which the OL code outperforms the LQGoriented code. I.
On the OzarowLeung scheme for the Gaussian broadcast channel with feedback
 IEEE Sig. Proc. Letters
, 2015
"... Abstract—In this work, we consider linearfeedback schemes for the twouser Gaussian broadcast channel with noiseless feedback. We extend the transmission scheme of [Ozarow and Leung, 1984] by applying estimators with memory instead of the memoryless estimators used by Ozarow and Leung (OL) in thei ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
(Show Context)
Abstract—In this work, we consider linearfeedback schemes for the twouser Gaussian broadcast channel with noiseless feedback. We extend the transmission scheme of [Ozarow and Leung, 1984] by applying estimators with memory instead of the memoryless estimators used by Ozarow and Leung (OL) in their original work. A recursive formulation of the mean square errors achieved by the proposed estimators is provided, along with a proof for the existence of a fixed point. This enables characterizing the achievable rates of the extended scheme. Finally, via numerical simulations it is shown that the extended scheme can improve upon the original OL scheme in terms of achievable rates, as well as achieve a low probability of error after a finite number of channel uses. I.
On the Transmission of a Bivariate Gaussian Source Over the Gaussian Broadcast Channel With Feedback
"... Abstract—We study the uncoded transmission of a bivariate Gaussian source over a twouser symmetric Gaussian broadcast channel with a unitdelay noiseless feedback (GBCF), assuming that each (uncoded) source sample is transmitted using a finite number of channel uses, and that the transmission schem ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Abstract—We study the uncoded transmission of a bivariate Gaussian source over a twouser symmetric Gaussian broadcast channel with a unitdelay 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 meansquare 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 signaltonoise 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. I.
FiniteLength Linear Schemes for Joint SourceChannel Coding over Gaussian Broadcast Channels with Feedback
"... We study the uncoded transmission of a pair of correlated Gaussian sources over a twouser Gaussian broadcast channel with unitdelay noiseless feedback, abbreviated as the GBCF. Each source pair sample is transmitted using a linear transmission scheme in a finite number of channel uses. We investig ..."
Abstract
 Add to MetaCart
(Show Context)
We study the uncoded transmission of a pair of correlated Gaussian sources over a twouser Gaussian broadcast channel with unitdelay noiseless feedback, abbreviated as the GBCF. Each source pair sample is transmitted using a linear transmission scheme in a finite number of channel uses. We investigate three transmission schemes: A scheme based on the OzarowLeung (OL) code, a scheme based on the linear quadratic Gaussian (LQG) code of Ardestanizadeh et al., and a novel scheme derived in this work using a dynamic programming (DP) approach. For the OL and LQG schemes we present lower and upper bounds on the minimal number of channel uses needed to achieve a target meansquare error (MSE) pair. For the LQG scheme in the symmetric setting, we identify the optimal scaling of the sources, which results in a significant improvement of its finite horizon performance, and, in addition, characterize the (exact) minimal number of channel uses required to achieve a target MSE. Finally, for the symmetric setting, we show that for any fixed and finite number of channel uses, the DP scheme achieves MSE lower than the MSE achieved by either the LQG or the OL schemes. 1