@inproceedings{37ae4cb7b47b4426a4cd3edab7beda95,
title = "The compute-and-forward transform",
abstract = "We derive an achievable rate region for the Gaussian K-user multiple-access channel (MAC) where all users transmit codewords from a chain of nested lattices. For any set of channel coefficients, this rate region contains points within a constant gap from the sum capacity boundary of the MAC. The main tool used is the recently proposed compute-and-forward framework. A new transformation of a MAC to a modulo-lattice multiple-input multiple-output (MIMO) channel is introduced based on this framework. Specifically, from one noisy linear combination of the transmitted signals the receiver attempts to decode K linearly independent equations with integer-valued coefficients. While the individual rates at which these equations can be decoded are highly sensitive to the exact channel gains, their sum is always within a constant gap from the sum capacity boundary of the MAC. The transformation is then utilized for establishing the desired rate region.",
author = "Or Ordentlich and Uri Erez and Bobak Nazer",
year = "2012",
doi = "https://doi.org/10.1109/ISIT.2012.6284113",
language = "الإنجليزيّة",
isbn = "9781467325790",
series = "IEEE International Symposium on Information Theory - Proceedings",
pages = "3008--3012",
booktitle = "2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012",
note = "2012 IEEE International Symposium on Information Theory, ISIT 2012 ; Conference date: 01-07-2012 Through 06-07-2012",
}