US20010049807A1 - Address generator of dynamic memory testing circuit and address generating method thereof - Google Patents
Address generator of dynamic memory testing circuit and address generating method thereof Download PDFInfo
- Publication number
- US20010049807A1 US20010049807A1 US09/060,242 US6024298A US2001049807A1 US 20010049807 A1 US20010049807 A1 US 20010049807A1 US 6024298 A US6024298 A US 6024298A US 2001049807 A1 US2001049807 A1 US 2001049807A1
- Authority
- US
- United States
- Prior art keywords
- dynamic memory
- addresses
- address
- bit
- testing
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/22—Detection or location of defective computer hardware by testing during standby operation or during idle time, e.g. start-up testing
- G06F11/26—Functional testing
- G06F11/263—Generation of test inputs, e.g. test vectors, patterns or sequences ; with adaptation of the tested hardware for testability with external testers
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11C—STATIC STORES
- G11C29/00—Checking stores for correct operation ; Subsequent repair; Testing stores during standby or offline operation
- G11C29/04—Detection or location of defective memory elements, e.g. cell constructio details, timing of test signals
- G11C29/08—Functional testing, e.g. testing during refresh, power-on self testing [POST] or distributed testing
- G11C29/12—Built-in arrangements for testing, e.g. built-in self testing [BIST] or interconnection details
- G11C29/18—Address generation devices; Devices for accessing memories, e.g. details of addressing circuits
- G11C29/20—Address generation devices; Devices for accessing memories, e.g. details of addressing circuits using counters or linear-feedback shift registers [LFSR]
Definitions
- the present invention relates to testing a memory and more particularly to an address generator of a built-in self test circuit for testing a memory such as a dynamic random access memory (DRAM) and an address generating method thereof.
- DRAM dynamic random access memory
- a built-in self test (BIST) circuit can typically be used as part of a memory testing circuit to test a memory.
- the memory to be tested is a DRAM.
- An address generator in such a BIST circuit is used to generate addresses of the memory to access memory locations to be tested and therefore typically performs many up and down counting operations according to the method being used to test the memory.
- the size of the circuitry becomes an important consideration since such counters can be very large. Accordingly, it is hard to optimize the area of such devices.
- an address generator of a dynamic memory testing circuit for testing the dynamic memory which uses all the available addresses, comprising an N-bit binary up counter where N is the total of the number of memory row address bits and the number of column address bits, an inverting means, and a first selecting means.
- the N-bit binary up counter performs an up counting operation and outputs the counted value of N bits as an address used by the dynamic memory.
- the inverting means inverts the counted value of N bits and outputs the inverted value.
- the first selecting means selectively outputs either the output of the inverting means or the counted values of N bits to the dynamic memory, depending on the state of a select signal generated corresponding to a step of the process of testing the dynamic memory.
- an address generator of a dynamic memory testing circuit for testing a dynamic memory which does not use some of the most significant addresses among all the available addresses, comprising an N-bit binary up counter where N is the total of the number of memory row address bits and the number of column address bits, a subtracting means, and a first selecting means.
- the N-bit binary up counter performs an up counting and outputs the counted value of N bits as an address used by the dynamic memory.
- the subtracting means subtracts the counted value of N bits from the maximum address and outputs the subtracted value of N bits.
- the first selecting means selectively outputs either the subtracted value of N bits or the counted values of N bits to the dynamic memory depending on the state of a select signal generated corresponding to a step of the process of testing the dynamic memory.
- an address generator of a dynamic memory testing circuit for testing the dynamic memory which does not use some of the middle addresses among all the available addresses, comprising an N-bit binary up counter where N is the total of the number of memory row address bits and the number of column address bits, an inverting means, a subtracting means, a bit combining means, and a first selecting means.
- the N-bit binary up counter performs an up counting operation and outputs the counted value of N bits as an address used by the dynamic memory.
- the inverting means inverts the most significant bit (MSB) portion of the counted value of N bits and outputs the inverted value.
- the subtracting means subtracts the least significant bit (LSB) portion among the counted values of N bits from the LSB portion of the maximum address used in the dynamic memory and outputs the result.
- the bit combining means combines the output of the inverting means with the output of the subtracting means.
- the first selecting means selectively outputs to the dynamic memory either the output of the bit combining means or the counted values of N bits, depending on the state of a first select signal generated corresponding to a step of the process of testing the dynamic memory.
- a method for generating addresses of a dynamic memory testing circuit for testing a dynamic memory which uses all the available addresses, comprising the steps of (a) obtaining addresses of N bits used by the dynamic memory by performing an up counting operation, the number N being the total of the number of memory row address bits and the number of column address bits, (b) inverting the counted N-bit address, (c) determining whether the dynamic memory is to be tested by increasing or decreasing addresses, (d) generating the N-bit address as addresses for testing the dynamic memory in the case of testing the dynamic memory by increasing the addresses, and (e) generating inverted N-bit addresses as addresses for testing the dynamic memory in the case of testing the dynamic memory by decreasing the addresses.
- a method for generating addresses of a dynamic memory testing circuit for testing the dynamic memory comprising the steps of (a) obtaining N-bit addresses used by the dynamic memory by performing an up counting operation, the number N being the total of the number of memory row address bits and the number of column address bits, (b) subtracting the N-bit address from the maximum address, and (c) determining whether the dynamic memory is to be tested by increasing or decreasing the addresses, (d) generating the N-bit addresses for testing the dynamic memory when the dynamic memory is to be tested by increasing the addresses, and (e) generating the subtracted result as an address for testing the dynamic memory when the dynamic memory is to be tested by decreasing the addresses.
- a method for generating addresses of a dynamic memory testing circuit for testing the dynamic memory comprising the steps of (a) obtaining the N-bit addresses used by the dynamic memory by performing an up counting operation, the number N being the total of the number of memory row address bits and the number of column address bits, (b) inverting the MSB portion in the N-bit address, (c) subtracting the LSB portion of the N-bit address from the LSB portion of the maximum address used by the dynamic memory, (d) combining the inverted result with the subtracted result, (e) determining whether the dynamic memory is to be tested by increasing or decreasing the addresses, (f) generating the N-bit address as an address for testing the dynamic memory in the case of testing the dynamic memory by increasing the addresses, and (g) generating the combined result as an address for testing the dynamic memory in the case of testing the dynamic memory by decreasing the addresses.
- a down counter can be used instead of an up counter.
- the address generating apparatus and method of the invention provide memory testing addresses in either an ascending or descending order, depending on the status of control signals used to set the mode of operation as desired.
- the invention can operate to generate testing addresses in the desired order and using only the selected portions of addresses using only a single counter, either an up counter or a down counter. Because only a single counter is used, significant savings in counter circuit size and complexity can be realized. In addition, because only a single counter can be used, the associated controlling circuitry is also smaller and less complex and, therefore, less costly to develop and manufacture.
- FIG. 1 is a schematic block diagram of a DRAM BIST circuit in accordance with the invention.
- FIG. 2 is a schematic circuit diagram of one embodiment of an address generator according to the present invention.
- FIG. 3 is a flowchart describing a method for generating addresses according to the present invention which can be performed in the address generator shown in FIG. 2;
- FIG. 4 is a schematic circuit diagram of an alternative embodiment of an address generator according to the present invention.
- FIG. 5 is a flowchart describing a method for generating addresses according to the present invention which can be performed in the address generator shown in FIG. 4.
- FIG. 6 is a circuit diagram of another alternative embodiment of an address generator according to the present invention.
- FIG. 7 is a flowchart describing a method for generating addresses according to the present invention which can be performed in the address generator shown in FIG. 6.
- a general DRAM BIST circuit includes a refresh counter 10 , a stage counter 12 , a data generating portion 14 , an address generating portion 16 , a comparing portion 18 , and a BIST controlling portion 22 .
- the refresh counter 10 determines a refresh timing of a DRAM 20 .
- the stage counter 12 counts the respective steps of a memory testing method which proceeds by increasing or decreasing the memory addresses.
- the counter 12 outputs the counted result to the address generating portion 16 through the BIST controlling portion 22 .
- the data generating portion 14 generates data to be written in the DRAM 20 and outputs reference data to the comparing portion 18 through the BIST controlling portion 22 .
- the BIST controlling portion 22 controls the refresh counter 10 , the stage counter 12 , the data generating portion 14 , and the comparing portion 18 in order to test the DRAM 20 .
- the reference data is used for discriminating whether the data read from the DRAM 20 is correct.
- the comparing portion 18 compares data read from the DRAM 20 with the reference data output from the BIST controlling portion 22 and outputs the compared result to the BIST controlling portion 22 .
- the BIST controlling portion 22 determines from the compared result whether errors exist in data stored in the DRAM 20 .
- the address generating portion 16 performs an up/down counting operation in response to a control signal output from the BIST controlling portion 22 and outputs the generated addresses to the DRAM 20 and the BIST controlling portion 22 . Using the address generated by the address generating portion 16 , the contents of the addressed DRAM location are read for comparison with the associated reference data.
- FIG. 2 is a schematic circuit diagram of one embodiment of an address generator 16 A according to the present invention, which includes an up (or down) counter 40 , an inverter 42 , a first multiplexer 44 corresponding to a first selecting portion, and a second multiplexer 46 corresponding to a second selecting portion.
- FIG. 3 is a flowchart for describing one embodiment of an address generating method according to the present invention, which can be performed in the address generator 16 A shown in FIG. 2.
- the method includes the steps of obtaining and inverting N-bit addresses by performing up and down counting operations (steps 60 and 62 ) and generating tested addresses corresponding to the memory testing method (steps 64 through 68 ).
- the up (or down) counter 40 which is an N-bit binary counter, performs the up (or down) counting and outputs the counted value as an N-bit address for testing a dynamic memory (not shown) (step 60 ).
- N is the number of bits obtained by adding the number of bits of the column and row addresses of the dynamic memory.
- the LSB portion of the counter word is used to address the memory columns and the MSB portion is used to address the rows.
- the up (or down) counter 40 up (or down) counts the addresses constructed by the least significant bit (LSB) portion set as the column addresses and the most significant bit (MSB) portion set as the row addresses.
- the up (or down) counter 40 counts the addresses constructed by the MSB portion set as the column addresses and the LSB portion set as the row addresses.
- the inverter 42 receives and inverts the output of the up (or down) counter 40 for the down (or up) counting of the addresses.
- the inverter 42 transfers the inverted N-bit address to the first multiplexer (MUX) 44 (step 62 ). Accordingly, addresses generated in an inverse order to the order produced by the up (or down) counter 40 can be obtained.
- the BIST controlling portion 22 shown in FIG. 1 determines whether the dynamic memory is to be tested by decreasing the addresses or increasing the addresses, which is determined by the current stage value input from the stage counter 12 in order to select the address to be input to the dynamic memory (not shown) (step 64 ).
- the BIST controlling portion 22 sets the ⁇ overscore (UP) ⁇ /DOWN signal to a logic high or “1” value.
- the first MUX 44 outputs, in response to the high ⁇ overscore (UP) ⁇ /DOWN signal, the N-bit address inverted in the inverter 42 as a testing address for testing the dynamic memory (step 66 ).
- the BIST controlling portion 22 sets the ⁇ overscore (UP) ⁇ /DOWN signal to a logic low or “0” value.
- the first MUX 44 outputs, in response to the logic low ⁇ overscore (UP) ⁇ /DOWN value, the N-bit address output from the counter 40 as the testing address (step 68 ).
- the BIST controlling portion 22 sets the UP/ ⁇ overscore (DOWN) ⁇ signal to a logic 0 .
- the first MUX 44 outputs, in response to the UP/ ⁇ overscore (DOWN) ⁇ signal at a 0 value, the N-bit address output from counter 40 as the testing address (step 68 ).
- the BIST controlling portion 22 generates the UP/ ⁇ overscore (DOWN) ⁇ signal at a 1 value.
- the first MUX 44 outputs the inverted N-bit address as the testing address in response to the logic high UP/ ⁇ overscore (DOWN) ⁇ signal (step 66 ).
- a second MUX 46 receives the testing address selected in the first MUX 44 and selectively outputs a column address of m bits and a row address of n bits to the dynamic memory through an output terminal OUT in response to a ⁇ overscore (ROW) ⁇ /COLUMN logic signal which is provided as an output from the BIST controlling portion 22 .
- FIG. 4 is a schematic circuit diagram of another embodiment of an address generator 16 B according to the present invention, which includes an up (or down) counter 80 , a subtracting circuit 82 , a first multiplexer 84 corresponding to a first selecting portion, and a second multiplexer 86 corresponding to a second selecting portion.
- FIG. 5 is a flowchart for describing one embodiment of an address generating method according to the present invention, which can be performed in the address generator 16 B shown in FIG. 4.
- the method includes the steps of obtaining N-bit addresses by performing the up and down counting operations (steps 100 and 102 ) and generating the counted addresses in accordance with the memory testing method (steps 104 through 108 ).
- the up (or down) counter 80 which is an N-bit binary counter, performs the up (or down) counting and outputs the counted value as an N-bit address which can be used in the dynamic memory (not shown) (step 100 ).
- the up (or down) counter 80 up (or down) counts the N-bit addresses including the LSB portion of the addresses set as the row address and the MSB portion set as the column address to the maximum (or minimum) address.
- the up (or down) counter 80 counts the N-bit address including the MSB portion set as the row address and the LSB portion set as the column address to the maximum (or minimum) address.
- step 100 for down-counting (or up-counting) of addresses, the subtracting circuit 82 subtracts the N-bit address counted in the up (or down) counter 80 from the maximum (or minimum) address input through an input terminal IN and outputs the subtracted N-bit address to the first multiplexer (MUX) 84 (step 102 ). Therefore, the addresses generated in an inverse order from the order of the up (or down) counter 80 is available.
- step 102 in order to select an address to be input to the dynamic memory (not shown), the BIST controlling portion 22 shown in FIG. 1 determines, on the basis of the current stage value input from the stage counter 12 , whether the dynamic memory should be tested by decreasing or increasing the addresses (step 104 ).
- the BIST controlling portion 22 When the up (or down) counter 80 is an up counter and the dynamic memory is to be tested by decreasing the addresses, the BIST controlling portion 22 generates an ⁇ overscore (UP) ⁇ /DOWN signal at a logic high or I value.
- the first MUX 84 outputs, in response to the high UP/DOWN signal, the N-bit address subtracted in the subtracting circuit 82 as the testing address for testing the dynamic memory (step 108 ).
- the BIST controlling portion 22 sets ⁇ overscore (UP) ⁇ /DOWN signal to a logic low or 0 value.
- the first MUX 84 outputs, in response to the low ⁇ overscore (UP) ⁇ /DOWN signal, the N-bit address output from the up (or down) counter 80 as the testing address (step 106 ).
- the BIST controlling portion 22 when the up (or down) counter 80 is a down counter and the dynamic memory is to be tested by decreasing the addresses, the BIST controlling portion 22 generates an UP/ ⁇ overscore (DOWN) ⁇ signal at a logic low or 0 level.
- the first MUX 84 outputs, in response to the low ⁇ overscore (UP) ⁇ /DOWN signal, the N-bit address output from the up (or down) counter 80 as the testing address (step 106 ).
- the BIST controlling portion 22 sets UP/ ⁇ overscore (DOWN) ⁇ signal to a logic high or 1 value.
- the first MUX 84 outputs, in response to the high ⁇ overscore (UP) ⁇ /DOWN signal, the N-bit address subtracted in the subtracting circuit 82 as the testing address (step 108 ).
- the second MUX 86 receives the testing address selected in the first MUX 84 and selectively outputs the row address of m bits and the column address of n bits to the dynamic memory through the output terminal OUT in response to a ⁇ overscore (ROW) ⁇ /COLUMN signal output from the BIST controlling portion 22 .
- the address generating circuitry 16 B since some of the most significant addresses among all the available addresses are not used in the memory testing, the address generating circuitry 16 B generates addresses referenced to the maximum available memory address. Therefore, the up (or down) counter 80 of the address generating circuitry 16 B counts to (or from) the maximum available address.
- an address generator for testing the dynamic memory which does not use some of the middle addresses among all the available addresses and an address generating method thereof will now be described.
- some portion of the addresses between the most significant address and the least significant address referred to herein as “middle” addresses, are the only address of the dynamic memory that are tested in accordance with the invention.
- FIG. 6 is a schematic circuit diagram of another embodiment of the address generator 16 C according to the present invention.
- the address generator 16 C includes an up (or down) counter 120 , an inverter 122 , a subtracting circuit 124 , a first multiplexer 126 corresponding to a first selecting portion, and a second multiplexer 128 corresponding to a second selecting portion.
- FIG. 7 is a flowchart for describing one embodiment of an address generating method according to the present invention, which can be performed in the address generator 16 C shown in FIG. 6.
- the method includes the steps of obtaining N-bit addresses by performing an up (or down) counting operation (step 140 ), performing a down (or up) counting operation (steps 142 through 146 ), and generating the counted addresses in accordance with the memory testing method (steps 148 through 152 ).
- the up (or down) counter 120 which is an N-bit binary counter, performs the up (or down) counting and outputs the counted value as the N-bit address which can be used in the dynamic memory (not shown) (step 140 ).
- the up (or down) counter 120 counts the N-bit address constructed by the LSB portion set as the column address and the MSB portion set as the row address.
- the up (or down) counter 120 counts the N-bit addresses constructed by the MSB side set as the column addresses and the LSB side set as the row addresses.
- the inverter 122 and the subtracter 124 generate addresses in the inverse order (steps 142 through 146 ). Namely, the inverter 122 inverts m bits of the MSB side among the N-bit addresses counted in the counter 120 (step 142 ). After the step of 142 , the subtracter 124 subtracts n bits of the LSB side of the N-bit addresses counted in the up (or down) counter 120 from n bits of the LSB side of the maximum (or minimum) address input through the input terminal IN (step 144 ). After the step 144 , the subtracted n bits and the inverted m bits are combined in a node 125 .
- the obtained result is output to the first multiplexer (MUX) 126 as the N-bit addresses (step 146 ).
- the BIST controlling portion 22 shown in FIG. 1 determines whether the dynamic memory is to be tested by decreasing or increasing the addresses, which is determined by the current stage value input from the stage counter 12 (step 48 ).
- the BIST controlling portion 22 sets an ⁇ overscore (UP) ⁇ /DOWN signal at a logic high or 1 value.
- the first MUX 126 outputs the combined N-bit addresses as the testing address for testing the dynamic memory, in response to the high ⁇ overscore (UP) ⁇ /DOWN signal (step 152 ).
- the BIST controlling portion 22 sets the ⁇ overscore (UP) ⁇ /DOWN signal to a logic low or 0 value.
- the first MUX 126 outputs the N-bit addresses output from the up (or down) counter 120 as the testing address in response to the low ⁇ overscore (UP) ⁇ /DOWN signal (step 150 ).
- the BIST controlling portion 22 sets an UP/ ⁇ overscore (DOWN) ⁇ signal to a logic low or 0 value.
- the first MUX 126 outputs the N-bit addresses output from the up(or down) counter 120 as the testing address, in response to the low UP/ ⁇ overscore (DOWN) ⁇ signal.
- the BIST controlling portion 22 sets the UP/ ⁇ overscore (DOWN) ⁇ signal to a logic high or 1 value.
- the first MUX 126 outputs the inverted N-bit addresses as the testing address, in response to the high UP/ ⁇ overscore (DOWN) ⁇ signal (step 152 ).
- the second MUX 128 receives the testing address output from the first MUX 126 and selectively outputs the row addresses of m bits and the column addresses of n bits to the dynamic memory through the output terminal OUT, in response to the ⁇ overscore (ROW) ⁇ /COLUMN signal output from the BIST controlling portion 22 .
Landscapes
- Engineering & Computer Science (AREA)
- General Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Computer Hardware Design (AREA)
- Quality & Reliability (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Tests Of Electronic Circuits (AREA)
- For Increasing The Reliability Of Semiconductor Memories (AREA)
Abstract
Description
- 1. Field of the Invention
- The present invention relates to testing a memory and more particularly to an address generator of a built-in self test circuit for testing a memory such as a dynamic random access memory (DRAM) and an address generating method thereof.
- 2. Description of the Related Art
- A built-in self test (BIST) circuit can typically be used as part of a memory testing circuit to test a memory. In a DRAM BIST, the memory to be tested is a DRAM. An address generator in such a BIST circuit is used to generate addresses of the memory to access memory locations to be tested and therefore typically performs many up and down counting operations according to the method being used to test the memory. In the case of an address generator which uses an up/down counter, the size of the circuitry becomes an important consideration since such counters can be very large. Accordingly, it is hard to optimize the area of such devices.
- In the case of testing a DRAM which does not use all its available addresses, if the addresses are generated using an up/down counter, various additional circuits are necessary to accomodate the skipping of addresses. This additional circuitry adds to the difficulty in optimizing the area of the BIST circuit including the address generator. Also, in the case that the DRAM does not use all the available addresses, if the address generator is designed using the up/down counter or separate up and down counters, respective counters for counting the column address and the row address of the DRAM are produced. This also greatly increases circuit size and complexity. Also, the hardware of the BIST controlling portion for controlling the up/down counter or the up and down counters can be very large and complex.
- It is a first object of the present invention to provide an address generator of a dynamic memory testing circuit, for generating addresses for testing a dynamic memory which uses all the available addresses.
- It is a second object of the present invention to provide an address generator of a dynamic memory testing circuit, for generating addresses for testing a dynamic memory which does not use some of the addresses of the memory, and more particularly, a dynamic memory which does not use its most significant addresses among all the available addresses.
- It is a third object of the present invention to provide an address generator of a dynamic memory testing circuit, for generating addresses for testing a dynamic memory which does not use some of the middle addresses among all the available addresses.
- It is a fourth object of the present invention to provide an address generating method of a dynamic memory testing circuit, for generating addresses for testing a dynamic memory which uses all its available addresses.
- It is a fifth object of the present invention to provide an address generating method of a dynamic memory testing circuit, for generating addresses for testing a dynamic memory which does not use some of the addresses of the memory, and more particularly, a dynamic memory which does not use its most significant addresses among all the available addresses.
- It is a sixth object of the present invention to provide an address generating method of a dynamic memory testing circuit, simply generating addresses for testing a dynamic memory which does not use some of the middle addresses among all the available addresses.
- To achieve these and other objects, there is provided an address generator of a dynamic memory testing circuit for testing the dynamic memory which uses all the available addresses, comprising an N-bit binary up counter where N is the total of the number of memory row address bits and the number of column address bits, an inverting means, and a first selecting means. The N-bit binary up counter performs an up counting operation and outputs the counted value of N bits as an address used by the dynamic memory. The inverting means inverts the counted value of N bits and outputs the inverted value. The first selecting means selectively outputs either the output of the inverting means or the counted values of N bits to the dynamic memory, depending on the state of a select signal generated corresponding to a step of the process of testing the dynamic memory.
- In accordance with another aspect of the invention, there is provided an address generator of a dynamic memory testing circuit for testing a dynamic memory which does not use some of the most significant addresses among all the available addresses, comprising an N-bit binary up counter where N is the total of the number of memory row address bits and the number of column address bits, a subtracting means, and a first selecting means. The N-bit binary up counter performs an up counting and outputs the counted value of N bits as an address used by the dynamic memory. The subtracting means subtracts the counted value of N bits from the maximum address and outputs the subtracted value of N bits. The first selecting means selectively outputs either the subtracted value of N bits or the counted values of N bits to the dynamic memory depending on the state of a select signal generated corresponding to a step of the process of testing the dynamic memory.
- In accordance with another aspect of the invention, there is provided an address generator of a dynamic memory testing circuit for testing the dynamic memory which does not use some of the middle addresses among all the available addresses, comprising an N-bit binary up counter where N is the total of the number of memory row address bits and the number of column address bits, an inverting means, a subtracting means, a bit combining means, and a first selecting means. The N-bit binary up counter performs an up counting operation and outputs the counted value of N bits as an address used by the dynamic memory. The inverting means inverts the most significant bit (MSB) portion of the counted value of N bits and outputs the inverted value. The subtracting means subtracts the least significant bit (LSB) portion among the counted values of N bits from the LSB portion of the maximum address used in the dynamic memory and outputs the result. The bit combining means combines the output of the inverting means with the output of the subtracting means. The first selecting means selectively outputs to the dynamic memory either the output of the bit combining means or the counted values of N bits, depending on the state of a first select signal generated corresponding to a step of the process of testing the dynamic memory.
- In accordance with another aspect of the invention, there is provided a method for generating addresses of a dynamic memory testing circuit for testing a dynamic memory which uses all the available addresses, comprising the steps of (a) obtaining addresses of N bits used by the dynamic memory by performing an up counting operation, the number N being the total of the number of memory row address bits and the number of column address bits, (b) inverting the counted N-bit address, (c) determining whether the dynamic memory is to be tested by increasing or decreasing addresses, (d) generating the N-bit address as addresses for testing the dynamic memory in the case of testing the dynamic memory by increasing the addresses, and (e) generating inverted N-bit addresses as addresses for testing the dynamic memory in the case of testing the dynamic memory by decreasing the addresses.
- In accordance with another aspect of the invention, there is provided a method for generating addresses of a dynamic memory testing circuit for testing the dynamic memory which does not use some of most significant addresses among all the available addresses, comprising the steps of (a) obtaining N-bit addresses used by the dynamic memory by performing an up counting operation, the number N being the total of the number of memory row address bits and the number of column address bits, (b) subtracting the N-bit address from the maximum address, and (c) determining whether the dynamic memory is to be tested by increasing or decreasing the addresses, (d) generating the N-bit addresses for testing the dynamic memory when the dynamic memory is to be tested by increasing the addresses, and (e) generating the subtracted result as an address for testing the dynamic memory when the dynamic memory is to be tested by decreasing the addresses.
- In accordance with another aspect of the invention, there is provided a method for generating addresses of a dynamic memory testing circuit for testing the dynamic memory which does not use some of the middle addresses among all the available addresses, comprising the steps of (a) obtaining the N-bit addresses used by the dynamic memory by performing an up counting operation, the number N being the total of the number of memory row address bits and the number of column address bits, (b) inverting the MSB portion in the N-bit address, (c) subtracting the LSB portion of the N-bit address from the LSB portion of the maximum address used by the dynamic memory, (d) combining the inverted result with the subtracted result, (e) determining whether the dynamic memory is to be tested by increasing or decreasing the addresses, (f) generating the N-bit address as an address for testing the dynamic memory in the case of testing the dynamic memory by increasing the addresses, and (g) generating the combined result as an address for testing the dynamic memory in the case of testing the dynamic memory by decreasing the addresses.
- In each of these aspects of the invention, a down counter can be used instead of an up counter. In either case, the address generating apparatus and method of the invention provide memory testing addresses in either an ascending or descending order, depending on the status of control signals used to set the mode of operation as desired.
- The invention can operate to generate testing addresses in the desired order and using only the selected portions of addresses using only a single counter, either an up counter or a down counter. Because only a single counter is used, significant savings in counter circuit size and complexity can be realized. In addition, because only a single counter can be used, the associated controlling circuitry is also smaller and less complex and, therefore, less costly to develop and manufacture.
- The above objects and advantages of the present invention will become more apparent from the following detailed description of preferred embodiments thereof with reference to the attached drawings in which:
- FIG. 1 is a schematic block diagram of a DRAM BIST circuit in accordance with the invention;
- FIG. 2 is a schematic circuit diagram of one embodiment of an address generator according to the present invention;
- FIG. 3 is a flowchart describing a method for generating addresses according to the present invention which can be performed in the address generator shown in FIG. 2;
- FIG. 4 is a schematic circuit diagram of an alternative embodiment of an address generator according to the present invention;
- FIG. 5 is a flowchart describing a method for generating addresses according to the present invention which can be performed in the address generator shown in FIG. 4.
- FIG. 6 is a circuit diagram of another alternative embodiment of an address generator according to the present invention; and
- FIG. 7 is a flowchart describing a method for generating addresses according to the present invention which can be performed in the address generator shown in FIG. 6.
- Hereinafter, the configuration and operation of a DRAM BIST circuit which uses an address generator according to the present invention and an address generating method thereof will be described with reference to the attached drawing s.
- Referring to FIG. 1, a general DRAM BIST circuit includes a
refresh counter 10, astage counter 12, adata generating portion 14, anaddress generating portion 16, a comparingportion 18, and aBIST controlling portion 22. Therefresh counter 10 determines a refresh timing of aDRAM 20. Thestage counter 12 counts the respective steps of a memory testing method which proceeds by increasing or decreasing the memory addresses. Thecounter 12 outputs the counted result to theaddress generating portion 16 through theBIST controlling portion 22. - The
data generating portion 14 generates data to be written in theDRAM 20 and outputs reference data to the comparingportion 18 through theBIST controlling portion 22. TheBIST controlling portion 22 controls therefresh counter 10, thestage counter 12, thedata generating portion 14, and the comparingportion 18 in order to test theDRAM 20. The reference data is used for discriminating whether the data read from theDRAM 20 is correct. The comparingportion 18 compares data read from theDRAM 20 with the reference data output from theBIST controlling portion 22 and outputs the compared result to theBIST controlling portion 22. TheBIST controlling portion 22 determines from the compared result whether errors exist in data stored in theDRAM 20. Theaddress generating portion 16 performs an up/down counting operation in response to a control signal output from theBIST controlling portion 22 and outputs the generated addresses to theDRAM 20 and theBIST controlling portion 22. Using the address generated by theaddress generating portion 16, the contents of the addressed DRAM location are read for comparison with the associated reference data. - Hereinafter, the configuration and operation of the address generator according to the present invention corresponding to the
address generating portion 16 shown in FIG. 1 and an address generating method performed in the address generator will be described with reference to the attached drawings. - An
address generator 16A for generating addresses for testing a dynamic memory which uses all the available addresses and an address generating method thereof will now be described. FIG. 2 is a schematic circuit diagram of one embodiment of anaddress generator 16A according to the present invention, which includes an up (or down)counter 40, aninverter 42, afirst multiplexer 44 corresponding to a first selecting portion, and asecond multiplexer 46 corresponding to a second selecting portion. - FIG. 3 is a flowchart for describing one embodiment of an address generating method according to the present invention, which can be performed in the
address generator 16A shown in FIG. 2. In the embodiment of FIG. 3, the method includes the steps of obtaining and inverting N-bit addresses by performing up and down counting operations (steps 60 and 62) and generating tested addresses corresponding to the memory testing method (steps 64 through 68). - Referring to FIGS. 2 and 3, the up (or down)
counter 40, which is an N-bit binary counter, performs the up (or down) counting and outputs the counted value as an N-bit address for testing a dynamic memory (not shown) (step 60). N is the number of bits obtained by adding the number of bits of the column and row addresses of the dynamic memory. - In one embodiment, the LSB portion of the counter word is used to address the memory columns and the MSB portion is used to address the rows. In this embodiment, in the case in which the dynamic memory is tested by first running or counting through column addresses and then running through the row addresses, the up (or down) counter 40 up (or down) counts the addresses constructed by the least significant bit (LSB) portion set as the column addresses and the most significant bit (MSB) portion set as the row addresses. However, in the case of testing the dynamic memory by first increasing the row addresses and next increasing the column addresses, the up (or down) counter 40 counts the addresses constructed by the MSB portion set as the column addresses and the LSB portion set as the row addresses.
- After the
step 60, theinverter 42 receives and inverts the output of the up (or down) counter 40 for the down (or up) counting of the addresses. Theinverter 42 transfers the inverted N-bit address to the first multiplexer (MUX) 44 (step 62). Accordingly, addresses generated in an inverse order to the order produced by the up (or down) counter 40 can be obtained. Afterstep 62, theBIST controlling portion 22 shown in FIG. 1 determines whether the dynamic memory is to be tested by decreasing the addresses or increasing the addresses, which is determined by the current stage value input from thestage counter 12 in order to select the address to be input to the dynamic memory (not shown) (step 64). - When the up (or down)
counter 40 is an up counter and the dynamic memory is to be tested decreasing the addresses, theBIST controlling portion 22 sets the {overscore (UP)}/DOWN signal to a logic high or “1” value. Thefirst MUX 44 outputs, in response to the high {overscore (UP)}/DOWN signal, the N-bit address inverted in theinverter 42 as a testing address for testing the dynamic memory (step 66). However, in the case of testing the dynamic memory increasing the addresses, theBIST controlling portion 22 sets the {overscore (UP)}/DOWN signal to a logic low or “0” value. Thefirst MUX 44 outputs, in response to the logic low {overscore (UP)}/DOWN value, the N-bit address output from thecounter 40 as the testing address (step 68). - Alternatively, in the case that the up (or down)
counter 40 is a down counter and the dynamic memory is to be tested decreasing the addresses, theBIST controlling portion 22 sets the UP/{overscore (DOWN)} signal to a logic 0. Thefirst MUX 44 outputs, in response to the UP/{overscore (DOWN)} signal at a 0 value, the N-bit address output from counter 40 as the testing address (step 68). However, in the case of testing the dynamic memory by increasing the addresses, theBIST controlling portion 22 generates the UP/{overscore (DOWN)} signal at a 1 value. Thefirst MUX 44 outputs the inverted N-bit address as the testing address in response to the logic high UP/{overscore (DOWN)} signal (step 66). - A
second MUX 46 receives the testing address selected in thefirst MUX 44 and selectively outputs a column address of m bits and a row address of n bits to the dynamic memory through an output terminal OUT in response to a {overscore (ROW)}/COLUMN logic signal which is provided as an output from theBIST controlling portion 22. - In accordance with another aspect of the invention, an address generator for testing the dynamic memory which does not use some of the most significant addresses among all the available addresses and an address generating method thereof will now be described in detail. FIG. 4 is a schematic circuit diagram of another embodiment of an
address generator 16B according to the present invention, which includes an up (or down)counter 80, a subtractingcircuit 82, afirst multiplexer 84 corresponding to a first selecting portion, and asecond multiplexer 86 corresponding to a second selecting portion. - FIG. 5 is a flowchart for describing one embodiment of an address generating method according to the present invention, which can be performed in the
address generator 16B shown in FIG. 4. In the embodiment of FIG. 5, the method includes the steps of obtaining N-bit addresses by performing the up and down counting operations (steps 100 and 102) and generating the counted addresses in accordance with the memory testing method (steps 104 through 108). - Referring to FIGS. 4 and 5, the up (or down)
counter 80, which is an N-bit binary counter, performs the up (or down) counting and outputs the counted value as an N-bit address which can be used in the dynamic memory (not shown) (step 100). In the case of testing the dynamic memory by first increasing the row addresses without using some of the column addresses which are available to the dynamic memory, the up (or down) counter 80 up (or down) counts the N-bit addresses including the LSB portion of the addresses set as the row address and the MSB portion set as the column address to the maximum (or minimum) address. However, in the case of testing the dynamic memory by first increasing the column addresses without using some of the row addresses which are available to the dynamic memory, the up (or down) counter 80 counts the N-bit address including the MSB portion set as the row address and the LSB portion set as the column address to the maximum (or minimum) address. - After
step 100, for down-counting (or up-counting) of addresses, the subtractingcircuit 82 subtracts the N-bit address counted in the up (or down) counter 80 from the maximum (or minimum) address input through an input terminal IN and outputs the subtracted N-bit address to the first multiplexer (MUX) 84 (step 102). Therefore, the addresses generated in an inverse order from the order of the up (or down)counter 80 is available. Afterstep 102, in order to select an address to be input to the dynamic memory (not shown), theBIST controlling portion 22 shown in FIG. 1 determines, on the basis of the current stage value input from thestage counter 12, whether the dynamic memory should be tested by decreasing or increasing the addresses (step 104). - When the up (or down)
counter 80 is an up counter and the dynamic memory is to be tested by decreasing the addresses, theBIST controlling portion 22 generates an {overscore (UP)}/DOWN signal at a logic high or I value. Thefirst MUX 84 outputs, in response to the high UP/DOWN signal, the N-bit address subtracted in the subtractingcircuit 82 as the testing address for testing the dynamic memory (step 108). However, in the case of testing the dynamic memory by increasing the addresses, theBIST controlling portion 22 sets {overscore (UP)}/DOWN signal to a logic low or 0 value. Thefirst MUX 84 outputs, in response to the low {overscore (UP)}/DOWN signal, the N-bit address output from the up (or down) counter 80 as the testing address (step 106). - Also, when the up (or down)
counter 80 is a down counter and the dynamic memory is to be tested by decreasing the addresses, theBIST controlling portion 22 generates an UP/{overscore (DOWN)} signal at a logic low or 0 level. Thefirst MUX 84 outputs, in response to the low {overscore (UP)}/DOWN signal, the N-bit address output from the up (or down) counter 80 as the testing address (step 106). However, when the dynamic memory is to be tested by increasing the addresses, theBIST controlling portion 22 sets UP/{overscore (DOWN)} signal to a logic high or 1 value. Thefirst MUX 84 outputs, in response to the high {overscore (UP)}/DOWN signal, the N-bit address subtracted in the subtractingcircuit 82 as the testing address (step 108). - The
second MUX 86 receives the testing address selected in thefirst MUX 84 and selectively outputs the row address of m bits and the column address of n bits to the dynamic memory through the output terminal OUT in response to a {overscore (ROW)}/COLUMN signal output from theBIST controlling portion 22. - Hence, in this embodiment of the invention, since some of the most significant addresses among all the available addresses are not used in the memory testing, the
address generating circuitry 16B generates addresses referenced to the maximum available memory address. Therefore, the up (or down) counter 80 of theaddress generating circuitry 16B counts to (or from) the maximum available address. - In accordance with another aspect of the invention, an address generator for testing the dynamic memory which does not use some of the middle addresses among all the available addresses and an address generating method thereof will now be described. In this embodiment, some portion of the addresses between the most significant address and the least significant address, referred to herein as “middle” addresses, are the only address of the dynamic memory that are tested in accordance with the invention.
- FIG. 6 is a schematic circuit diagram of another embodiment of the
address generator 16C according to the present invention. Theaddress generator 16C includes an up (or down)counter 120, aninverter 122, a subtractingcircuit 124, afirst multiplexer 126 corresponding to a first selecting portion, and asecond multiplexer 128 corresponding to a second selecting portion. - FIG. 7 is a flowchart for describing one embodiment of an address generating method according to the present invention, which can be performed in the
address generator 16C shown in FIG. 6. In the embodiment of FIG. 7, the method includes the steps of obtaining N-bit addresses by performing an up (or down) counting operation (step 140), performing a down (or up) counting operation (steps 142 through 146), and generating the counted addresses in accordance with the memory testing method (steps 148 through 152). - Referring to FIGS. 6 and 7, the up (or down)
counter 120, which is an N-bit binary counter, performs the up (or down) counting and outputs the counted value as the N-bit address which can be used in the dynamic memory (not shown) (step 140). Instep 140, when the dynamic memory is to be tested by first increasing the column address without using some of the column addresses which are available to the dynamic memory, the up (or down) counter 120 counts the N-bit address constructed by the LSB portion set as the column address and the MSB portion set as the row address. However, in the case of testing the dynamic memory by first increasing the row addresses without using some of the row addresses, the up (or down) counter 120 counts the N-bit addresses constructed by the MSB side set as the column addresses and the LSB side set as the row addresses. - After
step 140, theinverter 122 and thesubtracter 124 generate addresses in the inverse order (steps 142 through 146). Namely, theinverter 122 inverts m bits of the MSB side among the N-bit addresses counted in the counter 120 (step 142). After the step of 142, thesubtracter 124 subtracts n bits of the LSB side of the N-bit addresses counted in the up (or down) counter 120 from n bits of the LSB side of the maximum (or minimum) address input through the input terminal IN (step 144). After thestep 144, the subtracted n bits and the inverted m bits are combined in anode 125. The obtained result is output to the first multiplexer (MUX) 126 as the N-bit addresses (step 146). After thestep 146, in order to select the addresses to be input to the dynamic memory (not shown), theBIST controlling portion 22 shown in FIG. 1 determines whether the dynamic memory is to be tested by decreasing or increasing the addresses, which is determined by the current stage value input from the stage counter 12 (step 48). - When the up (or down)
counter 120 is an up counter and the dynamic memory is to be tested by decreasing the addresses, theBIST controlling portion 22 sets an {overscore (UP)}/DOWN signal at a logic high or 1 value. Thefirst MUX 126 outputs the combined N-bit addresses as the testing address for testing the dynamic memory, in response to the high {overscore (UP)}/DOWN signal (step 152). However, in the case of testing the dynamic memory by increasing the addresses, theBIST controlling portion 22 sets the {overscore (UP)}/DOWN signal to a logic low or 0 value. Thefirst MUX 126 outputs the N-bit addresses output from the up (or down) counter 120 as the testing address in response to the low {overscore (UP)}/DOWN signal (step 150). - Also, when the up (or down)
counter 120 is a down counter and the dynamic memory is to be tested by increasing the addresses, theBIST controlling portion 22 sets an UP/{overscore (DOWN)} signal to a logic low or 0 value. Thefirst MUX 126 outputs the N-bit addresses output from the up(or down) counter 120 as the testing address, in response to the low UP/{overscore (DOWN)} signal. However, when the dynamic memory is to be tested by increasing the addresses, theBIST controlling portion 22 sets the UP/{overscore (DOWN)} signal to a logic high or 1 value. Thefirst MUX 126 outputs the inverted N-bit addresses as the testing address, in response to the high UP/{overscore (DOWN)} signal (step 152). - The
second MUX 128 receives the testing address output from thefirst MUX 126 and selectively outputs the row addresses of m bits and the column addresses of n bits to the dynamic memory through the output terminal OUT, in response to the {overscore (ROW)}/COLUMN signal output from theBIST controlling portion 22. - While this invention has been particularly shown and described with references to preferred embodiments thereof, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the invention as defined in the following claims.
Claims (37)
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| KR1019970030662A KR100258978B1 (en) | 1997-07-02 | 1997-07-02 | Apparatus and methode for generating test address for testing dynamic memory by using self test circuit |
| KR97-30662 | 1997-07-02 |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| US20010049807A1 true US20010049807A1 (en) | 2001-12-06 |
| US6338154B2 US6338154B2 (en) | 2002-01-08 |
Family
ID=19513198
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| US09/060,242 Expired - Lifetime US6338154B2 (en) | 1997-07-02 | 1998-04-14 | Apparatus and method for generating addresses in a built-in self memory testing circuit |
Country Status (3)
| Country | Link |
|---|---|
| US (1) | US6338154B2 (en) |
| JP (1) | JP3643698B2 (en) |
| KR (1) | KR100258978B1 (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| FR2845784A1 (en) * | 2002-10-11 | 2004-04-16 | St Microelectronics Sa | LIFO data memory incorporating two random access memories, uses two memories each a power of two smaller than the stack depth, and multiplexors to pass data straight through or into memory |
| US20080184085A1 (en) * | 2007-01-26 | 2008-07-31 | Samsung Electronics Co., Ltd. | Semiconductor ic including pad for wafer test and method of testing wafer including semiconductor ic |
| US20090300443A1 (en) * | 2008-05-30 | 2009-12-03 | Fujitsu Limited | Test apparatus, test method, and integrated circuit |
| US9093173B1 (en) * | 2014-03-27 | 2015-07-28 | SK Hynix Inc. | Semiconductor memory apparatus |
Families Citing this family (21)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP3298621B2 (en) * | 1998-09-02 | 2002-07-02 | 日本電気株式会社 | Built-in self test circuit |
| KR100587264B1 (en) * | 1999-04-03 | 2006-06-08 | 엘지전자 주식회사 | Internal memory and internal memory test method for application specific semiconductor devices |
| US6694461B1 (en) * | 1999-07-26 | 2004-02-17 | Ati International Srl | System and method for testing integrated memories |
| DE10004958A1 (en) * | 2000-02-04 | 2001-08-09 | Infineon Technologies Ag | Method for testing the refresh device of an information store |
| JP3795822B2 (en) * | 2002-04-03 | 2006-07-12 | Necエレクトロニクス株式会社 | Embedded self-test circuit and design verification method |
| GB2391336B (en) * | 2002-04-09 | 2005-10-26 | Micron Technology Inc | Method and system for local memory addressing in single instruction, multiple data computer system |
| JP4141775B2 (en) * | 2002-09-20 | 2008-08-27 | 株式会社ルネサステクノロジ | Semiconductor integrated circuit device |
| JP2004246979A (en) * | 2003-02-14 | 2004-09-02 | Fujitsu Ltd | Semiconductor test circuit, semiconductor memory device, and semiconductor test method |
| US20060041798A1 (en) * | 2004-08-23 | 2006-02-23 | On-Chip Technologies, Inc. | Design techniques to increase testing efficiency |
| GB2448744A (en) * | 2007-04-26 | 2008-10-29 | Wolfson Microelectronics Plc | Look-up table indexing scheme with null values used to expand table to have a power of two number of entries in each cycle of coefficients |
| US20100005335A1 (en) * | 2008-07-01 | 2010-01-07 | International Business Machines Corporation | Microprocessor interface with dynamic segment sparing and repair |
| US8245105B2 (en) * | 2008-07-01 | 2012-08-14 | International Business Machines Corporation | Cascade interconnect memory system with enhanced reliability |
| US8234540B2 (en) | 2008-07-01 | 2012-07-31 | International Business Machines Corporation | Error correcting code protected quasi-static bit communication on a high-speed bus |
| US8139430B2 (en) * | 2008-07-01 | 2012-03-20 | International Business Machines Corporation | Power-on initialization and test for a cascade interconnect memory system |
| US8082475B2 (en) * | 2008-07-01 | 2011-12-20 | International Business Machines Corporation | Enhanced microprocessor interconnect with bit shadowing |
| US8201069B2 (en) * | 2008-07-01 | 2012-06-12 | International Business Machines Corporation | Cyclical redundancy code for use in a high-speed serial link |
| US7895374B2 (en) * | 2008-07-01 | 2011-02-22 | International Business Machines Corporation | Dynamic segment sparing and repair in a memory system |
| US8082474B2 (en) * | 2008-07-01 | 2011-12-20 | International Business Machines Corporation | Bit shadowing in a memory system |
| US7979759B2 (en) * | 2009-01-08 | 2011-07-12 | International Business Machines Corporation | Test and bring-up of an enhanced cascade interconnect memory system |
| US20100180154A1 (en) * | 2009-01-13 | 2010-07-15 | International Business Machines Corporation | Built In Self-Test of Memory Stressor |
| KR100994212B1 (en) | 2009-12-28 | 2010-11-12 | 경상대학교산학협력단 | Pulse-width modulation signal generator |
Family Cites Families (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2527935B2 (en) * | 1986-05-19 | 1996-08-28 | 株式会社 アドバンテスト | Semiconductor memory test equipment |
| US4858178A (en) * | 1986-09-30 | 1989-08-15 | Texas Instruments Incorporated | Programmable sequence generator |
| JPH0815354B2 (en) * | 1986-10-30 | 1996-02-14 | 日本電気株式会社 | Wireless telephone equipment |
| US5033048A (en) * | 1988-04-01 | 1991-07-16 | Digital Equipment Corporation | Memory selftest method and apparatus same |
| US4990388A (en) | 1988-07-30 | 1991-02-05 | Taiyo Yuden Co., Ltd. | Optical information recording medium |
| US5216748A (en) * | 1988-11-30 | 1993-06-01 | Bull, S.A. | Integrated dynamic programming circuit |
| US5481671A (en) * | 1992-02-03 | 1996-01-02 | Advantest Corporation | Memory testing device for multiported DRAMs |
| US5729720A (en) * | 1994-12-22 | 1998-03-17 | Texas Instruments Incorporated | Power management masked clock circuitry, systems and methods |
| KR100206600B1 (en) * | 1996-06-03 | 1999-07-01 | 김영환 | Testing method and device for refreshing counter of sdram |
| US6011748A (en) * | 1996-10-03 | 2000-01-04 | Credence Systems Corporation | Method and apparatus for built-in self test of integrated circuits providing for separate row and column addresses |
-
1997
- 1997-07-02 KR KR1019970030662A patent/KR100258978B1/en not_active Expired - Fee Related
-
1998
- 1998-04-14 US US09/060,242 patent/US6338154B2/en not_active Expired - Lifetime
- 1998-04-17 JP JP10820698A patent/JP3643698B2/en not_active Expired - Fee Related
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| FR2845784A1 (en) * | 2002-10-11 | 2004-04-16 | St Microelectronics Sa | LIFO data memory incorporating two random access memories, uses two memories each a power of two smaller than the stack depth, and multiplexors to pass data straight through or into memory |
| US20040117542A1 (en) * | 2002-10-11 | 2004-06-17 | Pascal Urard | LIFO type data storage device incorporating two random access memories |
| US7139865B2 (en) | 2002-10-11 | 2006-11-21 | Stmicroelectronics S.A. | LIFO type data storage device incorporating two random access memories |
| US20080184085A1 (en) * | 2007-01-26 | 2008-07-31 | Samsung Electronics Co., Ltd. | Semiconductor ic including pad for wafer test and method of testing wafer including semiconductor ic |
| US7716550B2 (en) * | 2007-01-26 | 2010-05-11 | Samsung Electronics Co., Ltd. | Semiconductor IC including pad for wafer test and method of testing wafer including semiconductor IC |
| US20090300443A1 (en) * | 2008-05-30 | 2009-12-03 | Fujitsu Limited | Test apparatus, test method, and integrated circuit |
| US8143901B2 (en) * | 2008-05-30 | 2012-03-27 | Fujitsu Limited | Test apparatus, test method, and integrated circuit |
| US9093173B1 (en) * | 2014-03-27 | 2015-07-28 | SK Hynix Inc. | Semiconductor memory apparatus |
Also Published As
| Publication number | Publication date |
|---|---|
| JP3643698B2 (en) | 2005-04-27 |
| KR19990008622A (en) | 1999-02-05 |
| US6338154B2 (en) | 2002-01-08 |
| JPH1131400A (en) | 1999-02-02 |
| KR100258978B1 (en) | 2000-06-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US6338154B2 (en) | Apparatus and method for generating addresses in a built-in self memory testing circuit | |
| US4839856A (en) | Memory access control circuit | |
| US8276027B2 (en) | Semiconductor memory and method for testing the same | |
| JP2915945B2 (en) | Memory test equipment | |
| US6131146A (en) | Interleave memory control apparatus and method | |
| US5029330A (en) | Semiconductor memory device | |
| US6516430B1 (en) | Test circuit for semiconductor device with multiple memory circuits | |
| JP2746222B2 (en) | Semiconductor storage device | |
| JPH1166878A (en) | Semiconductor storage device | |
| US6385746B1 (en) | Memory test circuit | |
| US7577212B2 (en) | Method and system for generating reference voltages for signal receivers | |
| JP2850953B2 (en) | Semiconductor device | |
| US7174418B2 (en) | Semiconductor memory device for enhancing refresh operation in high speed data access | |
| US7363460B2 (en) | Semiconductor memory device having tag block for reducing initialization time | |
| US6704229B2 (en) | Semiconductor test circuit for testing a semiconductor memory device having a write mask function | |
| JPH06215559A (en) | Page memory access system | |
| US20060245271A1 (en) | Device for distributing input data for memory device | |
| JPH0955082A (en) | Semiconductor memory device | |
| JPH03278147A (en) | High speed memory system | |
| JPH11203875A (en) | Semiconductor memory element with builtin address counter | |
| JP2000163957A (en) | Semiconductor storage device | |
| JPH01146193A (en) | Semiconductor memory device | |
| JPH0581897A (en) | Semiconductor memory | |
| JPH0619802A (en) | Memory circuit | |
| JPH02210687A (en) | Refresh address generation circuit |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| AS | Assignment |
Owner name: SAMSUNG ELECTRONICS, CO., LTD., KOREA, REPUBLIC OF Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:KIM, HEON-CHEOL;REEL/FRAME:009316/0800 Effective date: 19980605 |
|
| STCF | Information on status: patent grant |
Free format text: PATENTED CASE |
|
| FEPP | Fee payment procedure |
Free format text: PAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY |
|
| FPAY | Fee payment |
Year of fee payment: 4 |
|
| FEPP | Fee payment procedure |
Free format text: PAYER NUMBER DE-ASSIGNED (ORIGINAL EVENT CODE: RMPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY Free format text: PAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY |
|
| FPAY | Fee payment |
Year of fee payment: 8 |
|
| FPAY | Fee payment |
Year of fee payment: 12 |