• DocumentCode
    1715555
  • Title

    An algorithm to test reconfigured RAMs

  • Author

    Franklin, Manoj ; Saluja, Kewal K.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Clemson Univ., SC, USA
  • fYear
    1994
  • Firstpage
    359
  • Lastpage
    364
  • Abstract
    State-of-the-art RAM chips are invariably reconfigurable. After reconfiguration, the logical neighborhood of the memory cells may no longer be same as the physical neighborhood. Test algorithms used after reconfiguration to detect physical neighborhood faults have to consider that (i) the physical and logical neighborhoods are different and (ii) the address mapping of the reconfigured RAM is no longer available. Another reason for distinct logical and physical neighborhoods is address line scrambling, done to minimize the silicon area and the critical path lengths. We present a test algorithm to detect 5-cell physical neighborhood pattern sensitive faults in reconfigured RAMs and RAMs with scrambled address lines. This algorithm is based on the widely used MSCAN and Marching tests, and requires only O(N upper bound[log2N]) reads and writes to test an N-bit RAM. It also detects other faults such as stuck-at faults, decoder faults, 2-coupling faults, and 3-coupling faults
  • Keywords
    circuit analysis computing; integrated circuit testing; logic testing; random-access storage; reconfigurable architectures; 2-coupling faults; 3-coupling faults; MSCAN test; Marching test; RAM chip testing; address line scrambling; critical path lengths; decoder faults; logical neighborhood; physical neighborhood fault detection; reconfigured RAMs; silicon area minimization; stuck-at faults; Built-in self-test; Circuit faults; Circuit testing; Electrical fault detection; Fault detection; Logic testing; Random access memory; Read-write memory; Redundancy; Silicon;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    VLSI Design, 1994., Proceedings of the Seventh International Conference on
  • Conference_Location
    Calcutta
  • ISSN
    1063-9667
  • Print_ISBN
    0-8186-4990-9
  • Type

    conf

  • DOI
    10.1109/ICVD.1994.282719
  • Filename
    282719