Alok Aggarwal
ABSTRACT
We study energy consumption in CMOS-style VLSI circuits, where a wire of length / consumes energy Θ(l)when switching. Three model are considered: the uniswitch model where a wire is assumed to switch at most once if the input changes, the multiswitch model which allows the possibility of multiple switches caused by uncontrolled delays, and the clock model which also takes clock distribution energy into account. Previous lower bound results for the uniswitch model applied only to circuits where intermediate data were not encoded (for example, in unary) by using additional wires and area to reduce the energy. We show that such encodings can be useful for adding two n-bit numbers using synchronous Boolean circuits (energy reduction from Θ(n log n) to Ο(n log n/(log log n)), but not for transitive functions such as the cyclic shift of n bits (energy Θ(n2)). For the multiswitch model, we develop layouts that achieve energy close to the uniswitch case for these problems, and show a separation result between the uniswitch and multiswitch models. Finally, some energy-period tradeoffs are shown for the clock model.
- AUY83.A. V. Aho, J. D. Lrllman, and M. Yannakakis, "On Notions of Information Transfer in VLSI Circuits,'' Proc. of the 15th Annual ACM Symposium on the Theory of Computing, April 1983, pp. 38.4-392. Google Scholar
Digital Library
- Ba81.G. M. Baudet, "On tile Area Required by VLSI Circuits," Proc. of the CMU Conference on VLSI Systems and Computations, Eds. H. T. Kung, B. Sprou!l, and G. Steele, CS Press, Maryland, Oct. 1981, pp. 100-107.Google Scholar
- BK81.R. P. Brent and H. ~f. Kung, "The Complexity of Binary Arithmetic," Proc. of the 12th ACM Annual Symposium on Theory of Computing, May 1,980, pp. 190-200. Google ScholarDigital Library
- BK81.R. P. Brent and H. T. Kung, "A Regular Layout for Parallel Adders," IEEE Transactions on Computers, March 1982, pp. 260-264.Google Scholar
- BP86.G. Bilardi and F. P. Preparata, "Size-Time Complexity of Boolean Networks for Prefix Computations,'' Proc. of the 19th Annual ACM Symposium on the Theory of Computing, May 1987, pp. 43(5-442. Google ScholarDigital Library
- HS79.I,. H. Harper and .t.E. Savage, "Lower Bounds ()n Synchronous Combinational Complexity," SIAM Journal of Computing, Vol. 8, No. 3, 1979, pp. 115-119.Google ScholarCross Ref
- Jo80.R. B. Johnson, "The Complexity of a VI.Si Adder." Information Processing Letters, Vol. l l, No. 2, 1980, pp. 92-93.Google Scholar
- Ki82.G. Kissin, "Measuring Energy Consumption in VLSI Circuits: a Founda.tion," Proc. of the 14th Annual ACM Symposium on the Theory of Computing, May 1982, pp. 99-- 105. Google ScholarDigital Library
- Ki85.G. Kissin, "Functional Bounds on Switching Energy,'' Proc. of the 1985 Chapel Hill Conference on Very Large Scale Integration, Ed. Henry Fuchs, Computer Science Press, 1985, pp. 181-196.Google Scholar
- KZ81.Z. M. Kedem and A. Zorat, "Replication of Inputs May Save Resources in VI.S!," Proc. of the CMU Conference on VI,SI Sy;;tcms and Computations, Eds. II, 'I'. Kung, B, Spr(~ull, and G. Steele, CS t)rcss, Maryland, Oct. 1981, pp. 52-60.Google Scholar
- LM81.T. l_,cngauer and K. Mehlhorn, "On the Complexity of VLSI Computations," Proc. of the CMU Conference on V1,S! Systems and Computations, Eds. H. T. Kung, B. Sproull, and G. Steele, 1982, pp. 89-99.Google Scholar
- LS81.R. J. Lipton and R. Sedgewick, "Lower Bounds for VLSi," Proc. of 13th Annual ACM Symposium on the Theory of Computing, May 1981, pp. 300-307. Google ScholarDigital Library
- MC80.C. Mead and L, Conway, Imroduction to VLSI Systems, Addison Wesley, Chapter 9, 1980. Google ScholarDigital Library
- MS82.K. Mehthorn and E. M. Schmidt, "Las Vegas is Better than Determinism in VLSI and Distributed Computing," Proe. of the 14th An~iual ACM Symposium on the Theory of Computing, May 2982, pp. 330-337. Google ScholarDigital Library
- Of63.Yu. Ofman, "On the Algorithmic Complexity of Discrete Functions," Soviet Physics.-Doklady, Vol. 7, No. 7, Jan. 1963, pp. 589-592.Google Scholar
- NMB83.D. Nath, S.N. Maheshwari, and P.C.P. Bhatt, "Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees", IEEE Transactions on Computers, vol. C-32, No. 6, 1983, pp. 569-581.Google Scholar
- PV81.F. P. Preparata and J. Vuillemin, "Area-Time Optimal VLSI Networks for Computing Integer Multiplication and Discrete Fourier Transform," Proc. of 8th Internation Colloquium on Automata, Languages, and Programming, 1981, pp. 29-40. Google ScholarDigital Library
- Sa81.J. E. Savage, "Area-Time Tradeoffs for Matrix Multiplication and Related Results," Journal of Computer and System Sciences, Vol. 3. No. 2, 1081, pp. 230-242.Google Scholar
- ST86.L. Snyder and A. Tyagi, "The Energy Complexity of Transitive !:utwtions," Pr()c. of the 24th Annual AiIcrton Conference on ('om,nt, nication. Control, and C()mputing, Oct. 1986. pp. 562-5?2.Google Scholar
- Ti84.P. 'Fiwari, "Lower Bounds ,,)n Comlnunication Complexity in Distributed Computer Networks," Proc. of the 25th Annual Symposium on the Foundations of Computer Science, Oct. 1984, pp.89-99.Google Scholar
- Th79.C. D. Thompson, "Area-Time Complexity for VLSI," Proc. of the 1 l th ACM Annual Symposium on the Theory of Computing, May 19'79, pp. 81-88. Google ScholarDigital Library
- Th80.C. D. Thompson, "A Complexity Theory for VLSI," Ph.D. Thesis, Dept. of Computer Science, Carnegie-Mellon University, 1980. Google ScholarDigital Library
- Tu87.G. Turan, Personal Communication, 1987.Google Scholar
- Ul83.J. D. Utlman, Computational Aspects of I"LSI, Computer Science Press, Maryland, 1983.Google Scholar
- Vu83.J. Vuillcmin, "A ('onlbinalori:ll !.imit to thc Conll)uting Power ()i' VLSt Circuits." i!ilgE Trans. on Computers, Vol. C-30, No. 2, 1983, 135-140.Google Scholar
- Ya81.A.-C. C. Ya<~, "Entr<)pic l,imitations in VI.S!," Proc. 13th Annual ACM Syrup, ()n Theory of Computing, pp. 308-311. 1981.Google Scholar
Index Terms
- Energy consumption in VLSI circuits
Recommendations
Measuring energy consumption in VLSI circuits: A foundation
STOC '82: Proceedings of the fourteenth annual ACM symposium on Theory of computingEnergy conservation is a key question in today' s society and the proliferation of VLSI circuits encourages an energy conscious approach to their design. Although a single chip at current densities may consume less than one watt of power, assembling ...
Estimation of energy consumption in speed-independent control circuits
We describe a technique to estimate the energy consumed by speed-independent asynchronous (clock-less) control circuits. Because speed-independent circuits are hazard-free under all possible combinations of gate delays, we prove that an accurate ...
Comments