On compute-and-forward with feedback

Or Ordentlich; Uri Erez; Bobak Nazer

doi:10.1109/ITW.2015.7133154

On compute-and-forward with feedback

Or Ordentlich, Uri Erez, Bobak Nazer

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Scopus citations

Abstract

We consider a Gaussian multiple-access channel where each user's message is identified with a vector of elements from a finite field, and the receiver's goal is to decode a linear combination of these finite field vectors. It is further assumed that each transmitter can causally observe the channel's output through a clean feedback link. We propose a novel coding scheme for this setup, which can be seen as an extension of the Cover-Leung scheme for the computation problem. This scheme is shown to achieve computation rates higher than the best known computation rates for the same scenario without feedback. In particular, for the symmetric two-user Gaussian multiple-access channel, the proposed scheme attains a symmetric computation rate greater than 1/2 log(3/4 + SNR).

Original language	English
Title of host publication	2015 IEEE Information Theory Workshop, ITW 2015
Publisher	Institute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)	9781479955268
DOIs	https://doi.org/10.1109/ITW.2015.7133154
State	Published - 24 Jun 2015
Externally published	Yes
Event	2015 IEEE Information Theory Workshop, ITW 2015 - Jerusalem, Israel Duration: 26 Apr 2015 → 1 May 2015

Publication series

Name	2015 IEEE Information Theory Workshop, ITW 2015

Conference

Conference	2015 IEEE Information Theory Workshop, ITW 2015
Country/Territory	Israel
City	Jerusalem
Period	26/04/15 → 1/05/15

Bibliographical note

Publisher Copyright:
© 2015 IEEE.

Access to Document

10.1109/ITW.2015.7133154

Cite this

@inproceedings{bdf7d0cce0e44796a3e3d362b64e9cb6,

title = "On compute-and-forward with feedback",

abstract = "We consider a Gaussian multiple-access channel where each user's message is identified with a vector of elements from a finite field, and the receiver's goal is to decode a linear combination of these finite field vectors. It is further assumed that each transmitter can causally observe the channel's output through a clean feedback link. We propose a novel coding scheme for this setup, which can be seen as an extension of the Cover-Leung scheme for the computation problem. This scheme is shown to achieve computation rates higher than the best known computation rates for the same scenario without feedback. In particular, for the symmetric two-user Gaussian multiple-access channel, the proposed scheme attains a symmetric computation rate greater than 1/2 log(3/4 + SNR).",

author = "Or Ordentlich and Uri Erez and Bobak Nazer",

note = "Publisher Copyright: {\textcopyright} 2015 IEEE.; 2015 IEEE Information Theory Workshop, ITW 2015 ; Conference date: 26-04-2015 Through 01-05-2015",

year = "2015",

month = jun,

day = "24",

doi = "10.1109/ITW.2015.7133154",

language = "אנגלית",

series = "2015 IEEE Information Theory Workshop, ITW 2015",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

booktitle = "2015 IEEE Information Theory Workshop, ITW 2015",

address = "ארצות הברית",

}

TY - GEN

T1 - On compute-and-forward with feedback

AU - Ordentlich, Or

AU - Erez, Uri

AU - Nazer, Bobak

PY - 2015/6/24

Y1 - 2015/6/24

N2 - We consider a Gaussian multiple-access channel where each user's message is identified with a vector of elements from a finite field, and the receiver's goal is to decode a linear combination of these finite field vectors. It is further assumed that each transmitter can causally observe the channel's output through a clean feedback link. We propose a novel coding scheme for this setup, which can be seen as an extension of the Cover-Leung scheme for the computation problem. This scheme is shown to achieve computation rates higher than the best known computation rates for the same scenario without feedback. In particular, for the symmetric two-user Gaussian multiple-access channel, the proposed scheme attains a symmetric computation rate greater than 1/2 log(3/4 + SNR).

AB - We consider a Gaussian multiple-access channel where each user's message is identified with a vector of elements from a finite field, and the receiver's goal is to decode a linear combination of these finite field vectors. It is further assumed that each transmitter can causally observe the channel's output through a clean feedback link. We propose a novel coding scheme for this setup, which can be seen as an extension of the Cover-Leung scheme for the computation problem. This scheme is shown to achieve computation rates higher than the best known computation rates for the same scenario without feedback. In particular, for the symmetric two-user Gaussian multiple-access channel, the proposed scheme attains a symmetric computation rate greater than 1/2 log(3/4 + SNR).

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

U2 - 10.1109/ITW.2015.7133154

DO - 10.1109/ITW.2015.7133154

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84938943838

T3 - 2015 IEEE Information Theory Workshop, ITW 2015

BT - 2015 IEEE Information Theory Workshop, ITW 2015

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2015 IEEE Information Theory Workshop, ITW 2015

Y2 - 26 April 2015 through 1 May 2015

ER -

On compute-and-forward with feedback

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this