Upper and lower bounds on switching energy in VLSI
From MaRDI portal
Publication:4302835
DOI10.1145/102782.102790zbMath0809.94033OpenAlexW1999603632MaRDI QIDQ4302835
Publication date: 30 March 1995
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/5703
Analysis of algorithms and problem complexity (68Q25) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)
Related Items (4)
Size and Energy of Threshold Circuits Computing Mod Functions ⋮ Size-energy tradeoffs for unate circuits computing symmetric Boolean functions ⋮ Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity ⋮ On the Computational Power of Threshold Circuits with Sparse Activity
This page was built for publication: Upper and lower bounds on switching energy in VLSI