Sciweavers

397 search results - page 27 / 80
» Designing Fast Asynchronous Circuits
Sort
View
DATE
2004
IEEE
125views Hardware» more  DATE 2004»
14 years 12 days ago
Fast Comparisons of Circuit Implementations
Abstract-- Digital designs can be mapped to different implementations using diverse approaches, with varying cost criteria. Post-processing transforms, such as transistor sizing ca...
Shrirang K. Karandikar, Sachin S. Sapatnekar
ICCAD
2003
IEEE
193views Hardware» more  ICCAD 2003»
14 years 1 months ago
FROSTY: A Fast Hierarchy Extractor for Industrial CMOS Circuits
: This paper presents FROSTY, a computer program for automatically extracting the hierarchy of a large-scale digital CMOS circuit from its transistor-level netlist description and ...
Lei Yang, C.-J. Richard Shi
GLVLSI
2003
IEEE
145views VLSI» more  GLVLSI 2003»
14 years 1 months ago
Using dynamic domino circuits in self-timed systems
We introduce a simple hierarchical design technique for using dynamic domino circuits to build high-performance self-timed data path circuits. We wrap the dynamic domino circuit i...
Jung-Lin Yang, Erik Brunvand
GLVLSI
2003
IEEE
185views VLSI» more  GLVLSI 2003»
14 years 1 months ago
Noise tolerant low voltage XOR-XNOR for fast arithmetic
With scaling down to deep submicron and nanometer technologies, noise immunity is becoming a metric of the same importance as power, speed, and area. Smaller feature sizes, low vo...
Mohamed A. Elgamel, Sumeer Goel, Magdy A. Bayoumi
CORR
2010
Springer
98views Education» more  CORR 2010»
13 years 7 months ago
Fast Self-Stabilizing Minimum Spanning Tree Construction
We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is O(log2 n) bits and it converges in O(n2 ) round...
Lélia Blin, Shlomi Dolev, Maria Potop-Butuc...