Computing over Multiple-Access Channels with Connections to Wireless Network Coding
Proceedings of the 2006 Infernational Symposium on Information Theory (ISIT 2006), Seattle, WA, July 2006.
Download
Adobe Portable Document Format - [PDF]
Slides from talk - [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
We study the problem of multicasting over a network of multiple-access channels (MACs). The separation-based solution to this problem is to reduce each MAC to a set of noiseless bit pipes via a channel code and then employ network coding. Sometimes, however, the physical-layer structure of the MAC can be exploited more advantageously. In many cases of interest, the MAC output is a (deterministic) function of its inputs, corrupted by noise. We develop structured codes to exploit the natural function of a MAC to reliably compute functions as part of a network code and show that in many scenarios of interest our scheme outperforms the separation-based solution. If each MAC can be written as a sum over some finite field plus noise, then our achievable rate coincides with the max-flow min-cut bound.
Reference
B. Nazer and M. Gastpar, Computing over Multiple-Access Channels with Connections to Wireless Network Coding, Proceedings of the 2006 International Symposium on Information Theory (ISIT 2006), Seattle, WA, July 2006.
BibTeX
@INPROCEEDINGS(ads_mg_isit06, AUTHOR = "B.~Nazer and M.~Gastpar", TITLE = "Computing over Multiple-Access Channels with Connections to Wireless Network Coding", BOOKTITLE = "Proceedings of the 2006 International Symposium on Information Theory (ISIT 2006)", MONTH = "July", ADDRESS = "Seattle, WA", YEAR = "2006")