Name
Abstract | ||
|---|---|---|
This paper addresses the problem of evaluating the maximum number of switching gates. We propose both exact and approximate algorithms to evaluate the maximum or nearly maximum number of switching gates based on the branch-and-bound method. In these methods, iterations of partially exhaustive enumeration and information from circuit structure are used to prune the search space. These methods are implemented on Sun workstations and experiments for ISCAS'85 and ISCAS'89 benchmark circuits have been done. For small circuits, the maximum number of switching gates can be easily evaluated using the exact algorithm. For large circuits, results for the approximate algorithm are compared with results obtained by applying randomly generated vector pairs. It has been shown that the approximate method is better than the latter. |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1002/scj.4690261402 | SYSTEMS AND COMPUTERS IN JAPAN |
Keywords | Field | DocType |
CMOS circuit,maximum number of switching gates,branch-and-bound method,partially exhaustive enumeration | Exact algorithm,Upper and lower bounds,Computer science,Enumeration,Workstation,Algorithm,CMOS,Branch and bound method,Electronic circuit | Journal |
Volume | Issue | ISSN |
26 | 14 | 0882-1666 |
Citations | PageRank | References |
2 | 0.50 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hiroaki Ueda | 1 | 154 | 16.74 |
| Kozo Kinoshita | 2 | 756 | 118.08 |