Reliable Computation over Multiple-Access Channels
Proceedings of 43rd Annual Allerton Conference on Commununication, Control and Computation, Monticello, IL, September 2005.
Download
Adobe Portable Document Format - [PDF]
Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
Abstract
In the standard multiple-access problem, a central access point needs to re- construct the signals observed by each user separately. Suppose now that the access point only reconstructs the sum (or any other function) of these observed signals. For this problem, we develop strategies and information-theoretic perfor- mance bounds. It is shown that in general, separating source from channel coding leads to suboptimal performance. For linear functions, a scheme is developed, analyzed, and shown to perform optimally for a class of multiple-access channels.
Reference
B. Nazer and M. Gastpar, Reliable Computation over Multiple-Access Channels. Proceedings of 43rd Annual Allerton Conference on Commununication, Control and Computation, Monticello, IL, September 2005.
BibTeX
@INPROCEEDINGS(bn_mg_allerton05, AUTHOR = "B.~Nazer and M.~Gastpar", TITLE = "Reliable Computation over Multiple-Access Channels", BOOKTITLE = "Proceedings of 43rd Annual Allerton Conference on Commununication, Control and Computation", MONTH = "September", ADDRESS = "Monticello", YEAR = "2005")