Sciweavers

36 search results - page 2 / 8
» A Fast Two-level Logic Minimizer
Sort
View
DAC
2002
ACM
14 years 7 months ago
Fast three-level logic minimization based on autosymmetry
Anna Bernasconi, Valentina Ciriani, Fabrizio Lucci...
VLSID
1998
IEEE
88views VLSI» more  VLSID 1998»
13 years 10 months ago
A Fast Two-level Logic Minimizer
P. Srinivasa Rao, James Jacob
ASPDAC
2005
ACM
97views Hardware» more  ASPDAC 2005»
13 years 8 months ago
Fast synthesis of exact minimal reversible circuits using group theory
- We present fast algorithms to synthesize exact minimal reversible circuits for various types of gates and costs. By reducing reversible logic synthesis problems to group theory p...
Guowu Yang, Xiaoyu Song, William N. N. Hung, Marek...
DDECS
2008
IEEE
185views Hardware» more  DDECS 2008»
14 years 21 days 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...
TMC
2012
11 years 8 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...