Fundamental limits on the power consumption of encoding and decoding

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2012, Pages 2716-2720

  Grover, Pulkit ^a   Goldsmith, Andrea ^a   Sahai, Anant ^b  

^a STANFORD UNIVERSITY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ENCODING AND DECODING; ENCODING/DECODING; ERROR CORRECTING CODE; INFORMATION FLOWS; INFORMATION THEORETIC BOUNDS; SQUARE-ROOT; TOTAL POWER;

DECODING; INFORMATION THEORY; VLSI CIRCUITS;

ENCODING (SYMBOLS);

EID: 84867537624     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2012.6284015     Document Type: Conference Paper

References (15)

1. P. Grover, A. J. Goldsmith, and A. Sahai, "Fundamental limits on transmission and computation power," Feb. 2012, extended version of paper submitted to ISIT'12. [Online]. Available: http://tiny.cc/WireModel
2. S Cui, AJ Goldsmith and A Bahai, "Energy Constrained Modulation Optimization," IEEE Trans. Wireless Commun., vol. 4, no. 5, pp. 1-11, Sep. 2005.
3. 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 Journal of Solid-State Circuits, vol. 44, no. 12, pp. 3434-3447, 2009.
4. K. Ganesan, P. Grover, and J. M. Rabaey, "The power cost of overdesigning codes," in Proceedings of the 2011 IEEE Workshop on Signal Processing Systems (SiPS), Oct. 2011.
5. K. Ganesan, Y. Wen, P. Grover, J. M. Rabaey, and A. J. Goldsmith, "Optimizing code-decoder pairs for "green" code design," submitted to IEEE Globecom, March 2012.
6. C. D. Thompson, "Area-time complexity for VLSI," in Proceedings of the 11th annual ACM symposium on Theory of computing (STOC). New York, NY, USA: ACM, 1979, pp. 81-88.
7. -, "A complexity theory for VLSI," Ph.D. dissertation, Carnegie Mellon University, Pittsburgh, PA, USA, 1980.
8. A. C.-C. Yao, "Some complexity questions related to distributive computing," in Proceedings of the eleventh annual ACM symposium on Theory of computing, 1979, pp. 209-213.
9. T. M. Cover and J. A. Thomas, Elements of Information Theory, 1st ed. New York: Wiley, 1991.
10. A. El Gamal, J. Greene, and K. Pang, "VLSI complexity of coding," in The MIT Conf. on Adv. Research in VLSI, Cambridge, MA, Jan. 1984.
11. P. Grover, A. Goldsmith, A. Sahai, and J. Rabaey, "Information theory meets circuit design: Why capacity-approaching codes require more circuit area and power," in Proceedings of the Allerton Conference on Communication, Control, and Computing, Monticello, IL, Sep. 2011.
12. A. Sahai and P. Grover, "A general lower bound on the VLSI decoding complexity," in preparation, 2012. [Online]. Available: http://www.eecs.berkeley.edu/ pulkit/papers/ComplexityITPaper.pdf
13. P. Grover, "Bounds on the tradeoff between rate and complexity for sparse-graph codes," in IEEE Information Theory Workshop (ITW), 2007.
14. P. Grover, K. A. Woyach, and A. Sahai, "Towards a communication-theoretic understanding of system-level power consumption," IEEE Jour. Selected Areas in Comm., Special Issue on Energy-Efficient Communications. Arxiv preprint arXiv:1010.4855, vol. 29, no. 8, Sep. 2011.
15. J. Rabaey, A. Chandrakasan, and B. Nikolic, Digital integrated circuits. Prentice Hall Englewood Cliffs, New Jersey, 2002.