Digest of Papers Eleventh Annual 1993 IEEE VLSI Test Symposium
DOI: 10.1109/vtest.1993.313337
|View full text |Cite
|
Sign up to set email alerts
|

Generation of testable designs from behavioral descriptions using high level synthesis tools

Abstract: This paper develops a synthesis-for-testability procedure wherein behavioral modeling techniques are used to generate testable designs. Knowledge about the accessibility of embedded modules is extracted from the behavioral design, analyzed, and any modification required subsequently incorporated in the behavioral design. Results show that when the resulting testable circuit is synthesized from this modified design using a high level synthesis tool, the overhead for testability is quite small, especially for la… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
0
0

Publication Types

Select...
2
1
1

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 13 publications
(5 reference statements)
0
0
0
Order By: Relevance
“…An unconstrained scheduling problem tries to find the minimum (optimum) value for the execution latency (Wong, Potkonjak, & Dey, 2004) (i.e., the minimum number of clock cycles to perform all the operations in a given behavioral description). Note that the execution latency of the entire circuit is equal to the sum of the execution delays of the operations in the longest path from source vertex to sink vertex in a given DFG (Varma, Vishakantaiah, & Abraham, 1993). This longest path is called as critical path in the graph.…”
Section: Unconstrained Scheduling Problemmentioning
confidence: 99%
“…An unconstrained scheduling problem tries to find the minimum (optimum) value for the execution latency (Wong, Potkonjak, & Dey, 2004) (i.e., the minimum number of clock cycles to perform all the operations in a given behavioral description). Note that the execution latency of the entire circuit is equal to the sum of the execution delays of the operations in the longest path from source vertex to sink vertex in a given DFG (Varma, Vishakantaiah, & Abraham, 1993). This longest path is called as critical path in the graph.…”
Section: Unconstrained Scheduling Problemmentioning
confidence: 99%