Categories and Subject Descriptors: B.2.1 [Arithmetic and Logic Structures]: Design Styles -- parallel; B.2.2 [Arithmetic and Logic Structures]: Performance Analysis and Design Aids -- worst-case and average-case analysis; B.6.1 [Logic Design]: Design Styles -- combinatorial logic, parallel circuits; B.7.1 [Integrated Circuits]: Types and Design Styles -- VLSI; B.7.2 [Integrated Circuits]: Design Aids -- layout; F.1.1 [Computation by Abstract Devices]: Models of Computation -- circuits; F.1.2 [Computation by Abstract Devices]: Modes of Computation -- parallelism; F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems -- computations on discrete structures, routing and layout; F.2.3 [Analysis of Algorithms and Problem Complexity]: Tradeoffs among Complexity Measures
General Terms: Algorithms, Design, Measurement, Performance, Theory
Additional Key Words and Phrases: Addition, AND function, average-case analysis, CID VLSI circuit, circuit scheme, compare functions, embedding, energy consumption, energy-efficient, layout, multiswitch models, 1-switchable functions, OR function, parity function, switching energy, uniswitch energy, upper and lower bounds, USM
Selected references
- Alok Aggarwal, Ashok K. Chandra, and Prabhakar Raghavan. Energy consumption in VLSI circuits (preliminary version). In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pages 205-216, Chicago, Illinois, 2-4 May 1988.
- R. P. Brent and H. T. Kung. The area-time complexity of binary multiplication. Journal of the ACM, 28(3):521-534, July 1981.
- Gloria Kissin. Measuring energy consumption in VLSI circuits: a foundation. In Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, pages 99-104, San Francisco, California, 5-7 May 1982.
- Richard E. Ladner and Michael J. Fischer. Parallel prefix computation. Journal of the ACM, 27(4):831-838, October 1980.
- Andrew C. Yao. The entropic limitations on VLSI computations (extended abstract). In Conference Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computation, pages 308-311, Milwaukee, Wisconsin, 11-13 May 1981.