A Comparison of Decision Tree Approach and Neural Networks Based Heuristic Dynamic Programming Approach for Subcircuit Extraction Problem
Abstract
The applications of non-standard logic device are increasing fast in the industry. Many of these applications require high speed, low power, functionality and flexibility, which cannot be obtained by standard logic device. These special logic cells can be constructed by the topology design strategy automatically or manually. However, the need arises for the topology design verification. The layout versus schematic (LVS) analysis is an essential part of topology design verification, and subcircuit extraction is one of the operations in the LVS testing. In this paper, we first provided an efficient decision tree approach to the graph isomorphism problem, and then effectively applied it to the subcircuit extraction problem based on the solution to the graph isomorphism problem. To evaluate its performance, we compare it with the neural networks based heuristic dynamic programming algorithm (SubHDP) which is by far one of the fastest algorithms for subcircuit extraction problem.
Recommended Citation
N. Zhang and D. C. Wunsch, "A Comparison of Decision Tree Approach and Neural Networks Based Heuristic Dynamic Programming Approach for Subcircuit Extraction Problem," Proceedings of SPIE - The International Society for Optical Engineering, vol. 5103, pp. 143 - 149, SPIE--The International Society for Optical Engineering, Jan 2003.
The definitive version is available at https://doi.org/10.1117/12.485736
Meeting Name
SPIE 5103, Intelligent Computing: Theory and Applications (2003: Apr. 21-22, Orlando, FL)
Department(s)
Electrical and Computer Engineering
International Standard Serial Number (ISSN)
0277-786X
Document Type
Article - Conference proceedings
Document Version
Citation
File Type
text
Language(s)
English
Rights
© 2003 SPIE--The International Society for Optical Engineering, All rights reserved.
Publication Date
01 Jan 2003
