Layout driven synthesis of multiple scan chains.

Layout driven synthesis of multiple scan chains.

In this paper, we investigate the problem of assigning scan cells to multiple scan chains based on physical placement. We formulate a new multichain assignment (MA) problem and discuss its complexity and relationship to partitioning and traveling salesman problems. We show that MA is not adequately...

תיאור מלא

מידע ביבליוגרפי
הוצא לאור ב:IEEE Transactions on computer-aided design of integrated circuits and systems 22, 3 (2003).
מחבר ראשי: Rahimi, K.
פורמט: Article
שפה:English
נושאים:
DFT technique.
Complexity.
Connectivity overhead minimization.
Design for testability.
Graph partitioning.
Layout driven synthesis.
Multichain assignment problem.
Multiple scan chains.
Optimal chain configurations.
Partitioning-based methods.
Physical placement.
Scan cell assignment.
Stable marriage problems.