Incorporating testability considerations in high-level synthesis
- 2 January 2003
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
The authors propose an algorithm for module and register binding which generates register-transfer-level (RTL) designs having low testability cost. They also present an algorithm for altering the register and module binding to reduce testability overhead in the final design. These algorithms were coded and several experiments were conducted to check their performance. The results of these experiments are described. The study shows that the designs produced by the method in almost all the cases have reduced testability overhead.Keywords
This publication has 10 references indexed in Scilit:
- ALLOCATION AND ASSIGNMENT IN HIGH-LEVEL SYNTHESIS FOR SELF-TESTABLE DATA PATHSPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- SYNTEST: a method for high-level SYNthesis with self-TESTabilityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- An analytical approach to the partial scan problemJournal of Electronic Testing, 1990
- A partial scan method for sequential circuits with feedbackIEEE Transactions on Computers, 1990
- The Ballast methodology for structured partial scan designIEEE Transactions on Computers, 1990
- The high-level synthesis of digital systemsProceedings of the IEEE, 1990
- Force-directed scheduling for the behavioral synthesis of ASICsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1989
- Integration of algorithmic VLSI synthesis with testability incorporationIEEE Journal of Solid-State Circuits, 1989
- Automated Synthesis of Data Paths in Digital SystemsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1986
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970