Computation over mismatched channels

2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012

Volumn , Issue , 2012, Pages 1042-1048

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

^a Engineering IV   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CHANNEL FUNCTIONS; COMMUNICATION DESIGN; COMMUNICATION TASK; DISTRIBUTED COMPUTATIONS; MULTIPLE ACCESS CHANNELS; PERFORMANCE GAIN; TARGET FUNCTIONS;

SEPARATION;

COMMUNICATION;

EID: 84875710783     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/Allerton.2012.6483333     Document Type: Conference Paper

References (16)

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örner 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. 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)
6. V. Doshi, D. Shah, M. Médard, and M. Effros, "Functional compression through graph coloring," IEEE Trans. Inf. Theory, vol. 56, no. 8, pp. 3901-3917, Aug. 2010.
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. 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)
9. 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)
10. S. Katti, S. Gollakota, and D. Katabi, "Embracing wireless interference: Analog network coding," in Proc. ACM SIGCOMM, Oct. 2007, pp. 397-408. (Pubitemid 350239801)
11. 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)
12. 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.
13. U. Niesen and P. Whiting, "The degrees of freedom of compute-andforward," arXiv:1101.2182 [cs.IT], Jan. 2011, to appear in IEEE Trans. Inf. Theory.
14. L. Keller, N. Karamchandani, and C. Fragouli, "Function computation over linear channels," in Proc. IEEE NetCod, Jun. 2010, pp. 1-6.
15. N. Karamchandani, U. Niesen, and S. Diggavi, "Computation over mismatched channels," pre-print, 2012. [Online]. Available: http://arxiv.org/abs/1204.5059
16. T. M. Cover and J. A. Thomas, Elements of Information Theory. Wiley, 1991.