메뉴 건너뛰기




Volumn , Issue , 2004, Pages 306-313

An efficient perfect algorithm for memory repair problems

Author keywords

[No Author keywords available]

Indexed keywords

BINARY DECISION DIAGRAMS (BDD); BIPARTITE GRAPHS; MEMORY REPAIR; SUBGRAPHS;

EID: 24944456894     PISSN: 15505774     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DFTVS.2004.1347853     Document Type: Conference Paper
Times cited : (8)

References (13)
  • 1
    • 0023295915 scopus 로고
    • Efficient spare allocation in reconfigurable arrays
    • Feb
    • S. Y. Kuo, W. K. Fuchs, "Efficient spare allocation in reconfigurable arrays," IEEE Design & Test, Feb 1987, pp. 24-31.
    • (1987) IEEE Design & Test , pp. 24-31
    • Kuo, S.Y.1    Fuchs, W.K.2
  • 2
    • 0025401075 scopus 로고
    • New approaches for the repairs of memories with redundancy by row/column deletion for yield enhancement
    • March
    • W. K. Huang, Y. N. Shen, and F. Lombardi, "New approaches for the repairs of memories with redundancy by row/column deletion for yield enhancement," IEEE Trans. on Computer-Aided Design, March 1990, pp. 323-328.
    • (1990) IEEE Trans. on Computer-aided Design , pp. 323-328
    • Huang, W.K.1    Shen, Y.N.2    Lombardi, F.3
  • 3
    • 0026106043 scopus 로고
    • Increased throughput for the testing and repair of RAMs with redundancy
    • Feb.
    • R. W. Haddad, A. T. Dahbura, and A. B. Sharma, "Increased throughput for the testing and repair of RAMs with redundancy," IEEE Trans. on Computers, Feb. 1991, pp. 154-166.
    • (1991) IEEE Trans. on Computers , pp. 154-166
    • Haddad, R.W.1    Dahbura, A.T.2    Sharma, A.B.3
  • 4
    • 0005458543 scopus 로고    scopus 로고
    • A new class of efficient algorithms for reconfiguration of memory arrays
    • May
    • C. P. Low and H. W. Leong, "A new class of efficient algorithms for reconfiguration of memory arrays," IEEE Trans. on Computers, May 1996, pp. 614-618.
    • (1996) IEEE Trans. on Computers , pp. 614-618
    • Low, C.P.1    Leong, H.W.2
  • 5
    • 0030169112 scopus 로고    scopus 로고
    • Minimum fault coverage in memory arrays: A fast algorithm and probabilistic analysis
    • June
    • C. P. Low and H. W. Leong, "Minimum fault coverage in memory arrays: a fast algorithm and probabilistic analysis," IEEE Trans. on Computer-Aided Design, June 1996, pp. 681-690.
    • (1996) IEEE Trans. on Computer-aided Design , pp. 681-690
    • Low, C.P.1    Leong, H.W.2
  • 6
    • 0027595083 scopus 로고
    • A clustered failure model for the memory array reconfiguration problem
    • May
    • D. M. Blough and A. Pelc, "A clustered failure model for the memory array reconfiguration problem," IEEE Trans. on Computers, May 1993, pp. 518-528.
    • (1993) IEEE Trans. on Computers , pp. 518-528
    • Blough, D.M.1    Pelc, A.2
  • 7
    • 0030166218 scopus 로고    scopus 로고
    • Performance evaluation of a reconfiguration algorithm for memory arrays containing clustered faults
    • June
    • D. M. Blough, "Performance evaluation of a reconfiguration algorithm for memory arrays containing clustered faults," IEEE Trans. on Reliability, June 1996, pp. 274-284.
    • (1996) IEEE Trans. on Reliability , pp. 274-284
    • Blough, D.M.1
  • 8
    • 84942210268 scopus 로고
    • A parallel algorithm for allocation of spare cells on memory chips
    • Aug.
    • N. Funabiki and Y. Takefuji, "A parallel algorithm for allocation of spare cells on memory chips," IEEE Trans. on Reliability, Aug. 1991, pp. 338-346.
    • (1991) IEEE Trans. on Reliability , pp. 338-346
    • Funabiki, N.1    Takefuji, Y.2
  • 9
    • 0026927023 scopus 로고
    • Probabilistic analysis and algorithms for reconfiguration of memory arrays
    • Sep.
    • W. Shi and W. K Fuchs, "Probabilistic analysis and algorithms for reconfiguration of memory arrays," IEEE Trans. on Computer-Aided Design, Sep. 1992, pp. 1153-1160.
    • (1992) IEEE Trans. on Computer-aided Design , pp. 1153-1160
    • Shi, W.1    Fuchs, W.K.2
  • 11
    • 0022769976 scopus 로고
    • Graph-based algorithms for Boolean function manipulation
    • Aug.
    • R. E. Bryant, "Graph-based algorithms for Boolean function manipulation," IEEE Trans. on Computers, Aug. 1986, pp. 677-691.
    • (1986) IEEE Trans. on Computers , pp. 677-691
    • Bryant, R.E.1
  • 13
    • 24944519817 scopus 로고    scopus 로고
    • http://www-2.cs.cmu.edu/afs/cs/project/modck/pub/www/bdd.html.


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