Computing over multiple-access channels with connections to wireless network coding

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.


Published in:
2006 IEEE International Symposium on Information Theory, Vols 1-6, Proceedings, 1354-1358
Presented at:
IEEE International Symposium on Information Theory, Seattle, WA, Jul 09-14, 2006
Year:
2006
Publisher:
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa
ISBN:
978-1-4244-0505-3
Laboratories:




 Record created 2011-10-17, last modified 2018-09-13


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)