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 proceedingConference contributionpeer-review

26 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 languageAmerican English
Title of host publication2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
Pages1876-1880
Number of pages5
DOIs
StatePublished - 2011
Externally publishedYes
Event2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011 - St. Petersburg, Russian Federation
Duration: 31 Jul 20115 Aug 2011

Publication series

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

Conference

Conference2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
Country/TerritoryRussian Federation
CitySt. Petersburg
Period31/07/115/08/11

Fingerprint

Dive into the research topics of 'Practical code design for compute-and-forward'. Together they form a unique fingerprint.

Cite this