Reducing Embedded SRAM Test Time under Redundancy Constraints

  • Authors:
  • Baosheng Wang;Josh Yang;James Cicalo;André Ivanov;Yervant Zorian

  • Affiliations:
  • -;-;-;-;-

  • Venue:
  • VTS '04 Proceedings of the 22nd IEEE VLSI Test Symposium
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Increasingly dense SRAMs of various bit capacities,embedded within current and future Systems-on-a-Chip(SoC) designs, command not only additional complexitydue to required redundancy schemes, but also presentserious challenges in regards to testing. In particular, thetime needed for testing data retention faults (DRFs) andNon-DRFs is growing rapidly. In this paper, we considerthe Overall Production Gain (OPG) and delay timeassociated with the testing of DRFs as the two selectionfactors for classifying embedded SRAMs, where OPGquantifies the trade-offs between yield and redundancyarea overhead. These embedded SRAMs are categorizedinto four categories for testing Non-DRFs and DRFs.Since both factors above are related to memory capacity,the four categories are named as very small, small, large,and very large types. According to this simpleclassification, we generate a set of four March testalgorithms from an existing March SRD algorithm foreach category respectively. As a comparison with MarchSRD, our investigations reveal that test time can generallybe at least halved down to 22nm technology for allcapacity e-SRAMs with different IO numbers withoutlosing defect coverage. The evaluation results also showthat this reduction ratio is always no less than 50% forthose with larger and larger and larger capacitypredicted for future e-SRAMs in ITRS documents nomatter what complex the comparison algorithms besidesMarch SRD are.