ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Candidate subcircuits for functional module identification in logic circuits
Full text PdfPdf (471 KB)
Source Great Lakes Symposium on VLSI archive
Proceedings of the 10th Great Lakes symposium on VLSI table of contents
Chicago, Illinois, United States
Pages: 34 - 38  
Year of Publication: 2000
ISBN:1-58113-251-4
Authors
Jennifer L. White  Department of Computer Science and Engineering, Michigan State University
Anthony S. Wojcik  Department of Computer Science and Engineering, Michigan State University
Moon-Jung Chung  Department of Computer Science and Engineering, Michigan State University
Travis E. Doom  Department of Computer Science and Engineering, Wright State University
Sponsors
Northwestern University : Northwestern University
SIGDA: ACM Special Interest Group on Design Automation
IEEE : Institute of Electrical and Electronics Engineers
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 12,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/330855.332575
What is a DOI?

ABSTRACT

Recovering functional information from existing hardware is a difficult problem in design automation. However, it is an important focus for designers attempting to redesign for expanded functionality or superior performance. Often, the only reliable information available about a piece of digital hardware is the hardware itself. Documentation, even if it is available, may be outdated or incorrect. Existing procedures are able to recover the transistor-level netlist, or a gate-level netlist from an existing implementation. The next step in this process is the gate-level to module-level transformation, the focus of this paper. We have designed a technique to enumerate all of the potential modules within a gate-level netlist so that their functional equivalence to known modules may be evaluated.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
 
4
 
5
Travis E. Doom, Jennifer L. White, Gregory Chisholm, and Anthony S. Wojcik. Identification of functional components in combinational circuits. Technical Report ANL/DIS/TM- 47, Argonne National Laboratory, January 1998.
6
 
7
 
8
Christoph M. Hoffman. Group Theoretic Algorithms and Graph Isomorphism. Springer-Verlag, 1982.
 
9
 
10
Ken McElvain. Lgsynth93 benchmark set: Version 4.0. Available on the World Wide Web at http:ltwww.cbl.ncsu.edu/CBL.Docsllgs93.html, May 1993.
11
 
12
George Petz and Uli Roettcher. Circuit comparison by hierarchical pattern matching. In Proceedings of the lnterna. tional Conference on Computer Aided Design, pages 290 - 293, 1991.
 
13
 
14
Jennifer L. White and Anthony S. Wojcik. A technique for unique subgraph enumeration. Technical Report MSU-CSE- 99-35, Computer Science and Engineering, Michigan State University, East Lansing, Michigan, October 99.

Collaborative Colleagues:
Jennifer L. White: colleagues
Anthony S. Wojcik: colleagues
Moon-Jung Chung: colleagues
Travis E. Doom: colleagues