Publication | Closed Access
Scan-chain optimization algorithms for multiple scan-paths
10
Citations
6
References
2002
Year
Unknown Venue
Mathematical ProgrammingEngineeringLocal Search (Optimization)Simulated AnnealingMultiple-scan Design MethodologyScan-chain Optimization ProblemAlgorithm FrameworkComputer EngineeringComputational ComplexityComputer ScienceParallel ComputingCombinatorial OptimizationComputational GeometryTabu SearchParallel MetaheuristicsVariable Neighborhood SearchScan-chain Optimization AlgorithmsOperations Research
This paper presents an algorithm framework for the scan-chain optimization problem in multiple-scan design methodology. It also presents algorithms we propose based on the framework; these are the first algorithms ever proposed for multiple-scan designing. Experiments using actual design data show that, for ten scan-paths, our algorithms achieved a 90% reduction in scan-test time at the expense of a 7% total scan-path length increase as compared with the length of a single optimized scan-path.
| Year | Citations | |
|---|---|---|
Page 1
Page 1