The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.06 - June (2009 vol.58)
pp: 858-864
Fatih Kocan , Southern Methodist University, Dallas
Lun Li , Southern Methodist University, Dallas
Daniel G. Saab , Case Western Reserve University, Cleveland
ABSTRACT
Exact path delay fault (PDF) coverage calculation of large circuits with an exponential number of detectable PDFs requires exponential memory space. This often yields memory overflow in computations. One common approach to avoid memory overflow is to partition or virtually cut circuits into several subcircuits and to perform coverage calculation at the partition-level circuit. Partitioning reduces the number of PDFs to be stored in memory exponentially at the expense of losing considerable coverage. This paper describes an algorithm to improve the reported coverage value by recovering the lost PDFs up to a user-controlled degree (\Delta), which is a function of the length of cut net sequences. The reported coverage monotonically increases as \Delta increases: the exact coverage value is guaranteed when \Delta is equal to the number of consecutive partitions on the longest path. Experimental results are provided for the ISCAS85 circuits that illustrate the trade-off between the computation time, the number of partitions, the values of \Delta, and the reported coverage. The results indicate that as \Delta and the number of partitions increase, the runtime does not increase after some point since the cost of set operations reduces as more partitions are created.
INDEX TERMS
Path delay fault, partitioned circuits, nonenumerative, exact coverage, ZBDD, graph theory.
CITATION
Fatih Kocan, Lun Li, Daniel G. Saab, "Exact Path Delay Fault Coverage Calculation of Partitioned Circuits", IEEE Transactions on Computers, vol.58, no. 6, pp. 858-864, June 2009, doi:10.1109/TC.2008.205
REFERENCES
[1] G.L. Smith, “Model for Delay Faults Based upon Paths,” Proc. Int'l Test Conf. (ITC '85), pp. 342-349, 1985.
[2] S. Padmanaban, M.K. Michael, and S. Tragoudas, “Exact Path Delay Fault Coverage with Fundamental ZBDD Operations,” IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol. 22, no. 3, pp. 305-316, Mar. 2003.
[3] F. Kocan and M.H. Gunes, “On the ZBDD-Based Nonenumerative Path Delay Fault Coverage Calculation,” IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol. 24, no. 7, pp. 1137-1143, July 2005.
[4] F. Kocan, M.H. Gunes, and A. Kurt, “On-Line Pruning of ZBDD for Path Delay Fault Coverage Calculation,” IEICE Trans. Information and Systems, vol. E88-D, no. 7, pp. 1381-1388, 2005.
[5] D. Kagaris and S. Tragoudas, “On the Nonenumerative Path Delay Fault Simulation Problem,” IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol. 21, no. 9, pp. 1095-1101, Sept. 2002.
[6] M.A. Gharabeh, M.L. Bushnell, and V.D. Agrawal, “The Path-Status Graph with Application to Delay Fault Simulation,” IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol. 17, no. 4, pp. 324-332, Apr. 1998.
[7] S. Minato, “Zero-Suppressed BDDs for Set Manipulation in Combinatorial Problems,” Proc. 30th Design Automation Conf. (DAC '93), pp. 272-277, 1993.
[8] I. Pomeranz and S.M. Reddy, “An Efficient Nonenumerative Method to Estimate the Path Delay Fault Coverage in Combinational Circuits,” IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol. 13, no. 2, pp. 240-250, Feb. 1998.
[9] F. Somenzi, “CUDD: CU Decision Diagram Package,” Dept. Electrical and Computer Eng., Univ. of Colorado, Boulder.
[10] A. Mishchenko, “Extra CUDD Package,” Dept. Electrical and Computer Eng., Portland State Univ., 2008.
[11] M.L. Bushnell and V.D. Agrawal, Essentials of Electronic Testing for Digital, Memory, and Mixed-Signal VLSI Circuits. Kluwer Academic Publishers, ISBN: 0-7923-7991-8, 2005.
[12] S. Padmanaban and S. Tragoudas, “Efficient Identification of (Critical) Testable Path Delay Faults Using Decision Diagrams,” IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol. 24, no. 1, pp.77-87, Jan. 2005.
[13] H.C. Wittmann and M. Henftling, “Efficient Path Identification for Delay Testing—Time and Space Optimization,” Proc. European Conf. Design Automation, European Test Conf., and European Event in ASIC Design (EDAC-ETC-EUROASIC '94), pp. 513-517, 1994.
[14] K. Heragu, V.D. Agrawal, M.L. Bushnell, and J.H. Patel, “Improving a Nonenumerative Method to Estimate Path Delay Fault Coverage,” IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol. 16, no. 7, pp. 759-762, July 1997.
[15] S.S. Skiena, The Algorithm Design Manual, first ed. Springer, ISBN-10: 0-3879-4860-0, July 1998.
[16] Fatih Kocan, http://engr.smu.edu/~kocangroup.html, 2008.
17 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool