Upper and lower bounds on switching energy in VLSI-Reference-Cited by-同舟云学术

Upper and lower bounds on switching energy in VLSI

Published:1991-01-03 Issue:1 Volume:38 Page:222-254
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Kissin Gloria¹

Affiliation:

1. CWI/Univ. of Amsterdam, Amsterdam, The Netherlands

Abstract

A technology-independent framework is established for measuring the switching energy consumed by very large scale integrated (VLSI) circuits. Techniques are developed for analyzing functional energy consumption, and for designing energy-efficient VLSI circuits. A wire (or gate) in a circuit uses switching energy when it changes state from 1 to 0 or vice versa. This paper develops the Uniswitch Model (USM) of energy consumption, which measures the differences between pairs of states of an embedded circuit.…— From the Author's Abstract

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Link

https://dl.acm.org/doi/pdf/10.1145/102782.102790

Reference21 articles.

1. Energy consumption in VLSI circuits

2. ~BORODIN A. On relatmg Ume and space to size and depth SIAM J Compu{ 6 4 (Dec. 1977) ~733-744. ~BORODIN A. On relatmg Ume and space to size and depth SIAM J Compu{ 6 4 (Dec. 1977) ~733-744.

3. ~BRENT R. P. AND KUNG H. TOn the area of binary tree layouts. I~? Process Let/ 1L 1 (Aug. ~1980) 46-48. ~BRENT R. P. AND KUNG H. TOn the area of binary tree layouts. I~? Process Let/ 1L 1 (Aug. ~1980) 46-48.

4. ~ BRENT R. P. AND KUNG H T.The area-time complexity of binary multiplication. J AC3I 28 ~(July 1981) 521-534. 10.1145/322261.322269 ~ BRENT R. P. AND KUNG H T.The area-time complexity of binary multiplication. J AC3I 28 ~(July 1981) 521-534. 10.1145/322261.322269

5. ~BRENT R. P. AND KUNG H.T. regular layout for parallel adders. IEEE Tran s Comput C-31 ~3 (Mar. i982) 260-264. 10.1109/TC.1982.1675982 ~BRENT R. P. AND KUNG H.T. regular layout for parallel adders. IEEE Tran s Comput C-31 ~3 (Mar. i982) 260-264. 10.1109/TC.1982.1675982

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Energy-Efficient Algorithms;Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science;2016-01-14

2. Lower Bounds for Threshold Circuits of Bounded Energy;Interdisciplinary Information Sciences;2014

3. Size–energy tradeoffs for unate circuits computing symmetric Boolean functions;Theoretical Computer Science;2011-03

4. Size and Energy of Threshold Circuits Computing Mod Functions;Mathematical Foundations of Computer Science 2009;2009

5. Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity;Theoretical Computer Science;2008-11