Sciweavers

868 search results - page 3 / 174
» Optimizing Logic Design Using Boolean Transforms
Sort
View
GLVLSI
2009
IEEE
125views VLSI» more  GLVLSI 2009»
14 years 2 months ago
Timing-driven N-way decomposition
Logic decomposition has been extensively used to optimize the worst-case delay and the area in the technology independent phase. Bi-decomposition is one of the state-of-art techni...
David Bañeres, Jordi Cortadella, Michael Ki...
ASPDAC
2008
ACM
106views Hardware» more  ASPDAC 2008»
13 years 8 months ago
Verifying full-custom multipliers by Boolean equivalence checking and an arithmetic bit level proof
—In this paper we describe a practical methodology to formally verify highly optimized, industrial multipliers. We a multiplier description language which abstracts from low-leve...
Udo Krautz, Markus Wedler, Wolfgang Kunz, Kai Webe...
INFOCOM
2012
IEEE
11 years 10 months ago
Block permutations in Boolean Space to minimize TCAM for packet classification
Packet classification is one of the major challenges in designing high-speed routers and firewalls as it involves sophisticated multi-dimensional searching. Ternary Content Address...
Rihua Wei, Yang Xu, H. Jonathan Chao
ISMVL
2007
IEEE
102views Hardware» more  ISMVL 2007»
14 years 1 months ago
A Generalization of the Deutsch-Jozsa Algorithm to Multi-Valued Quantum Logic
We generalize the binary Deutsch-Jozsa algorithm to nvalued logic using the quantum Fourier transform. Our algorithm is not only able to distinguish between constant and balanced ...
Yale Fan
ETS
2010
IEEE
150views Hardware» more  ETS 2010»
13 years 8 months ago
Improving CNF representations in SAT-based ATPG for industrial circuits using BDDs
It was shown in the past that ATPG based on the Boolean Satisfiability problem is a beneficial complement to traditional ATPG techniques. Its advantages can be observed especially ...
Daniel Tille, Stephan Eggersglüß, Rene ...