Sciweavers

10718 search results - page 78 / 2144
» On the Circuit Implementation Problem
Sort
View
DATE
2010
IEEE
148views Hardware» more  DATE 2010»
15 years 11 months ago
Intent-leveraged optimization of analog circuits via homotopy
—This paper proposes a circuit optimization approach that can ease the computational burden on the simulation-based circuit optimizers by leveraging simple design equations that ...
Metha Jeeradit, Jaeha Kim, Mark Horowitz
ISCAS
2005
IEEE
136views Hardware» more  ISCAS 2005»
15 years 11 months ago
Economical passive filter synthesis using genetic programming based on tree representation
—In this work we propose a novel tree representation for RLC circuits. Genetic programming based on the tree representation is described and applied to passive filter synthesis p...
Hao-Sheng Hou, Shoou-Jinn Chang, Yan-Kuin Su
ISQED
2006
IEEE
155views Hardware» more  ISQED 2006»
16 years 6 days ago
FASER: Fast Analysis of Soft Error Susceptibility for Cell-Based Designs
This paper is concerned with statically analyzing the susceptibility of arbitrary combinational circuits to single event upsets that are becoming a significant concern for reliabi...
Bin Zhang, Wei-Shen Wang, Michael Orshansky
CL
2000
Springer
15 years 9 months ago
Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking
Boolean circuits offer a natural, structured, and compact representation of Boolean functions for many application domains. In this paper a tableau method for solving satisfiabilit...
Tommi A. Junttila, Ilkka Niemelä
ECCC
2010
103views more  ECCC 2010»
15 years 1 months ago
A note on exponential circuit lower bounds from derandomizing Arthur-Merlin games
We present an alternate proof of the recent result by Gutfreund and Kawachi that derandomizing Arthur-Merlin games into PNP implies linear-exponential circuit lower bounds for ENP...
Scott Aaronson, Baris Aydinlioglu, Harry Buhrman, ...