Practical code design for compute-and-forward

Or Ordentlich; Jiening Zhan; Uri Erez; Michael Gastpar; Bobak Nazer

doi:10.1109/ISIT.2011.6033876

Practical code design for compute-and-forward

Or Ordentlich^*, Jiening Zhan, Uri Erez, Michael Gastpar, Bobak Nazer

^*Corresponding author for this work

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

27 Scopus citations

Abstract

The Compute-and-Forward approach has been proven to be very beneficial for communication over Gaussian networks. While the theoretical results are promising, it is still not completely understood how to best apply this scheme in practice. The objective of this work is to provide a low complexity scheme suitable for Compute-and-Forward. The scheme is based on utilizing linear codes over ℤ_q where q is not restricted to be prime and allows to achieve high transmission rates following Ungerboeck's set partitioning principle.

Original language	English
Title of host publication	2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
Pages	1876-1880
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2011.6033876
State	Published - 2011
Externally published	Yes
Event	2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011 - St. Petersburg, Russian Federation Duration: 31 Jul 2011 → 5 Aug 2011

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Print)	2157-8104

Conference

Conference	2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
Country/Territory	Russian Federation
City	St. Petersburg
Period	31/07/11 → 5/08/11

Access to Document

10.1109/ISIT.2011.6033876

Cite this

@inproceedings{5af0192e492d4c789497f69df9d10e37,

title = "Practical code design for compute-and-forward",

abstract = "The Compute-and-Forward approach has been proven to be very beneficial for communication over Gaussian networks. While the theoretical results are promising, it is still not completely understood how to best apply this scheme in practice. The objective of this work is to provide a low complexity scheme suitable for Compute-and-Forward. The scheme is based on utilizing linear codes over ℤq where q is not restricted to be prime and allows to achieve high transmission rates following Ungerboeck's set partitioning principle.",

author = "Or Ordentlich and Jiening Zhan and Uri Erez and Michael Gastpar and Bobak Nazer",

year = "2011",

doi = "10.1109/ISIT.2011.6033876",

language = "אנגלית",

isbn = "9781457705953",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "1876--1880",

booktitle = "2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011",

note = "2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011 ; Conference date: 31-07-2011 Through 05-08-2011",

}

Ordentlich, O, Zhan, J, Erez, U, Gastpar, M & Nazer, B 2011, Practical code design for compute-and-forward. in 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011., 6033876, IEEE International Symposium on Information Theory - Proceedings, pp. 1876-1880, 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011, St. Petersburg, Russian Federation, 31/07/11. https://doi.org/10.1109/ISIT.2011.6033876

Practical code design for compute-and-forward. / Ordentlich, Or; Zhan, Jiening; Erez, Uri et al.
2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011. 2011. p. 1876-1880 6033876 (IEEE International Symposium on Information Theory - Proceedings).

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

TY - GEN

T1 - Practical code design for compute-and-forward

AU - Ordentlich, Or

AU - Zhan, Jiening

AU - Erez, Uri

AU - Gastpar, Michael

AU - Nazer, Bobak

PY - 2011

Y1 - 2011

N2 - The Compute-and-Forward approach has been proven to be very beneficial for communication over Gaussian networks. While the theoretical results are promising, it is still not completely understood how to best apply this scheme in practice. The objective of this work is to provide a low complexity scheme suitable for Compute-and-Forward. The scheme is based on utilizing linear codes over ℤq where q is not restricted to be prime and allows to achieve high transmission rates following Ungerboeck's set partitioning principle.

AB - The Compute-and-Forward approach has been proven to be very beneficial for communication over Gaussian networks. While the theoretical results are promising, it is still not completely understood how to best apply this scheme in practice. The objective of this work is to provide a low complexity scheme suitable for Compute-and-Forward. The scheme is based on utilizing linear codes over ℤq where q is not restricted to be prime and allows to achieve high transmission rates following Ungerboeck's set partitioning principle.

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

U2 - 10.1109/ISIT.2011.6033876

DO - 10.1109/ISIT.2011.6033876

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

AN - SCOPUS:80054816237

SN - 9781457705953

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1876

EP - 1880

BT - 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011

T2 - 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011

Y2 - 31 July 2011 through 5 August 2011

ER -

Practical code design for compute-and-forward

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this