Lattice codes achieve the capacity of common message gaussian broadcast channels with coded side information

Lakshmi Natarajan, Yi Hong, Emanuele Viterbo

Research output: Contribution to journalArticleResearchpeer-review

Abstract

Lattices possess elegant mathematical properties which have been previously used in the literature to show that structured codes can be efficient in a variety of communication scenarios, including coding for the additive white Gaussian noise channel, dirty-paper channel, Wyner-Ziv coding, coding for relay networks, and so forth. We consider the family of single-Transmitter multiple-receiver Gaussian channels, where the source transmits a set of common messages to all the receivers (multicast scenario), and each receiver has coded side information, i.e., prior information in the form of linear combinations of the messages. This channel model is motivated by applications to multi-Terminal networks, where the nodes may have access to coded versions of the messages from previous signal hops or through orthogonal channels. The capacity of this channel is known and follows from the work of Tuncel (2006), which is based on random coding arguments. In this paper, following the approach of Erez and Zamir, we design lattice codes for this family of channels when the source messages are symbols from a finite field $\mathbb {F} {p}$of prime size. Our coding scheme utilizes Construction A lattices designed over the same prime field $\mathbb {F} {p}$, and uses algebraic binning at the decoders to expurgate the channel code and obtain good lattice subcodes, for every possible set of linear combinations available as side information. The achievable rate of our coding scheme is a function of the size $p$of underlying prime field, and approaches the capacity as $p$tends to infinity.

Original languageEnglish
Pages (from-to)1481-1496
Number of pages16
JournalIEEE Transactions on Information Theory
Volume64
Issue number3
DOIs
Publication statusPublished - 1 Mar 2018

Keywords

  • Capacity
  • Construction A
  • Gaussian broadcast channel
  • lattice
  • multicast
  • side information
  • structured codes

Cite this

@article{8906de0e44514fd49f3104ba3870c1fe,
title = "Lattice codes achieve the capacity of common message gaussian broadcast channels with coded side information",
abstract = "Lattices possess elegant mathematical properties which have been previously used in the literature to show that structured codes can be efficient in a variety of communication scenarios, including coding for the additive white Gaussian noise channel, dirty-paper channel, Wyner-Ziv coding, coding for relay networks, and so forth. We consider the family of single-Transmitter multiple-receiver Gaussian channels, where the source transmits a set of common messages to all the receivers (multicast scenario), and each receiver has coded side information, i.e., prior information in the form of linear combinations of the messages. This channel model is motivated by applications to multi-Terminal networks, where the nodes may have access to coded versions of the messages from previous signal hops or through orthogonal channels. The capacity of this channel is known and follows from the work of Tuncel (2006), which is based on random coding arguments. In this paper, following the approach of Erez and Zamir, we design lattice codes for this family of channels when the source messages are symbols from a finite field $\mathbb {F} {p}$of prime size. Our coding scheme utilizes Construction A lattices designed over the same prime field $\mathbb {F} {p}$, and uses algebraic binning at the decoders to expurgate the channel code and obtain good lattice subcodes, for every possible set of linear combinations available as side information. The achievable rate of our coding scheme is a function of the size $p$of underlying prime field, and approaches the capacity as $p$tends to infinity.",
keywords = "Capacity, Construction A, Gaussian broadcast channel, lattice, multicast, side information, structured codes",
author = "Lakshmi Natarajan and Yi Hong and Emanuele Viterbo",
year = "2018",
month = "3",
day = "1",
doi = "10.1109/TIT.2017.2788873",
language = "English",
volume = "64",
pages = "1481--1496",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "IEEE, Institute of Electrical and Electronics Engineers",
number = "3",

}

Lattice codes achieve the capacity of common message gaussian broadcast channels with coded side information. / Natarajan, Lakshmi ; Hong, Yi; Viterbo, Emanuele.

In: IEEE Transactions on Information Theory, Vol. 64, No. 3, 01.03.2018, p. 1481-1496.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

T1 - Lattice codes achieve the capacity of common message gaussian broadcast channels with coded side information

AU - Natarajan, Lakshmi

AU - Hong, Yi

AU - Viterbo, Emanuele

PY - 2018/3/1

Y1 - 2018/3/1

N2 - Lattices possess elegant mathematical properties which have been previously used in the literature to show that structured codes can be efficient in a variety of communication scenarios, including coding for the additive white Gaussian noise channel, dirty-paper channel, Wyner-Ziv coding, coding for relay networks, and so forth. We consider the family of single-Transmitter multiple-receiver Gaussian channels, where the source transmits a set of common messages to all the receivers (multicast scenario), and each receiver has coded side information, i.e., prior information in the form of linear combinations of the messages. This channel model is motivated by applications to multi-Terminal networks, where the nodes may have access to coded versions of the messages from previous signal hops or through orthogonal channels. The capacity of this channel is known and follows from the work of Tuncel (2006), which is based on random coding arguments. In this paper, following the approach of Erez and Zamir, we design lattice codes for this family of channels when the source messages are symbols from a finite field $\mathbb {F} {p}$of prime size. Our coding scheme utilizes Construction A lattices designed over the same prime field $\mathbb {F} {p}$, and uses algebraic binning at the decoders to expurgate the channel code and obtain good lattice subcodes, for every possible set of linear combinations available as side information. The achievable rate of our coding scheme is a function of the size $p$of underlying prime field, and approaches the capacity as $p$tends to infinity.

AB - Lattices possess elegant mathematical properties which have been previously used in the literature to show that structured codes can be efficient in a variety of communication scenarios, including coding for the additive white Gaussian noise channel, dirty-paper channel, Wyner-Ziv coding, coding for relay networks, and so forth. We consider the family of single-Transmitter multiple-receiver Gaussian channels, where the source transmits a set of common messages to all the receivers (multicast scenario), and each receiver has coded side information, i.e., prior information in the form of linear combinations of the messages. This channel model is motivated by applications to multi-Terminal networks, where the nodes may have access to coded versions of the messages from previous signal hops or through orthogonal channels. The capacity of this channel is known and follows from the work of Tuncel (2006), which is based on random coding arguments. In this paper, following the approach of Erez and Zamir, we design lattice codes for this family of channels when the source messages are symbols from a finite field $\mathbb {F} {p}$of prime size. Our coding scheme utilizes Construction A lattices designed over the same prime field $\mathbb {F} {p}$, and uses algebraic binning at the decoders to expurgate the channel code and obtain good lattice subcodes, for every possible set of linear combinations available as side information. The achievable rate of our coding scheme is a function of the size $p$of underlying prime field, and approaches the capacity as $p$tends to infinity.

KW - Capacity

KW - Construction A

KW - Gaussian broadcast channel

KW - lattice

KW - multicast

KW - side information

KW - structured codes

UR - http://www.scopus.com/inward/record.url?scp=85040052141&partnerID=8YFLogxK

U2 - 10.1109/TIT.2017.2788873

DO - 10.1109/TIT.2017.2788873

M3 - Article

VL - 64

SP - 1481

EP - 1496

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 3

ER -