The invention relates to a built-in-self-test (BIST) engine and, more particularly, to a BIST engine configured to store a per pattern based fail status during memory BIST run and related processes thereof.
Memory BIST (built-in self-test) is an important tool for testing memories (including finding/diagnosing and repairing defects within those memories). As more memory is integrated into chips, thorough BIST test and repair is a requirement in order to ensure reasonable product quality/reliability levels. To improve BIST quality oftentimes more test patterns are run as part of manufacturing test. Total test time can take many millions of cycles when all necessary test patterns are included.
Memory BIST is designed to operate as many memories as possible simultaneously, while still avoiding false failures due to over test. False failures may be due to exceeding the power specification for a certain chip design, amongst other fail modes. For a given chip design, this might be a small subset, whereas for other chip designs this could include virtually all memories. In addition, memory BIST should be able to test with some margin compared to the normal functional application in order to produce good SPQL (shipped product quality level) while minimizing impacts to yield. Also, high quality memory test and repair via extremely thorough test needs to be balanced against test time. Test time can be a major cost component of chips (sometimes reaching into the multi-minute range).
During manufacturing test, the BIST engine executes multiple test patterns to test the connected memories. If a fail is detected during the execution of a pattern, the fail information is collected by the BIST engine. If more fails are detected in any of the subsequent patterns, the new fail information is accumulated with the old fail information in the BIST engine. At the end of the test, the BIST has the information whether any of the memories associated with it has failed. But, it is not possible in such methodologies to know the distribution of fails on a per-pattern basis.
In an aspect of the invention, a method comprises testing a plurality of patterns in at least one memory device and determining which of the plurality of patterns has detected a fail during execution of each pattern. The method further comprises storing a per pattern based fail status of each of the detected failed patterns.
In an aspect of the invention, a method comprises reusing a pattern mask register of a BIST engine to store fail information at a bit location for a pattern that detected a fail.
In an aspect of the invention, a method comprises: issuing an execution command to a BIST engine to run patterns which are not masked by a pattern mask register; enabling the pattern mask register for data collection; after completion of the pattern, determining whether there is a FAIL for the tested pattern and, if so, enable FAIL collection; and updating a corresponding pattern bit in the pattern mask register, which will store the pattern that caught a FAIL.
The present invention is described in the detailed description which follows, in reference to the noted plurality of drawings by way of non-limiting examples of exemplary embodiments of the present invention.
The invention relates to a built-in-self-test (BIST) engine and, more particularly, to a BIST engine configured to store a per pattern based fail status during memory BIST run and related processes thereof. In more specific embodiments, a pattern mask register can be re-used to store test results of individual test patterns that have completed diagnostics. In this way, it is possible to generate and access test pass/fail results for particular patterns from a BIST system used to test memory devices.
By implementing the present invention, e.g., providing a structure and method to collect the failure information on per-pattern basis using the existing resources of the BIST engine, it is now possible to know which patterns fail in which Process-Voltage-Temperature (PVT) corner so that the test flow can be optimized to run patterns which are detecting fails in different PVT corners. Moreover, if, in a particular PVT corner, it is observed that the fails are being detected by only a few handful patterns out of the whole pattern suite then, by implementing the systems and processes described herein, the test flow can be optimized to exclude the patterns, which are not detecting any fails, from executing. Also, if it is observed that across PVT corners only a subset of patterns are capturing the fails, then the test flow can be updated accordingly to include only those patterns for execution. Additionally, if a given pattern does find fails but does not find any unique fails (a fail that does not fail any other pattern), then it would be possible to disable that pattern, as all fails found by that pattern will still be found by some other pattern.
In more specific embodiments, the BIST engine contains a pattern mask register where each bit corresponds to a pattern in a pattern suite. When a bit corresponding to a particular pattern is set to ‘1’ in the pattern mask register, the pattern is “masked” and is skipped during the BIST execution. However, when a fail is reported during the execution of a pattern, the pattern mask register is re-used to capture the fail information, e.g., the fail information can be stored at the bit location for the pattern. For example, during the execution of a test pattern, if a fail is detected then a single bit “fail status” register is set to ‘1’. After the execution of the pattern, the value of the fail status register is written to the particular bit in the pattern mask register which corresponds to the current pattern. Thus, the pattern mask register bits are re-used to capture the fail information. At the end of the BIST run, the pattern mask register is read out to determine which patterns have detected a fail. For example, a bit in the pattern mask register set to ‘1’ implies that the corresponding pattern has detected a fail, whereas a value of ‘0’ implies that no fails were detected during the execution of the particular pattern. A value of ‘0’ can also imply that the pattern was masked.
The demultiplexer 120 is a device which takes a single input signal, e.g., a FAIL (‘1’) and selects one of many data-output-lines for populating respective bit locations of the pattern mask register 122. In embodiments, the demultiplexer 120 is controlled by an FSM (finite state machine) 118. For example, the FSM 118 will instruct the demultiplexer 120 to input a ‘1’ (FAIL) or a ‘0’ (PASS) into a certain location in the pattern mask register 122, where each bit will represent a PASS/FAIL indication corresponding to a particular pattern in the pattern suite (e.g., pattern mask register) as shown in the example of
In operation, a FAIL (‘1’) of any memory (SBIO) will be passed through OR gate 110 to the fail status register 112. The FAIL (‘1’) will feed back to AND gate 114 of the logic 105 until the pattern is complete, such that when a fail is captured into the fail status register it will stay there until the end of the pattern (i.e. a “sticky latch”), at which time AND gates 114, 116 will be brought to ‘0’, e.g., deactivated, so that a FAIL (‘1’) will no longer be stored in the fail status register 112. In parallel with this, the FAIL (‘1’) will be moved into a bit position in the pattern mask register, which corresponds to the pattern that was just completed. In this way, when a FAIL is detected during the execution of a pattern, the fail status register 112 is set to ‘1’ and this ‘1’ stays in the fail status register until the completion of the pattern. At the end of the pattern, the value of the fail status register 112 is written into the bit of the pattern mask register (e.g., control register) 122 by demultiplexer 120, wherein the location corresponds to the current pattern being executed. In embodiments, the FSM 118 will instruct the demultiplexer 120 to input a ‘1’ (FAIL) into a certain location in the pattern mask register 122, where each bit will correspond to a particular failed pattern in the pattern suite (e.g., pattern mask register) as shown in the example of
At the end of the BIST run, when all patterns have been executed, the pattern mask register 122 will have only those bits set to ‘1’, for which their corresponding patterns have detected a fail. Thus, at the end of the BIST run, reading out the pattern mask register 122 will provide the fail status on a per pattern basis. In embodiments, the failing pattern information can be shifted out of the pattern mask register 122 using an existing shuttle register interface.
Referring now to
At step 305, a determination is made as to whether the pattern is enabled; in other words, a determination is made as to whether the pattern is masked, in which case the pattern is skipped during the BIST execution. If the pattern is masked, then the processes proceed to the next pattern, at step 310. By way of example, a pattern has been masked in the pattern mask register 122 with a value of ‘1’ in its corresponding bit. It should also be noted that while the BIST engine 100 skips the pattern, the corresponding bit in the pattern mask register will be set to ‘0’.
If the pattern is not masked, then the processes proceed to step 315. At step 315, the pattern is run. After completion of the pattern, the processes continue to step 320, where a determination is made as to whether there is a FAIL for the tested pattern and, if so, the FAIL collection is enabled. Accordingly, when a FAIL is seen in a particular pattern of an SBIO, this information is sent to the corresponding BIST engine where it is latched and stored in the pattern mask register 22, at step 325. Thus, at the end of each pattern the particular FAIL information is used to update the corresponding pattern bit in the pattern mask register, which will store the fact that that the particular pattern caught a FAIL. The fail status latch is then reset to “0” prior to moving to the next pattern. This happens in all BIST engine instances where a fail is discovered.
At step 330, a determination is made as to whether all of the patterns have been completed, e.g., tested. At the end of the total BIST run, when all the unmasked patterns for all BIST instances have been executed, the failing pattern information, now stored in the pattern mask registers of each BIST, can be shifted from the BIST engines out to the tester using a BIST shuttle readout register, at step 335. At step 340, the process can analyze the data to determine which patterns have failed.
In embodiments, prior to the next BIST run, the pattern mask registers for all BIST instances are re-programmed in order to select which patterns would be masked for the next BIST run. Alternatively, it may be advantageous to not re-program the mask register, and let the failing pattern data for the previous BIST run(s) dictate which patterns would be masked for the remaining BIST run(s). This allows a mechanism to let the logic circuit decide which patterns to disable based upon previous BIST failing pattern data, without needing to analyze this externally (outside the test environment). In this way, the next BIST run would only focus on running patterns which have not yet failed. At the end of a bunch of BIST runs, it would be simple to now read out which patterns have never failed across the multiple BIST runs.
As should now be understood, the collected information can help in faster debug/verification. For example, in known systems in order to determine which patterns had failed, it would be necessary to mask all but one pattern at a time for each test. Once all of the tests are completed for all of the unmasked patterns, it would then be possible to determine which patterns failed, as only one pattern per test would be executed. This is very time consuming and programming intensive for test pattern generation. In comparison, the processes of the present invention can run tests on all patterns, store the failure in the pattern mask register and the read out all of the failures therefrom.
In this way, it is possible to speed up the debug process during initial hardware bring-up. It is also possible to more quickly isolate problem areas in the array and design experiments faster, with more precise target to isolate possible root causes. For example, a pattern that is intended to test for row-to-row short circuiting, might show up as failing quite often, and can help steer the failure analysis team to look for a short circuiting defect in a certain part of the circuit. This feature is useful for obtaining failing pattern information across all parts during standard production test and thus helps in creating a statistical data of the pattern effectiveness and thus can help to optimize the manufacturing test flow, by allowing the intelligent disablement of certain patterns, which are shown to very rarely, if ever, catch a unique fail (e.g., a fail that is only caught by that one pattern).
The processes and systems described herein are also useful in eliminating the need for testing patterns, where there is no unique fail found for the particular pattern. For example, if a same fail is found for several patterns, it can be implied that the fail is not unique to any single pattern. By determining that the fail is not unique to any particular pattern, some patterns can be now skipped or masked effectively increasing test speed and efficiency.
The structure(s) as described above is used in integrated circuit chips. The resulting integrated circuit chips can be distributed by the fabricator in raw wafer form (that is, as a single wafer that has multiple unpackaged chips), as a bare die, or in a packaged form. In the latter case the chip is mounted in a single chip package (such as a plastic carrier, with leads that are affixed to a motherboard or other higher level carrier) or in a multichip package (such as a ceramic carrier that has either or both surface interconnections or buried interconnections). In any case the chip is then integrated with other chips, discrete circuit elements, and/or other signal processing devices as part of either (a) an intermediate product, such as a motherboard, or (b) an end product. The end product can be any product that includes integrated circuit chips, ranging from toys and other low-end applications to advanced computer products having a display, a keyboard or other input device, and a central processor.
The descriptions of the various embodiments of the present invention have been presented for purposes of illustration, but are not intended to be exhaustive or limited to the embodiments disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the described embodiments. The terminology used herein was chosen to best explain the principles of the embodiments, the practical application or technical improvement over technologies found in the marketplace, or to enable others of ordinary skill in the art to understand the embodiments disclosed herein.
Number | Name | Date | Kind |
---|---|---|---|
5717701 | Angelotti | Feb 1998 | A |
5825782 | Roohparvar | Oct 1998 | A |
6061813 | Goishi | May 2000 | A |
6138257 | Wada et al. | Oct 2000 | A |
6175529 | Otsuka et al. | Jan 2001 | B1 |
6530052 | Khou et al. | Mar 2003 | B1 |
6560740 | Zuraski, Jr. et al. | May 2003 | B1 |
6587982 | Lee et al. | Jul 2003 | B1 |
6615378 | Dwork | Sep 2003 | B1 |
7137049 | Hoffmann et al. | Nov 2006 | B2 |
7188289 | Nakamura | Mar 2007 | B2 |
7370251 | Nadeau-Dostie et al. | May 2008 | B2 |
7523370 | Keller | Apr 2009 | B1 |
7610537 | Dickinson | Oct 2009 | B2 |
7865788 | Burlison et al. | Jan 2011 | B2 |
8037376 | Anzou et al. | Oct 2011 | B2 |
8086925 | Gass et al. | Dec 2011 | B2 |
8280687 | Cheng et al. | Oct 2012 | B2 |
8639994 | Chen et al. | Jan 2014 | B2 |
8904256 | Chakravadhanula et al. | Dec 2014 | B1 |
8914688 | Belansek et al. | Dec 2014 | B2 |
9448282 | Meehl | Sep 2016 | B1 |
9881694 | Busi et al. | Jan 2018 | B2 |
20030074619 | Dorsey | Apr 2003 | A1 |
20060282732 | Kiryu | Dec 2006 | A1 |
20070234157 | Rajski et al. | Oct 2007 | A1 |
20070288821 | Matsuo et al. | Dec 2007 | A1 |
20140258797 | Gorman et al. | Sep 2014 | A1 |
20150124537 | Anzou et al. | May 2015 | A1 |
20170018313 | Busi et al. | Jan 2017 | A1 |
20170229191 | Ouellette et al. | Aug 2017 | A1 |
20180053566 | Busi et al. | Feb 2018 | A1 |
20180061509 | Busi et al. | Mar 2018 | A1 |
Number | Date | Country |
---|---|---|
2009039316 | Mar 2009 | WO |
Entry |
---|
Akrout C., Mifsud, J. P. & Rapoport, S. “Multi-Scan Array Built-In, Self-Test with Result/Fail Bits”, IPCOM000105297D, 1993, 36(7), 3 pages. |
List of IBM Patents or Patent Applications Treated as Related, Aug. 22, 2019, 1 page. |
Specification “Built-In Self-Test (BIST) Engine Configured to Store a Per Pattern Based Fail Status in a Pattern Mask Register” and drawings in related U.S. Appl. No. 15/798,858, filed Oct. 31, 2017, 17 pages. |
List of IBM Patents or Patent Applications Treated as Related, dated Dec. 6, 2019, 1 page. |
Specification “Built-In Self-Test (BIST) Engine Configured to Store a Per Pattern Based Fail Status in a Pattern Mask Register” and Drawings in U.S. Appl. No. 16/675,783, filed Nov. 6, 2019, 18 pages. |
Notice of Allowance issued in related U.S. Appl. No. 15/798,858 dated Sep. 25, 2019, 9 pages. |
Notice of Allowance dated Feb. 21, 2020 in related U.S. Appl. No. 15/801,444, 9 pages. |
Number | Date | Country | |
---|---|---|---|
20190378587 A1 | Dec 2019 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 15798858 | Oct 2017 | US |
Child | 16548246 | US | |
Parent | 14800067 | Jul 2015 | US |
Child | 15798858 | US |