Asymmetric compute-and-forward

Vasilis Ntranos, Viveck Ramesh Cadambe, Bobak Nazer, Giuseppe Caire

Research output: Chapter in Book/Report/Conference proceedingConference contribution

14 Citations (Scopus)

Abstract

This paper generalizes the compute-and-forward framework to allow for unequal (or asymmetric) power allocation across transmitters. Each transmitter's codebook is formed using a fine lattice that is chosen to ensure decodability as well as a coarse lattice that is chosen to enforce the power constraint. The employed lattices are drawn from a nested lattice chain, which makes it possible for the receivers to decode integerlinear combinations of the transmitted codewords. Like the original compute-and-forward framework, this scheme has a natural interpretation in terms of sending linear combinations of messages that are vectors over a finite field. Interestingly, each transmitter's power constraint and noise tolerance can be viewed in terms of restrictions on the available 'signal levels'. That is, transmitters with less power must send zeros along higher order levels and transmitters that need to tolerate more noise must send zeros along lower order levels.

Original languageEnglish (US)
Title of host publication2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013
PublisherIEEE Computer Society
Pages1174-1181
Number of pages8
ISBN (Print)9781479934096
DOIs
StatePublished - Jan 1 2013
Event51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013 - Monticello, IL, United States
Duration: Oct 2 2013Oct 4 2013

Other

Other51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013
CountryUnited States
CityMonticello, IL
Period10/2/1310/4/13

Fingerprint

Transmitters

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Control and Systems Engineering

Cite this

Ntranos, V., Cadambe, V. R., Nazer, B., & Caire, G. (2013). Asymmetric compute-and-forward. In 2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013 (pp. 1174-1181). [6736658] IEEE Computer Society. https://doi.org/10.1109/Allerton.2013.6736658
Ntranos, Vasilis ; Cadambe, Viveck Ramesh ; Nazer, Bobak ; Caire, Giuseppe. / Asymmetric compute-and-forward. 2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013. IEEE Computer Society, 2013. pp. 1174-1181
@inproceedings{11280c03ae1243f38899856041114ed6,
title = "Asymmetric compute-and-forward",
abstract = "This paper generalizes the compute-and-forward framework to allow for unequal (or asymmetric) power allocation across transmitters. Each transmitter's codebook is formed using a fine lattice that is chosen to ensure decodability as well as a coarse lattice that is chosen to enforce the power constraint. The employed lattices are drawn from a nested lattice chain, which makes it possible for the receivers to decode integerlinear combinations of the transmitted codewords. Like the original compute-and-forward framework, this scheme has a natural interpretation in terms of sending linear combinations of messages that are vectors over a finite field. Interestingly, each transmitter's power constraint and noise tolerance can be viewed in terms of restrictions on the available 'signal levels'. That is, transmitters with less power must send zeros along higher order levels and transmitters that need to tolerate more noise must send zeros along lower order levels.",
author = "Vasilis Ntranos and Cadambe, {Viveck Ramesh} and Bobak Nazer and Giuseppe Caire",
year = "2013",
month = "1",
day = "1",
doi = "10.1109/Allerton.2013.6736658",
language = "English (US)",
isbn = "9781479934096",
pages = "1174--1181",
booktitle = "2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013",
publisher = "IEEE Computer Society",
address = "United States",

}

Ntranos, V, Cadambe, VR, Nazer, B & Caire, G 2013, Asymmetric compute-and-forward. in 2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013., 6736658, IEEE Computer Society, pp. 1174-1181, 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013, Monticello, IL, United States, 10/2/13. https://doi.org/10.1109/Allerton.2013.6736658

Asymmetric compute-and-forward. / Ntranos, Vasilis; Cadambe, Viveck Ramesh; Nazer, Bobak; Caire, Giuseppe.

2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013. IEEE Computer Society, 2013. p. 1174-1181 6736658.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Asymmetric compute-and-forward

AU - Ntranos, Vasilis

AU - Cadambe, Viveck Ramesh

AU - Nazer, Bobak

AU - Caire, Giuseppe

PY - 2013/1/1

Y1 - 2013/1/1

N2 - This paper generalizes the compute-and-forward framework to allow for unequal (or asymmetric) power allocation across transmitters. Each transmitter's codebook is formed using a fine lattice that is chosen to ensure decodability as well as a coarse lattice that is chosen to enforce the power constraint. The employed lattices are drawn from a nested lattice chain, which makes it possible for the receivers to decode integerlinear combinations of the transmitted codewords. Like the original compute-and-forward framework, this scheme has a natural interpretation in terms of sending linear combinations of messages that are vectors over a finite field. Interestingly, each transmitter's power constraint and noise tolerance can be viewed in terms of restrictions on the available 'signal levels'. That is, transmitters with less power must send zeros along higher order levels and transmitters that need to tolerate more noise must send zeros along lower order levels.

AB - This paper generalizes the compute-and-forward framework to allow for unequal (or asymmetric) power allocation across transmitters. Each transmitter's codebook is formed using a fine lattice that is chosen to ensure decodability as well as a coarse lattice that is chosen to enforce the power constraint. The employed lattices are drawn from a nested lattice chain, which makes it possible for the receivers to decode integerlinear combinations of the transmitted codewords. Like the original compute-and-forward framework, this scheme has a natural interpretation in terms of sending linear combinations of messages that are vectors over a finite field. Interestingly, each transmitter's power constraint and noise tolerance can be viewed in terms of restrictions on the available 'signal levels'. That is, transmitters with less power must send zeros along higher order levels and transmitters that need to tolerate more noise must send zeros along lower order levels.

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

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

U2 - 10.1109/Allerton.2013.6736658

DO - 10.1109/Allerton.2013.6736658

M3 - Conference contribution

SN - 9781479934096

SP - 1174

EP - 1181

BT - 2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013

PB - IEEE Computer Society

ER -

Ntranos V, Cadambe VR, Nazer B, Caire G. Asymmetric compute-and-forward. In 2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013. IEEE Computer Society. 2013. p. 1174-1181. 6736658 https://doi.org/10.1109/Allerton.2013.6736658