Finite-length linear schemes for joint source-channel coding over Gaussian broadcast channels with feedback
File(s)MKDG_IT15.pdf (886.26 KB)
Accepted version
Author(s)
Murin, Y
Kaspi, Y
Dabora, R
Gunduz, D
Type
Journal Article
Abstract
We study linear encoding for a pair of correlated
Gaussian sources transmitted over a two-user Gaussian broadcast
channel in the presence of unit-delay noiseless feedback, abbre-
viated as the GBCF. Each pair of source samples is transmitted
using a linear transmission scheme in a
finite
number of channel
uses. We investigate three linear transmission schemes: A scheme
based on the Ozarow-Leung (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 mean-square 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 an MSE lower than the MSE achieved by
either the LQG or the OL schemes.
Gaussian sources transmitted over a two-user Gaussian broadcast
channel in the presence of unit-delay noiseless feedback, abbre-
viated as the GBCF. Each pair of source samples is transmitted
using a linear transmission scheme in a
finite
number of channel
uses. We investigate three linear transmission schemes: A scheme
based on the Ozarow-Leung (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 mean-square 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 an MSE lower than the MSE achieved by
either the LQG or the OL schemes.
Date Issued
2017-03-07
Date Acceptance
2017-02-17
Citation
IEEE Transactions on Information Theory, 2017, 63 (5), pp.2737-2772
ISSN
0018-9448
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Start Page
2737
End Page
2772
Journal / Book Title
IEEE Transactions on Information Theory
Volume
63
Issue
5
Copyright Statement
© 2017 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission.
See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
Sponsor
Commission of the European Communities
Grant Number
677854
Subjects
Science & Technology
Technology
Computer Science, Information Systems
Engineering, Electrical & Electronic
Computer Science
Engineering
Broadcasting
channel coding
feedback communications
Gaussian channels
source coding
MULTIPLE-ACCESS
CAPACITY
NETWORKS
COMMUNICATION
INFORMATION
STRATEGIES
REGION
Networking & Telecommunications
0801 Artificial Intelligence And Image Processing
0906 Electrical And Electronic Engineering
1005 Communications Technologies
Publication Status
Published