On configuring scan trees to reduce scan shifts based on a circuit structure
暂无分享,去创建一个
[1] Kozo Kinoshita,et al. Reducing scan shifts using folding scan trees , 2003, 2003 Test Symposium.
[2] Janak H. Patel,et al. Reducing test application time for full scan embedded cores , 1999, Digest of Papers. Twenty-Ninth Annual International Symposium on Fault-Tolerant Computing (Cat. No.99CB36352).
[3] S. K. Gupta,et al. Efficient BIST TPG design and test set compaction for delay testing via input reduction , 1998, Proceedings International Conference on Computer Design. VLSI in Computers and Processors (Cat. No.98CB36273).
[4] Irith Pomeranz,et al. On test data volume reduction for multiple scan chain designs , 2003, TODE.
[5] Sandeep K. Gupta,et al. Efficient BIST TPG design and test set compaction via input reduction , 1998, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[6] Huaguo Liang,et al. A mixed mode BIST scheme based on reseeding of folding counters , 2000, Proceedings International Test Conference 2000 (IEEE Cat. No.00CH37159).
[7] Jia-Guang Sun,et al. A cost-effective scan architecture for scan testing with non-scan test power and test application cost , 2003, DAC '03.
[8] Kohei Miyase,et al. Optimal scan tree construction with test vector modification for test compression , 2003, 2003 Test Symposium.
[9] Irith Pomeranz,et al. Cost-Effective Generation of Minimal Test Sets for Stuck-at Faults in Combinational Logic Circuits , 1993, 30th ACM/IEEE Design Automation Conference.
[10] S. Samaranayake,et al. Dynamic Scan: Driving Down the Cost of Test , 2002, Computer.
[11] Wen-Ben Jone,et al. A tree-structured LFSR synthesis scheme for pseudo-exhaustive testing of VLSI circuits , 1998, Proceedings International Test Conference 1998 (IEEE Cat. No.98CH36270).
[12] Wen-Ben Jone,et al. Tree-structured LFSR synthesis scheme for pseudo-exhaustive testing of VLSI circuits , 2000 .