Sciweavers

1093 search results - page 92 / 219
» Verifying VLSI Circuits
Sort
View
ASPDAC
2006
ACM
103views Hardware» more  ASPDAC 2006»
14 years 4 months ago
Low area pipelined circuits by multi-clock cycle paths and clock scheduling
— A new algorithm is proposed to reduce the number of intermediate registers of a pipelined circuit using a combination of multi-clock cycle paths and clock scheduling. The algor...
Bakhtiar Affendi Rosdi, Atsushi Takahashi
ISLPED
2006
ACM
70views Hardware» more  ISLPED 2006»
14 years 4 months ago
Sub-threshold design: the challenges of minimizing circuit energy
In this paper, we identify the key challenges that oppose subthreshold circuit design and describe fabricated chips that verify techniques for overcoming the challenges. Categorie...
Benton H. Calhoun, Alice Wang, Naveen Verma, Anant...
ASPDAC
2001
ACM
107views Hardware» more  ASPDAC 2001»
14 years 1 months ago
An efficient solution to the storage correspondence problem for large sequential circuits
Abstract- Traditional state-traversal-basedmethods for verifying sequential circuits are computationally infeasible for circuits with a large number of memory elements. However, if...
Wanlin Cao, D. M. H. Walker, Rajarshi Mukherjee
CONCUR
1998
Springer
14 years 2 months ago
On Discretization of Delays in Timed Automata and Digital Circuits
In this paper we solve the following problem: \given a digital circuit composed of gates whose real-valued delays are in an integerbounded interval, is there a way to discretize ti...
Eugene Asarin, Oded Maler, Amir Pnueli
ATVA
2007
Springer
150views Hardware» more  ATVA 2007»
14 years 2 months ago
3-Valued Circuit SAT for STE with Automatic Refinement
Abstract. Symbolic Trajectory Evaluation (STE) is a powerful technique for hardware model checking. It is based on a 3-valued symbolic simulation, using 0,1 and X n"), where t...
Orna Grumberg, Assaf Schuster, Avi Yadgar