Towards a communication-theoretic understanding of system-level power consumption

IEEE Journal on Selected Areas in Communications

Volumn 29, Issue 8, 2011, Pages 1744-1755

  Grover, Pulkit ^a   Woyach, Kristen ^a   Sahai, Anant ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

decoding power; error correcting codes; Shannon waterfall; VLSI model

Indexed keywords

ERROR CORRECTING CODES; ERROR PROBABILITIES; LOW DENSITY; LOWER BOUNDS; MESSAGE-PASSING DECODING; PAPER MODELS; POINT-TO-POINT LINK; POWER CONSUMED; POWER EFFICIENT; SHANNON LIMIT; SHANNON WATERFALL; SYSTEM LEVELS; TOTAL POWER; TRANSMIT POWER; UNCODED TRANSMISSION; VLSI MODEL;

COMMUNICATION; INFORMATION THEORY; MESSAGE PASSING; OPTIMIZATION; WIRELESS TELECOMMUNICATION SYSTEMS;

DECODING;

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

References (49)

1. P. Grover and A. Sahai, "Green codes: Energy-efficient short-range communication," in Proc. 2008 IEEE Symposium on Information Theory, Toronto, Canada, Jul. 2008.
2. P. Grover, K. Woyach, H. Palaiyanur, and A. Sahai, "An interferenceaware perspective on decoding power," in 6th International symposium on turbo codes and iterative information processing, Brest, France, Sep. 2010.
3. The miracle month: The invention of the first transistor. [Online]. Available: Http://www.pbs.org/transistor/background1/events/miraclemo.html
4. C. E. Shannon, "A mathematical theory of communication," Bell Sys. Tech. Jour., vol. 27, pp. 379-423, 623-656, Jul./Oct. 1948.
5. J. Massey, "Deep-space communications and coding: A marriage made in heaven," in Advanced Methods for Satellite and Deep Space Communications: Lecture Notes in Control and Information Sciences 182, J. Hagenauer, Ed. New York: Springer, 1992, pp. 1-17.
6. M. Mansour and N. Shanbhag, "High-throughput LDPC decoders," IEEE Trans. Very Large Scale Integr. (VLSI) Syst., vol. 11, pp. 976-996, 2003.
7. Z. Zhang, V. Anantharam, M. Wainwright, and B. Nikolic, "An efficient 10GBASE-T ethernet LDPC decoder design with low error floors," IEEE J. Solid-State Circuits, vol. 45, no. 4, pp. 843-855, Apr. 2010.
8. Z. Zhang, "Design of LDPC decoders for improved low error rate performance," Ph.D. dissertation, UC Berkeley, Berkeley, CA, 2009.
9. L. Hanzo, OFDM and MC-CDMA for broadband multi-user communications, WLANs, and broadcasting. Wiley-IEEE Press, 2003.
10. C. Marcu, D. Chowdhury, C. Thakkar, J.-D. Park, L.-K. Kong, M. Tabesh, Y. Wang, B. Afshar, A. Gupta, A. Arbabian, S. Gambini, R. Zamani, E. Alon, and A. Niknejad, "A 90 nm CMOS low-power 60 GHz transceiver with integrated baseband circuitry," IEEE J. Solid-State Circuits, vol. 44, no. 12, pp. 3434-3447, Dec. 2009.
11. S Cui, AJ Goldsmith and A Bahai, "Energy Constrained Modulation Optimization," IEEE Trans. Wireless Commun., vol. 4, no. 5, pp. 1-11, 2005.
12. P. Youssef-Massaad, L. Zheng, and M. Medard, "Bursty transmission and glue pouring: On wireless channels with overhead costs," IEEE Trans. Wireless Commun., vol. 7, no. 12, pp. 5188-5194, Dec. 2008.
13. S. Verdú, "On channel capacity per unit cost," IEEE Trans. Inf. Theory, vol. 36, no. 9, pp. 1019-1030, Sep. 1990. (Pubitemid 20738361)
14. V. Subramanian and B. Hajek, "Broad-band fading channels: Signal burstiness and capacity," IEEE Trans. Inf. Theory, vol. 48, no. 4, pp. 809-827, Apr. 2002. (Pubitemid 34474779)
15. T. Richardson and R. Urbanke, Modern Coding Theory. Cambridge University Press, 2007.
16. S. L. Howard, C. Schlegel, and K. Iniewski, "Error control coding in low-power wireless sensor networks: When is ECC energy-efficient?" EURASIP Journal on Wireless Communications and Networking, pp. 1-14, 2006.
17. T. J. Richardson and R. L. Urbanke, "The capacity of low-density paritycheck codes under message-passing decoding," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 599-618, Feb. 2001. (Pubitemid 32318092)
18. T. Lengauer, "VLSI theory," Handbook of theoretical computer science (vol. A): Algorithms and complexity, pp. 835-866, 1990.
19. C. D. Thompson, "Area-time complexity for VLSI," in Proc. 11th annual ACM symposium on Theory of computing (STOC). NewYork,NY, USA: ACM, 1979, pp. 81-88.
20. A. Sahai and P. Grover, "A general lower bound on the decoding complexity of message-passing decoding," in In preparation, 2010. [Online]. Available: Http://www.eecs.berkeley.edu/~pulkit/papers/ComplexityITPaper.pdf
21. R. Blahut, "Hypothesis testing and information theory," IEEE Trans. Inf. Theory, vol. 20, no. 4, pp. 405-417, 2002.
22. A. Sahai, "Why block-length and delay behave differently if feedback is present," IEEE Trans. Inf. Theory, pp. 1860-1886, May 2008. (Pubitemid 351689539)
23. I. Sason and G. Wiechman, "Bounds on the number of iterations for turbo-like ensembles over the binary erasure channel," IEEE Trans. Inf. Theory, vol. 55, no. 6, pp. 2602-2617, 2009.
24. D. Burshtein and G. Miller, "Bounds on the performance of belief propagation decoding," IEEE Trans. Inf. Theory, vol. 48, no. 1, pp. 112-122, Jan. 2002. (Pubitemid 34125313)
25. N. Golmie, "Interference in the 2.4 GHz ISM band: Challenges and solutions," Network. for Perv. Computing, vol. 500, p. 48, 2005.
26. C. D. Thompson, "A complexity theory for VLSI," Ph.D. dissertation, Carnegie Mellon University, Pittsburgh, PA, USA, 1980.
27. R. Cole and A. Siegel, "Optimal VLSI circuits for sorting," J. ACM, vol. 35, no. 4, pp. 777-809, 1988.
28. B. P. Sinha and P. K. Srimani, "A new parallel multiplication algorithm and its VLSI implementation," in Proc. 1988 ACM 16th annual conference on computer science. New York, NY, USA: ACM, 1988, pp. 366-372.
29. M. R. Kramer and J. van Leeuwen, "The VLSI complexity of boolean functions," in Proc. Symposium "Rekursive Kombinatorik" on Logic and Machines: Decision Problems and Complexity. London, UK: Springer-Verlag, 1984, pp. 397-407.
30. S. N. Bhatt, G. Bilardi, and G. Pucci, "Area-time tradeoffs for universal VLSI circuits," Theoretical Computer Science, vol. 408, no. 2-3, pp. 143-150, 2008, excursions in Algorithmics: A Collection of Papers in Honor of Franco P. Preparata.
31. A. C.-C. Yao, "Some complexity questions related to distributive computing( preliminary report)," in STOC '79: Proceedings of the eleventh annual ACM symposium on Theory of computing. NewYork,NY, USA: ACM, 1979, pp. 209-213.
32. J. Ullman, Computational Aspects of VLSI Design. Computer Science Press, 1983.
33. A. C.-C. Yao, "The entropic limitations on VLSI computations (extended abstract)," in STOC '81: Proc. thirteenth annual ACM symposium on Theory of computing. New York, NY, USA: ACM, 1981, pp. 308-311.
34. E. Arikan, "A performance comparison of polar codes and Reed-Muller codes," IEEE Commun. Lett., vol. 12, no. 6, pp. 447-449, 2008.
35. S. Vasudevan, C. Zhang, D. Goeckel, and D. Towsley, "Optimal power allocation in wireless networks with transmitter-receiver power tradeoffs," Proc. 25th IEEE International Conference on Computer Communications INFOCOM, pp. 1-11, Apr. 2006.
36. R. G. Gallager, Information Theory and Reliable Communication. New York, NY: John Wiley, 1971.
37. P. Grover, "Bounds on the tradeoff between rate and complexity for sparse-graph codes," in 2007 IEEE Information Theory Workshop (ITW), Lake Tahoe, CA, 2007.
38. Y. Polyanskiy, H. Poor, and S. Verdu, "Dispersion of Gaussian channels," in IEEE International Symposium on Information Theory (ISIT), 2009, pp. 2204-2208.
39. P. Grover, "Code for "towards a communication-theoretic understanding of system-level power consumption"." [Online]. Available: Http://tiny.cc/codeforgreencodes
40. M. Lentmaier, D. V. Truhachev, K. S. Zigangirov, and D. J. Costello, "An analysis of the block error probability performance of iterative decoding," IEEE Trans. Inf. Theory, vol. 51, no. 11, pp. 3834-3855, Nov. 2005. (Pubitemid 41622584)
41. F. Baccelli and B. Blaszczyszyn, "Stochastic geometry and wireless networks: Volume I theory," Found. Trends Netw., vol. 3, no. 3-4, pp. 249-449, 2009.
42. M. Haenggi, J. G. Andrews, F. Baccelli, O. Dousse, and M. Franceschetti, "Stochastic geometry and random graphs for the analysis and design of wireless networks," IEEE J. Sel. Areas Commun., vol. 27, no. 7, pp. 1029-1046, 2009.
43. M. Haenggi and R. K. Ganti, Interference in Large Wireless Networks. Hanover, MA: Foundations and Trends in Communication and Information theory, NOW Publishing, 2008, vol. 3, no. 8.
44. P. Gupta and P. R. Kumar, "The capacity of wireless networks," IEEE Trans. Inf. Theory, vol. 46, no. 2, pp. 388-404, Mar. 2000.
45. V. Cadambe and S. A. Jafar, "Interference alignment and degrees of freedom of the K-user interference channel," IEEE Trans. Inf. Theory, vol. 54, no. 8, pp. 3425-3441, Aug. 2008.
46. M-S Alouini and AJ Goldsmith, "Area spectral efficiency of cellular mobile radio systems," IEEE Trans. Veh. Technol., vol. 48, no. 4, 1999.
47. Landauer's principle. [Online]. Available: Http://en.wikipedia.org/wiki/ Landauer's principle
48. S. Verdu, "On channel capacity per unit cost," IEEE Trans. Inf. Theory, vol. 36, pp. 1019-1030, 1990. (Pubitemid 20738361)
49. M. Lentmaier, G. Fettweis, K. Zigangirov, and D. Costello, "Approaching capacity with asymptotically regular LDPC codes," in IEEE Information Theory and Applications Workshop, 2009, pp. 173-177.