Abstract
Motivated by the problem of reengineering legacy digital circuits for which design information is missing or incomplete, this paper presents a new technique for representing the relationships among the internal components of a combinational circuit. This technique proves to be a powerful tool for redesign, capable of representing internal Boolean relationships in a fully or partially specified multiple-output combinational circuit with a single data structure.
| Original language | American English |
|---|---|
| Title of host publication | Proceedings Ninth Great Lakes Symposium on VLSI |
| Publisher | IEEE |
| Pages | 184-187 |
| Number of pages | 4 |
| ISBN (Print) | 0-7695-0104-4 |
| DOIs | |
| State | Published - Aug 6 2002 |
| Event | Proceedings of the 1999 9th Great Lakes Symposium on VLSI (GLSVLSI '99) - Ann Arbor, MI, USA Duration: Mar 4 1999 → Mar 6 1999 |
Conference
| Conference | Proceedings of the 1999 9th Great Lakes Symposium on VLSI (GLSVLSI '99) |
|---|---|
| City | Ann Arbor, MI, USA |
| Period | 3/4/99 → 3/6/99 |
ASJC Scopus Subject Areas
- Electrical and Electronic Engineering
Keywords
- Logic design
- Design automation
- Computer science
- Data structures
- Boolean functions
- Binary decision diagrams
- Desgin engineering
- Digital circuits
- Process design
- Documenation
Disciplines
- Computational Engineering
- Computer Engineering
- Databases and Information Systems
- Data Science