메뉴 건너뛰기




Volumn 9, Issue 6, 1990, Pages 584-593

Multiple Distributions for Biased Random Test Patterns

Author keywords

biased random patterns; low cost test; multiple weights; Random tests

Indexed keywords

LOGIC CIRCUITS, COMBINATORIAL--COMPUTER AIDED DESIGN; PROBABILITY--RANDOM PROCESSES;

EID: 0025442153     PISSN: 02780070     EISSN: 19374151     Source Type: Journal    
DOI: 10.1109/43.55187     Document Type: Article
Times cited : (68)

References (29)
  • 1
    • 0023208546 scopus 로고
    • Algebraic and structural computation of signal probability and fault detectability in combinational circuits
    • E. J. Aas and M. R. Mercer, “Algebraic and structural computation of signal probability and fault detectability in combinational circuits,” in FTCS-17, Dig. Papers, 1987, pp. 72–77.
    • (1987) FTCS-17, Dig. Papers , pp. 72-77
    • Aas, E.J.1    Mercer, M.R.2
  • 3
    • 0021473471 scopus 로고
    • On the complexity of estimating the size of a test set
    • B. Krishnamurthy and S. B. Akers, “On the complexity of estimating the size of a test set,” IEEE Trans. Comput., vol. C-33, pp. 750–753, 1984.
    • (1984) IEEE Trans. Comput. , vol.C-33 , pp. 750-753
    • Krishnamurthy, B.1    Akers, S.B.2
  • 4
    • 0021606781 scopus 로고
    • Parallel pseudorandom sequences for built-in test
    • P. H. Bardell and W. H. McAnney, “Parallel pseudorandom sequences for built-in test,” in Proc. 1984 Int. Test Conf., 1984, pp. 302–308.
    • (1984) Proc. 1984 Int. Test Conf. , pp. 302-308
    • Bardell, P.H.1    McAnney, W.H.2
  • 8
    • 0022327141 scopus 로고
    • Accelerated ATPG and fault grading via testability analysis
    • June
    • F. Brglez et al., “Accelerated ATPG and fault grading via testability analysis,” in Proc. IEEE Int. Symp. on Circuits and Systems, June 1985.
    • (1985) Proc. IEEE Int. Symp. on Circuits and Systems
    • Brglez, F.1
  • 10
    • 0022913777 scopus 로고
    • On the computation of detection probability for multiple faults
    • S. Chakravarty and H. B. Hunt III, “On the computation of detection probability for multiple faults,” in Proc. 1986 Int. Test Conf., 1986, pp. 252–262.
    • (1986) Proc. 1986 Int. Test Conf. , pp. 252-262
    • Chakravarty, S.1    Hunt, H.B.2
  • 11
    • 0020752337 scopus 로고
    • Random-pattern coverage enhancement and diagnosis for LSSD logic self-test
    • May
    • E. B. Eichelberger and E. Lindbloom, “Random-pattern coverage enhancement and diagnosis for LSSD logic self-test,” IBM J. Res. Develop., vol. 27, no. 3, pp. 265–272, May 1983.
    • (1983) IBM J. Res. Develop. , vol.27 , Issue.3 , pp. 265-272
    • Eichelberger, E.B.1    Lindbloom, E.2
  • 13
    • 0016485480 scopus 로고
    • Polynomially complete fault detection problems
    • O. H. Ibarra and S. K. Sahni, “Polynomially complete fault detection problems,” IEEE Trans. Comput., vol. C-24, 1975.
    • (1975) IEEE Trans. Comput. , vol.C-24
    • Ibarra, O.H.1    Sahni, S.K.2
  • 14
    • 0018809824 scopus 로고
    • Built-in logic block observation techniques
    • B. Koenemann et al., “Built-in logic block observation techniques,” in Proc. Test Conf., 1979, pp. 37–41.
    • (1979) Proc. Test Conf. , pp. 37-41
    • Koenemann, B.1
  • 15
    • 0348022769 scopus 로고
    • Testability-driven random pattern generation
    • R. Lisanke et al., “Testability-driven random pattern generation,” IEEE Trans. Computer-Aided Design, vol. 6, pp. 1082–1087, 1987.
    • (1987) IEEE Trans. Computer-Aided Design , vol.6 , pp. 1082-1087
    • Lisanke, R.1
  • 16
    • 0024137938 scopus 로고
    • A reconvergent fanout analysis for efficient exact fault simulation of combinational circuits
    • Tokyo
    • F. Maamari and J. Rajski, “A reconvergent fanout analysis for efficient exact fault simulation of combinational circuits,” in Proc. FTCS-18, Tokyo, 1988, pp. 122–127.
    • (1988) Proc. FTCS-18 , pp. 122-127
    • Maamari, F.1    Rajski, J.2
  • 17
    • 0024137442 scopus 로고
    • Advanced automatic test pattern generation and redundancy identification techniques
    • Tokyo
    • M. H. Schulz and E. Auth, “Advanced automatic test pattern generation and redundancy identification techniques,” in Proc. FTCS-18, Tokyo, 1988.
    • (1988) Proc. FTCS-18
    • Schulz, M.H.1    Auth, E.2
  • 18
    • 71249136625 scopus 로고
    • Random testing: Practically versus verified effectiveness
    • J. J. Shedletsky, “Random testing: Practically versus verified effectiveness” in Proc. FTCS-7, 1977, pp. 175–179.
    • (1977) Proc. FTCS-7 , pp. 175-179
    • Shedletsky, J.J.1
  • 19
    • 0022614681 scopus 로고
    • An exact analysis for efficient computation of random-pattern testability in combinational circuits
    • S. C. Seth et al., “An exact analysis for efficient computation of random-pattern testability in combinational circuits,” in Proc. FTCS-16, 1986, pp. 318–323.
    • (1986) Proc. FTCS-16 , pp. 318-323
    • Seth, S.C.1
  • 20
    • 0023314406 scopus 로고
    • Pseudorandom testing
    • K. D. Wagner et al., “Pseudorandom testing,” IEEE Trans. Comput., vol. C-36, 1987.
    • (1987) IEEE Trans. Comput. , vol.C-36
    • Wagner, K.D.1
  • 21
    • 0002376728 scopus 로고
    • Fault simulation for structured VLSI
    • Dec.
    • J. A. Waicukauski et al., “Fault simulation for structured VLSI,” VLSI Syst. Design, Dec. 1985.
    • (1985) VLSI Syst. Design
    • Waicukauski, J.A.1
  • 24
    • 85086291587 scopus 로고
    • On Computing organized input probabilities for random tests
    • —, “On Computing organized input probabilities for random tests,” in Proc. 24th Design Automation Conf., 1987.
    • (1987) Proc. 24th Design Automation Conf.
  • 25
    • 0023170014 scopus 로고
    • Seif test using unequiprobable random patterns
    • —, “Seif test using unequiprobable random patterns,” in Int. Symp. on Fault-Tolerant Computing, FTCS-17, 1987, pp. 258–263.
    • (1987) Int. Symp. on Fault-Tolerant Computing , vol.FTCS-17 , pp. 258-263
  • 26
    • 0023535817 scopus 로고
    • The random pattern testability of programmable logic arrays
    • —, “The random pattern testability of programmable logic arrays,” in Proc. IEEE Int. Conf. on Computer Design, ICCD’87, 1987, pp. 682–685.
    • (1987) Proc. IEEE Int. Conf. on Computer Design, ICCD’87 , pp. 682-685


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