Automatically extensible addressing for shared array built-in self-test (ABIST) circuitry
View Patent ↗A method for testing integrated circuits (ICs) by automatically extending addressing for shared array built-in self-test (BIST) circuitry, includes polling a plurality of memories to determine which of the plurality of memories are sharing a first comparison tree and mapping a shared array BIST address space to each of the plurality of memories using the first comparison tree. Additionally, the method includes estimating a shared array BIST completion time corresponding to a most significant bits of a maximum total memory address size under test, reconfiguring the shared array BIST circuitry to accommodate the estimated shared array BIST completion time and testing the plurality of memories sharing the first comparison tree.
1. A method for testing integrated circuits (ICs) by automatically extending addressing for shared array built-in self-test (BIST) circuitry, comprising:
polling a plurality of memories to determine which of the plurality of memories are sharing a first comparison tree;
mapping a shared array BIST address space to each of the plurality of memories using the first comparison tree;
estimating a shared array BIST completion time corresponding to a maximum total memory address size under test;
reconfiguring the shared array BIST circuitry to accommodate the estimated shared array BIST latency/completion time; and
testing the plurality of memories sharing the first comparison tree.
2. The method of claim 1 , wherein:
the polling the plurality of memories comprises:
generating a logical “1” signal at a shared array BIST engine;
reconfiguring a plurality of shared array BIST input/output macros comprising a plurality of random access memory (RAM) enable latches connected to the shared array BIST engine, so that the plurality of RAM enable latches pass the logical “1” signal sequentially through each of the plurality of RAM enable latches; and
propagating the logical “1” signal sequentially through each of the plurality of RAM enable latches; and wherein
the estimating of the shared array BIST completion time comprises counting a number of cycles for the logical “1” signal to return to the shared array BIST engine with a counter, wherein the number of cycles indicates at least one of a most significant bits of a maximum total memory address size under test and a maximum total number of memories sharing the first comparison tree.
3. The method of claim 2 , further comprising configuring the plurality of RAM enable latches into a normal mode for the testing the plurality of memories sharing the first comparison tree.
4. The method of claim 2 , wherein a value contained in the counter after the logical “1” signal returns to the shared array BIST engine is a most significant bits of a maximum address value, and
wherein the reconfiguring the shared array BIST circuitry comprises modifying an address generation operation with the maximum address value such that test address generation is truncated once the maximum address value is reached and the testing the plurality of memories sharing the first comparison tree is run until the maximum address value is reached.
5. The method of claim 1 , wherein the reconfiguring is performed while balancing the sharing of the first comparison tree and total test time required.
6. A system for testing integrated circuits (ICs) by automatically extending addressing for shared array built-in self-test (BIST) circuitry, comprising:
means for polling a plurality of memories to determine which of the plurality of memories are sharing a first comparison tree;
means for mapping a shared array BIST address space to each of the plurality of memories using the first comparison tree;
means for estimating a shared array BIST completion time corresponding to a maximum total memory address size under test;
means for reconfiguring the shared array BIST circuitry to accommodate the estimated shared array BIST completion time; and
means for testing the plurality of memories sharing the first comparison tree, wherein:
the means for polling the plurality of memories comprises:
means for generating a logical “1” signal at a shared array BIST engine;
means for reconfiguring a plurality of shared array BIST input/output macros comprising a plurality of random access memory (RAM) enable latches connected to the shared array BIST engine, so that the plurality of RAM enable latches pass the logical “1” signal sequentially through each of the plurality of RAM enable latches; and
means for propagating the logical “1” signal through each of the plurality of RAM enable latches; and wherein
the means for estimating the shared array BIST completion time comprises means for counting a number of cycles for the logical “1” signal to return to the shared array BIST engine with a counter, wherein the number of cycles indicates at least one of a most significant bits of the maximum total memory address size under test and a maximum total number of memories sharing the first comparison tree.
7. The system of claim 6 , wherein a value contained in the counter after the logical “1” signal returns to the shared array BIST engine is a most significant bits of a maximum address value, and
wherein the means for reconfiguring the shared array BIST circuitry comprises a means for modifying an address generation operation with the maximum address value such that test address generation is truncated once the maximum address value is reached and the means for testing the plurality of memories sharing the first comparison tree is run until the maximum address value is reached.