An efficient linear time algorithm for scan chain optimization and repartitioning

IEEE International Test Conference (TC)

Volumn , Issue , 2002, Pages 781-787

  Berthelot, David ^a   Chaudhuri, Samit ^a   Savoj, Hamid ^a  

^a MAGMA DESIGN AUTOMATION   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; FLIP FLOP CIRCUITS; HEURISTIC METHODS; ITERATIVE METHODS; POLYNOMIALS; TRAVELING SALESMAN PROBLEM;

LINEAR TIME ALGORITHM; REPARTITIONING ALGORITHM; SCAN CHAIN OPTIMIZATION; SCAN FLIP-FLOPS;

LOGIC DESIGN;

EID: 0036443195     PISSN: 10893539     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEST.2002.1041831     Document Type: Article

References (7)

1. S. Barbagallo, M. Lobetti Bodoni, D. Medina, F. Corno, P. Prinetto and M. Sonza Reorda, "Scan Insertion Criteria for Low Design Impact", 14th VLSI Test Symposium 1996, pp. 25-31.
2. Kenneth D. Boese, Andrew B. Kahng and Ren-Song Tsay, "Scan Chain Optimization: Heuristic and Optimal Solutions", unpublished. http://nexus6.cs.ucla.edu/˜boese/research.html.
3. Jill Cirasella, David S. Johnson, Lyle A. McGeoch and Wixiong Zhang, "The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests", ALANEX 2001.
4. M.R. Gary and D. S. Johnson, "Computers and intractability: A Guide to the Theory of NP-completeness", Freeman, 1979.
5. Mokhtar Hirech, James Beausang and Xinli Gu, "A New Approach to Scan Chain Reordering Using Physical Design Information", International Test Conference 1998, pp. 348-355.
6. Susumu Kobayashi, Masato Edahiro and Mikio Kubo, "A VLSI Scan-Chain Optimization Algorithm for multiple scan paths", IEICE Trans. Fundamentals, Vol.E82, No. 11, Nov. 1999, pp. 2499-2504.
7. K.-H. Lin, C.S. Chen and T.-T Hwang, "Layout-driven chaining of scan flip-flops", IEE Proc.-Comput. Digit. Tech., Vol. 143, No. 6, Nov. 1996, pp. 421-425.