Computation over mismatched channels

IEEE Journal on Selected Areas in Communications

Volumn 31, Issue 4, 2013, Pages 666-677

  Karamchandani, Nikhil ^a,b   Niesen, Urs ^c   Diggavi, Suhas ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b University of California at San Diego   (United States)

^c LUCENT TECHNOLOGIES   (United States)

Author keywords

Distributed computation; information theory; multiple access; separation theorem

Indexed keywords

CHANNEL FUNCTIONS; COMPUTATION TASKS; DISTRIBUTED COMPUTATIONS; MULTIPLE ACCESS; MULTIPLE ACCESS CHANNELS; PERFORMANCE GAIN; SEPARATION THEOREM; TARGET FUNCTIONS;

INFORMATION THEORY; SEPARATION;

COMMUNICATION;

EID: 84875615389     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2013.130405     Document Type: Article

References (21)

1. E. Kushilevitz and N. Nisan, Communication Complexity. Cambridge University Press, 2006.
2. A. C.-C. Yao, "Some complexity questions related to distributive computing," in Proc. ACM STOC, 1979, pp. 209-213.
3. J. K̈orner and K. Marton, "How to encode the modulo-two sum of binary sources," IEEE Trans. Inf. Theory, vol. 25, no. 2, pp. 219-221, Mar. 1979. (Pubitemid 9443306)
4. A. Orlitsky and J. R. Roche, "Coding for computing," IEEE Trans. Inf. Theory, vol. 47, no. 3, pp. 903-917, Mar. 2001. (Pubitemid 32425425)
5. V. Doshi, D. Shah, M. Ḿedard, and M. Effros, "Functional compression through graph coloring," IEEE Trans. Inf. Theory, vol. 56, no. 8, pp. 3901-3917, Aug. 2010.
6. A. Giridhar and P. R. Kumar, "Computing and communicating functions over sensor networks," IEEE J. Sel. Areas Commun., vol. 23, no. 4, pp. 755-764, Apr. 2005. (Pubitemid 40519630)
7. R. Appuswamy, M. Franceschetti, N. Karamchandani, and K. Zeger, "Network coding for computing: Cut-set bounds," IEEE Trans. Inf. Theory, vol. 57, no. 2, pp. 1015-1030, Feb. 2011.
8. N. Karamchandani, R. Appuswamy, and M. Franceschetti, "Time and energy complexity of function computation over networks," IEEE Trans. Inf. Theory, vol. 57, no. 12, pp. 7671-7684, Dec. 2011.
9. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, "Randomized gossip algorithms," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2508-2530, Jun. 2006. (Pubitemid 43898906)
10. D. Kempe, A. Dobra, and J. Gehrke, "Gossip-based computation of aggregate information," in Proc. IEEE FOCS, Oct. 2003, pp. 482-491.
11. T. M. Cover, A. El Gamal, and M. Salehi, "Multiple access channels with arbitrarily correlated sources," IEEE Trans. Inf. Theory, vol. 26, no. 6, pp. 648-657, Nov. 1980. (Pubitemid 11460695)
12. S. Zhang, S. C. Liew, and P. P. Lam, "Hot topic: Physical-layer network coding," in Proc. ACM MobiCom, Sep. 2006, pp. 358-365. (Pubitemid 44758729)
13. S. Katti, S. Gollakota, and D. Katabi, "Embracing wireless interference: Analog network coding," in Proc. ACM SIGCOMM, Oct. 2007, pp. 397-408. (Pubitemid 350239801)
14. B. Nazer and M. Gastpar, "Computation over multiple-access channels," IEEE Trans. Inf. Theory, vol. 53, no. 10, pp. 3498-3516, Oct. 2007. (Pubitemid 47534510)
15. M. P. Wilson, K. Narayanan, H. D. Pfister, and A. Sprintson, "Joint physical layer coding and network coding for bidirectional relaying," IEEE Trans. Inf. Theory, vol. 56, no. 11, pp. 5641-5654, Nov. 2010.
16. U. Niesen and P. Whiting, "The degrees of freedom of compute-andforward," IEEE Trans. Inf. Theory, vol. 58, no. 8, pp. 5214-5232, Aug. 2012.
17. L. Keller, N. Karamchandani, and C. Fragouli, "Function computation over linear channels," in Proc. IEEE NetCod, Jun. 2010, pp. 1-6.
18. N. Karamchandani, U. Niesen, and S. Diggavi, "Computation over mismatched channels," extended version, 2012. [Online]. Available: http://arxiv.org/abs/1204.5059
19. T. M. Cover and J. A. Thomas, Elements of Information Theory. Wiley, 1991.
20. R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge University Press, 1995.
21. B. Bollob́as, Extremal Graph Theory. Dover Publications, 2004.