The present invention is directed to a method and apparatus for increasing the flexibility of an address counter which is used to generate addresses for accessing an array of storage cells.
Random access memory chips, and in particular dynamic random access memory chips (DRAMs) contain high density storage cells. In the testing of such memory devices, individual cells are tested to locate failing elements and repair them. To address these cells, the tester must generate row and column addresses which are associated with them.
In many automated test processes, internal address counters are used instead of a tester counter to generate test addresses for the rows and columns. In this setting, a logical unit integrated in the DRAM chip generates these addresses internally according to a predetermined pattern.
This scheme is very advantageous from a test time and cost point of view, but it often limits the flexibility of the tester to address DRAM cells. In accordance with normal test procedure, an internal counter is reset at the beginning of the procedure. The counter is incremented in the event of a command to access the next row or column. Each address of the counter is incremented in the event of an overflow of the less significant bits and the command signal being high. Due to the limited communication between the tester and the internal address counter, the test engineer has to implement a workaround to jump to certain array location(s) and perform special test features. One of these workarounds is using dummy commands to increment the counter and then execute the actual command once the address is reached. These workarounds in the nature of dummy commands may cost test time and add to the complexity of the test procedure.
In accordance with the present invention, a method of controlling an internal address counter which increases flexibility in the performance of a test on a storage cell array is provided which comprises rendering a normal overflow condition of the counter modified, thereby enabling alteration of the count provided by the counter in accordance with the requirements of the test being performed on the array.
The invention will be better understood by referring to the accompanying drawings wherein:
Referring to
After all latches (6, 10, etc.) are reset, the counter counts from ADD <0> to ADD <i> and then starts again at ADD <0> and so forth in normal reiterative manner. The occurrence of each previous count is the trigger for the next count to occur. Referring to
It is noted that the output of AND gate 2 is fed to one input of exclusive OR gate 4 and that the output of latch 6 on line 9 is fed back to the other input. In the operation of the circuit, if the output of AND gate 2 goes high and line 9 is low, the output of the exclusive OR gate goes high and latch 6 is incremented when the leading edge of the next clock pulse on the CLK input to latch 6 occurs. On the other hand, if line 9 is high and the output of the AND gate goes high, the output of exclusive OR gate 4 is again low and when the next clock pulse occurs, the latch is incremented so that line 9 goes low.
Although not shown in
It is noted that the stage corresponding to ADD <0> does not have an AND gate because there is no bit below ADD <0> to include in an AND function. This stage includes exclusive OR gate 8 and latch 10 which operate as described above. However, in this case the command signal is supplied directly to one input of exclusive OR gate 8.
As discussed above, a disadvantage of the prior art internal counter shown in
An embodiment of the invention is depicted in
The embodiment of
In the counter shown in
The first function which will be described is loading an offset address into the counter. If the counter is reset and commands are issued, the counter will increment up from 0. If the start address is not the first address, there is an offset that could be reached through dummy commands with the conventional counter. As discussed above, with the counter of
In the test mode described above, the normal overflow condition of the counter is overridden by the OR gate function through which the offset address is inserted. However, if the test mode is not used, TM_En is not active and the test mode addresses are reset, therefore the diagrams of
It will next be described how the counter can count in modulo 2i. For example, if i=2, the counter will address only every fourth storage cell. Whenever the test mode is used, the TM_En input is set. It is noted that there is an inverter 36 between such input and the OR gate 38. Because of the inverter, when TM_EN and TM_ADD1<0> are (is) is set (active) the corresponding input to OR gate 38 is zero. Thus, if TM 1 <0> is not set, which is the case in modulo 2i counting, the counter will not start counting up from zero.
If one of the other TM1 bits is set (e.g. TM ADD <i>, all bits which are less significant than ADD <i> will stay frozen, the ADD <i> will count at each command (OV<i>=1), and the bits which are more significant than ADD <i> will count according to the normal overflow condition. Thus, the counter will count in modulo 2i. Such counting can be switched off and the normal counting sequence will follow through the reset of TM_En. Another entry to the modulo 2i would keep ADD <i-1:o> frozen and increment the ADD <n=i>.
It will now be described how a storage cell array region may be addressed with the counting being restricted to that region. This is accomplished by using the test mode bit TM_ADD 2 to freeze the upper bits. Referring to
The following is an example which utilizes the functions of the counter described above. A memory array of 8K word lines is addressed, wherein the test to be done is to the third quarter array (WL(word lines) WL4K through 6K-1). The counter has to count every fourth address starting with 4K.
First, all addresses are reset by resetting the latches 22, 34, 44, etc. Then, the 4K offset is accomplished by using the test mode to set the TM_ADD 1 inputs of the various stages to the address 4 K and setting TM_EN to active (TM_EN=1) (TM_ADD1<12>=1). The next command will set the ADD to the start address 4K, and the test mode will then reset TM_En as well as the TM_ADD1 bus.
The test mode is then used to enter TM_EN=1, TM_ADD1 <2>=1 and TM_ADD2 <11>=1. The upper two bits will be frozen due to TM_ADD2<11>=1, so it will count from 4K to only 6K−1. Furthermore, it will count in modulo 4 due to TM_ADD1<2>=1. To return to the normal mode, it is only necessary to reset TM_En,TM_ADD1 and TM_ADD2 bits.
There has been disclosed and a flexible internal counting method and apparatus. While the invention has been described in connection with preferred embodiments, variations falling within the spirit of the invention will occur to those skilled in the art. For example, with appropriate correlative inversions, NAND NOR and exclusive NOR gates may be used instead of the AND, OR and exclusive OR gates which are described. It is to be understood that the terms “AND type gate,” “OR type gate” and “exclusive OR type gate” as used herein are intended to cover all such gates whether preceded by “N” or not.
It will thus be apparent to one skilled in the art that various changes and modifications can be made without departing from the spirit and scope thereof of the invention. Accordingly, it is intended that the present invention cover such modifications and variations which come within the scope of the appended claims and their equivalents.
Number | Name | Date | Kind |
---|---|---|---|
4412314 | Proebsting | Oct 1983 | A |
4618947 | Tran et al. | Oct 1986 | A |
4935925 | Williams et al. | Jun 1990 | A |
5270982 | Watanabe | Dec 1993 | A |
5627838 | Lin et al. | May 1997 | A |
5644530 | Gaultier | Jul 1997 | A |
5724540 | Kametani | Mar 1998 | A |
5818848 | Lin et al. | Oct 1998 | A |
6078637 | Ansel et al. | Jun 2000 | A |
6304510 | Nobunaga et al. | Oct 2001 | B1 |
6813741 | Ansel et al. | Nov 2004 | B1 |
20020012286 | Ernst et al. | Jan 2002 | A1 |
20040125686 | Kim et al. | Jul 2004 | A1 |
20050022084 | Hi et al. | Jan 2005 | A1 |
20050210179 | Walmsley et al. | Sep 2005 | A1 |
Number | Date | Country | |
---|---|---|---|
20060109735 A1 | May 2006 | US |