Behavioral synthesis for easy testability in data path scheduling
- 1 January 1992
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
A data path scheduling algorithm to improve testability without assuming any particular test strategy is presented. A scheduling heuristic for easy testability, based on previous work on data path allocation for testability, is introduced. A mobility path scheduling algorithm to implement this heuristic while also minimizing area is developed. Experimental results on benchmark and example circuits show high fault coverage, short test generation time, and little or no area overhead.<>Keywords
This publication has 13 references indexed in Scilit:
- Rescheduling transformations for high level synthesisPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Test generation for highly sequential circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Data path allocation using an extended binding modelPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Sequential circuit design using synthesis and optimizationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Incorporating testability considerations in high-level synthesisPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Behavioral synthesis of testable systems with VHDLPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Synthesis of testable finite state machinesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- High-Level VLSI SynthesisPublished by Springer Nature ,1991
- A data path synthesis method for self-testable designsPublished by Association for Computing Machinery (ACM) ,1991
- The high-level synthesis of digital systemsProceedings of the IEEE, 1990