Combinatorial optimization
Paths, Flows, and VLSI-Layout
Algorithms for VLSI Design Automation
Algorithms for VLSI Design Automation
Synthesis of Scan Chains for Netlist Descriptions at RT-Level
Journal of Electronic Testing: Theory and Applications
Inserting Scan at the Behavioral Level
IEEE Design & Test
H-SCAN+: A Practical Low-Overhead RTL Design-for-Testability Technique for Industrial Designs
Proceedings of the IEEE International Test Conference
A new approach to scan chain reordering using physical design information
ITC '98 Proceedings of the 1998 IEEE International Test Conference
A layout-based approach for ordering scan chain flip-flops
ITC '98 Proceedings of the 1998 IEEE International Test Conference
VIUF '97 Proceedings of the 1997 VHDL International User's Forum (VIUF '97)
VTS '96 Proceedings of the 14th IEEE VLSI Test Symposium
High-Level Synthesis for Orthogonal Scan
VTS '97 Proceedings of the 15th IEEE VLSI Test Symposium
An Efficient Linear Time Algorithm for Scan Chain Optimization and Repartitioning
ITC '02 Proceedings of the 2002 IEEE International Test Conference
Routing-aware scan chain ordering
ACM Transactions on Design Automation of Electronic Systems (TODAES)
System-on-Chip Test Architectures: Nanometer Design for Testability
System-on-Chip Test Architectures: Nanometer Design for Testability
A Global Optimization for Scan Chain Insertion at the RT-level
ISVLSI '11 Proceedings of the 2011 IEEE Computer Society Annual Symposium on VLSI
An Innovative Methodology for Scan Chain Insertion and Analysis at RTL
ATS '11 Proceedings of the 2011 Asian Test Symposium
Layout-aware scan chain synthesis for improved path delay fault coverage
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Hi-index | 0.00 |
The scan chain insertion problem is one of the mandatory logic insertion design tasks. The scanning of designs is a very efficient way of improving their testability. But it does impact size and performance, depending on the stitching ordering of the scan chain. In this paper, we propose a graph-based approach to a stitching algorithm for automatic and optimal scan chain insertion at the RTL. Our method is divided into two main steps. The first one builds graph models for inferring logical proximity information from the design, and then the second one uses classic approximation algorithms for the traveling salesman problem to determine the best scan-stitching ordering. We show how this algorithm allows the decrease of the cost of both scan analysis and implementation, by measuring total wirelength on placed and routed benchmark designs, both academic and industrial.