395 search results - page 51 / 79 » Encoding Algorithms for Logic Synthesis |
72
Voted
ICCS
2005
Springer
15 years 7 months ago
2005
Springer
This paper proposes an innovative algorithm to find the two’s complement of a binary number. The proposed method works in logarithmic time (O(logN)) instead of the worst case li...
149
Voted
LOPSTR
2007
Springer
15 years 8 months ago
2007
Springer
CooML is an object-oriented modeling language where specifications are theories in a constructive logic designed to handle incomplete information. In this logic we view snapshots ...
133
click to vote
DATE
2002
IEEE
15 years 7 months ago
2002
IEEE
The design of application (-domain) specific instructionset processors (ASIPs), optimized for code size, has traditionally been accompanied by the necessity to program assembly, ...
113
click to vote
DAGSTUHL
2007
15 years 3 months ago
2007
Abstract. Well-founded orders are the most basic, but also most important ingredient to virtually all termination analyses. Numerous fully automated search algorithms for these cla...
121
click to vote
DDECS
2008
IEEE
15 years 8 months ago
2008
IEEE
: 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...