Abstract
Existing conditional resource sharing methods used in behavioral synthesis focus on area and performance optimization and do not consider testability. This paper extends our previous work to handle conditional branches. A hierarchical control-data flow graph (HCDFG) is used to model the system behavior. A postorder traversal of the HCDFG is employed to reduce sequential depths and loops for testability synthesis. Experimental results for the benchmarks show that our method, with no a priori test strategy assumption, can achieve higher fault coverage in shorter test generation time than an algorithm which disregards testability, and, with partial scan test assumption, can have high testability with fewer scan registers than some design-for-test methods.
Original language | English (US) |
---|---|
Title of host publication | Proceedings of the International Test Conference |
Editors | Anon |
Publisher | Publ by IEEE |
Pages | 744-753 |
Number of pages | 10 |
ISBN (Print) | 0780314298 |
State | Published - Dec 1 1993 |
Event | Proceedings of the 24th IEEE International Test Conference - Baltimore, MD, USA Duration: Oct 17 1993 → Oct 21 1993 |
Other
Other | Proceedings of the 24th IEEE International Test Conference |
---|---|
City | Baltimore, MD, USA |
Period | 10/17/93 → 10/21/93 |
All Science Journal Classification (ASJC) codes
- Engineering(all)