메뉴 건너뛰기




Volumn , Issue , 2007, Pages 492-497

A reduced complexity algorithm for minimizing N-detect tests

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING LANGUAGES; DYNAMIC PROGRAMMING; INTEGER PROGRAMMING; INTEGRATED CIRCUITS; LINEARIZATION; NUMBER THEORY; PARTICLE SIZE ANALYSIS; RECURSIVE FUNCTIONS; TESTING; TREES (MATHEMATICS);

EID: 48349137675     PISSN: 10639667     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/VLSID.2007.24     Document Type: Conference Paper
Times cited : (12)

References (22)
  • 1
    • 0023564782 scopus 로고
    • On the Role of Independent Fault Sets in the Generation of Minimal Test Sets
    • S. B. Akers, C. Joseph, and B. Krishnamurthy, "On the Role of Independent Fault Sets in the Generation of Minimal Test Sets," in Proc. International Test Conf., 1987, pp. 1100-1107.
    • (1987) Proc. International Test Conf , pp. 1100-1107
    • Akers, S.B.1    Joseph, C.2    Krishnamurthy, B.3
  • 2
  • 4
    • 0345413237 scopus 로고    scopus 로고
    • Independent Test Sequence Compaction through Integer Programming
    • P. Drineas and Y. Makris, "Independent Test Sequence Compaction through Integer Programming," in Proc. International Conf. Computer Design, 2003, pp. 380-386.
    • (2003) Proc. International Conf. Computer Design , pp. 380-386
    • Drineas, P.1    Makris, Y.2
  • 5
    • 48349122382 scopus 로고    scopus 로고
    • An Analysis of Defect Detection and Site Observation Counts for Weighted Random Patterns and Compact Test Pattern Sets
    • J. Dworak, "An Analysis of Defect Detection and Site Observation Counts for Weighted Random Patterns and Compact Test Pattern Sets," in Proc. North Atlantic Test Workshop, 2006, pp. 183-190.
    • (2006) Proc. North Atlantic Test Workshop , pp. 183-190
    • Dworak, J.1
  • 10
    • 0034251319 scopus 로고    scopus 로고
    • Test Set Compaction Algorithms for Combinational Circuits
    • Aug
    • I. Hamzaoglu and J. H. Patel, "Test Set Compaction Algorithms for Combinational Circuits," IEEE Trans. on CAD, vol. 19, no. 8, pp. 957-963, Aug. 2000.
    • (2000) IEEE Trans. on CAD , vol.19 , Issue.8 , pp. 957-963
    • Hamzaoglu, I.1    Patel, J.H.2
  • 11
    • 0030261541 scopus 로고    scopus 로고
    • An Optimal Test Compression Procedure for Combinational Circuits
    • oct
    • D. S. Hochbaum, "An Optimal Test Compression Procedure for Combinational Circuits," IEEE Trans. Computer-Aided Design, vol. 15, no. 10, pp. 1294-1299, oct 1996.
    • (1996) IEEE Trans. Computer-Aided Design , vol.15 , Issue.10 , pp. 1294-1299
    • Hochbaum, D.S.1
  • 13
  • 15
    • 48349109003 scopus 로고    scopus 로고
    • H. K. Lee and D. S. Ha, On the Generation of Test Patterns for Combinational Circuits, Tech. Report 12-93, Dept. of Elec. Eng., Virginia Poly. Inst, and St. Univ., Blacksburg, Virginia, 1993.
    • H. K. Lee and D. S. Ha, "On the Generation of Test Patterns for Combinational Circuits," Tech. Report 12-93, Dept. of Elec. Eng., Virginia Poly. Inst, and St. Univ., Blacksburg, Virginia, 1993.
  • 19
    • 33847171817 scopus 로고    scopus 로고
    • Forming N-Detection Test Sets from One-Detection Test Sets Without Test Generation
    • I. Pomeranz and S. M. Reddy, "Forming N-Detection Test Sets from One-Detection Test Sets Without Test Generation," in Proc. International Test Conf., 2005, pp. 527-535.
    • (2005) Proc. International Test Conf , pp. 527-535
    • Pomeranz, I.1    Reddy, S.M.2
  • 20
    • 51249173817 scopus 로고
    • Randomized Rounding: A Technique for Provably Good Algorithms and Algorithmic Proofs
    • P. Raghavan and C. D. Thompson, "Randomized Rounding: A Technique for Provably Good Algorithms and Algorithmic Proofs," Combinatorial, vol. 7, no. 4, pp. 365-374, 1987.
    • (1987) Combinatorial , vol.7 , Issue.4 , pp. 365-374
    • Raghavan, P.1    Thompson, C.D.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.