Sciweavers

13 search results - page 1 / 3
» Fast three-level logic minimization based on autosymmetry
Sort
View
DAC
2002
ACM
15 years 10 months ago
Fast three-level logic minimization based on autosymmetry
Anna Bernasconi, Valentina Ciriani, Fabrizio Lucci...
TCAD
1998
86views more  TCAD 1998»
14 years 9 months ago
Fast heuristic and exact algorithms for two-level hazard-free logic minimization
None of the available minimizers for 2-level hazard-free logic minimization can synthesize very large circuits. This limitation has forced researchers to resort to manual and auto...
Michael Theobald, Steven M. Nowick
TMC
2012
12 years 11 months ago
Fast Data Collection in Tree-Based Wireless Sensor Networks
—We investigate the following fundamental question—how fast can information be collected from a wireless sensor network organized as tree? To address this, we explore and evalu...
Özlem Durmaz Incel, Amitabha Ghosh, Bhaskar K...
DDECS
2008
IEEE
185views Hardware» more  DDECS 2008»
15 years 3 months ago
Fast Boolean Minimizer for Completely Specified Functions
: We propose a simple and fast two-level minimization algorithm for completely specified functions in this paper. The algorithm is based on processing ternary trees. A ternary tree...
Petr Fiser, Pemysl Rucký, Irena Vanov&aacut...
ASYNC
2001
IEEE
136views Hardware» more  ASYNC 2001»
15 years 1 months ago
Efficient Exact Two-Level Hazard-Free Logic Minimization
This paper presents a new approach to two-level hazardfree sum-of-products logic minimization. No currently available minimizers for single-output literal-exact two-level hazard-f...
Chris J. Myers, Hans M. Jacobson