Patent Application
20130039138
The present embodiments relate generally to memory and a particular embodiment relates to column redundancy in a memory device.
Flash memory devices have developed into a popular source of non-volatile memory for a wide range of electronic applications. Flash memory devices typically use a one-transistor memory cell that allows for high memory densities, high reliability, and low power consumption. Common uses for flash memory include personal computers, flash drives, digital cameras, and cellular telephones. Program code and system data such as a basic input/output system (BIOS) are typically stored in flash memory devices for use in personal computer systems.
A typical non-volatile memory device is a type of memory in which the array of memory cells is typically organized into memory blocks that can be erased and reprogrammed on block-by-block basis instead of one byte at a time. Changes in a threshold voltage of each of the memory cells, through erasing or programming of a charge storage structure (e.g., floating gate or charge trap) or other physical phenomena (e.g., phase change or polarization), determine the data value of each cell. The data in a cell of this type are determined by the presence or absence of the charge in the charge storage structure.
Non-volatile memory devices typically have a reserved area in the memory array for redundant columns (e.g., bit lines) of memory cells. The redundant columns can be used when a particular address is determined to indicate a defective memory cell (with such an address being sometimes referred to herein as a “defective address”). For example, a bit line-to-bit line shorting condition or a single cell failure can use a redundant column to repair the defective condition.
Mapping a redundant column to a defective column typically comprises comparing each received address to a list of defective addresses while a data load operation is being performed. If an address to be programmed is found to be defective, the system deselects the defective address and selects the corresponding redundant column. Since the comparing is performed in real time as the data to be programmed is loaded into the page buffer, the architecture needs to be fast enough to follow the I/O speed in order to reduce any data bottlenecks. This can result in difficult design constraints for timing purposes.
The redundant column mapping also maps an entire column when only a single memory in a column has been determined to be defective. For example, one defective memory address can result in a byte or more of the redundant column area of the memory array being assigned to repair the defective address. This can result in an ineffective use of redundant columns of memory cells.
For the reasons stated above and for other reasons that will become apparent to those skilled in the art upon reading and understanding the present specification, there is a need in the art for a more efficient scheme for redundancy.
In the following detailed description, reference is made to the accompanying drawings that form a part hereof and in which is shown, by way of illustration, specific embodiments. In the drawings, like numerals describe substantially similar components throughout the several views. Other embodiments may be utilized and structural, logical, and electrical changes may be made without departing from the scope of the present disclosure. The following detailed description is, therefore, not to be taken in a limiting sense.
The memory array 101 comprises an array of non-volatile memory cells (e.g., floating gate) arranged in columns such as series strings 104, 105. Each of the cells is coupled drain to source in each series string 104, 105. An access line (e.g. word line) WL0-WL31 that spans across multiple series strings 104, 105 is coupled to the control gates of each memory cell in a row in order to bias the control gates of the memory cells in the row. Data lines, such as even/odd bit lines BL_E, BL_O, are coupled to the series strings and eventually each bit line is coupled to a page buffer with sense circuitry that detects the state of each cell by sensing current or voltage on a selected bit line.
Each series string 104, 105 of memory cells is coupled to a source line 106 by a source select gate 116, 117 (e.g., transistor) and to an individual bit line BL_E, BL_O by a drain select gate 112, 113 (e.g., transistor). The source select gates 116, 117 are controlled by a source select gate control line SG(S) 118 coupled to their control gates. The drain select gates 112, 113 are controlled by a drain select gate control line SG(D) 114.
Each memory cell can be programmed as a single level cell (SLC) or a multiple level cell (MLC). Each cell's threshold voltage (Vt) is indicative of the data that is stored in the cell. For example, in an SLC, a Vt of 2.5V might indicate a programmed cell while a Vt of −0.5V might indicate an erased cell. An MLC uses multiple Vt ranges that each indicates a different state. Multiple level cells can take advantage of the analog nature of a traditional flash cell by assigning a bit pattern to a specific Vt range. This technology permits the storage of data values representing two or more bits per cell, depending on the quantity of Vt ranges assigned to the cell.
A page buffer 203 is coupled to the memory array 201 and redundant column area 202. The page buffer 203 temporarily stores data that is to be written to the memory array 201 during a programming operation. The data 210 are input from input/output (I/O) connections of the memory device. As will be seen with reference to
An address generator 205 is coupled to the page buffer 203. The address generator 205 generates the addresses for programming data as it is being written to the page buffer 203. Each address determines where in the page buffer associated data is to be programmed. The page buffer addresses are each associated with a respective address in the memory array to which the data are to be programmed.
A defective column memory block 207 is coupled to a state machine 209 that is coupled to the page buffer 203. The defective column memory block 207 stores the column addresses of the memory array 201 that have been determined to indicate a defective memory cell or cells. In one embodiment, the defective column address determination can be accomplished during a self-test of the memory array whenever the memory device 200 is powered-up. An alternate embodiment might determine which cells are defective during manufacture of the memory device and store the addresses of those defective cells in the defective column memory block 207.
The state machine 209 can be hardware, software, or a combination of hardware and software. The state machine 209 can be executed by a controller or the controller along with executable code might be considered a state machine.
In operation, a data load operation occurs prior to the programming of the memory array 201. During the data load operation, the data are stored in the page buffer 203 without any skipping for defective column addresses as is done in the prior art. In other words, the defective address matching is not performed during the data loading operation of the page buffer 203.
The loaded data are confirmed to be properly stored into the page buffer 203. The state machine 209 then maps (e.g., copies) the data from the page buffer addresses associated with defective addresses in the memory array 201 to page buffer addresses associated with redundant memory cells. The state machine can also exclude the defective addresses from the pass/fail checking of the memory array 201. The data are then transferred from the page buffer 203 to the appropriate addresses in the memory array 201 for programming.
Since the state machine 209 manages each bit of the page buffer 203, the illustrated column redundancy scheme can operate on a per bit or per byte basis. The prior art replaced the entire column of memory cells.
In the read operation embodiment of
The state machine can include a memory block 301 (e.g., SRAM) configured to store addresses of the memory determined to indicate defective memory cells. For example, the address might indicate that bit 3 of a particular byte is defective. A BIT/BYTE block 303 is coupled to the memory block 301. The defective address that is read from the memory block 301 is passed 302 to the BIT/BYTE block 303. The BIT/BYTE block 303 provides a logic function (e.g., decoder) that selects the defective bit or byte (e.g., 011 of 00001000), depending on how many bits are defective.
The PB_DRV block 305, coupled between the BIT portion of the BIT/BYTE block 303 and the page buffer 309, provides a driver function to control the page buffer 309. In the present example of bit 3 being defective, the PB_DRV block 305 enables just the bit<3> of page buffer address 00001000.
The COL_DEC block 307, coupled between the BYTE portion of the BIT/BYTE block 303 and the page buffer 309, provides a column decoder function for accessing the page buffer 309. This block 307 generates signals to select the proper byte according to the address from the memory block 301.
If a read operation is being performed, data is read from the memory array 411 and all the data are loaded into the page buffer 413. Unlike the prior art, no address matching is performed at this point and no defective addresses are skipped. Also, when the data are read from the memory array 411, the mapped redundant addresses are read. A read verify is performed to verify that the data have been loaded into the page buffer 415.
The data that were read from the redundant addresses are then mapped (e.g., copied, moved) to the page buffer addresses associated with the originally defective addresses 417. The data are then output over the I/O connections 420.
If a program operation is being performed, data input from the I/O connections are all loaded into the page buffer 403. Unlike the prior art, no address matching is performed at this point and no defective addresses are skipped. The data is then verified to determine that it has been properly loaded into the page buffer 405.
Data that are to be programmed to defective addresses are mapped (e.g., copied, moved) to redundant addresses 407. As shown in
The memory device 500 includes an array 530 of memory cells (e.g., non-volatile memory cells) in accordance with the embodiments of
Address buffer circuitry 540 is provided to latch address signals provided through I/O circuitry 560. Address signals are received and decoded by a row decoder 544 and a column decoder 546 to access the memory array 530.
The memory device 500 reads data in the memory array 530 by sensing voltage or current changes in the memory array columns using sense amplifier circuitry 550. The page buffers 550, in one embodiment, are coupled to read and latch a row of data from the memory array 530. The page buffers 550, as previously described, include the sense circuitry as well as other circuits for performing a program verify operation. Data are input and output through the I/O circuitry 560 for bidirectional data communication as well as the address communication over a plurality of data connections 562 with the controller 510. Write circuitry 555 is provided to write data to the memory array.
Memory control circuitry 570 decodes signals provided on control connections 572 from the processor 510. These signals are used to control the operations on the memory array 530, including data read, data write (program), and erase operations. The memory control circuitry 570 may be a state machine, a sequencer, or some other type of controller to generate the memory control signals. In one embodiment, the memory control circuitry 570 is configured to control execution of the column redundancy embodiments of the present disclosure.
The memory device illustrated in
In summary, one or more embodiments of redundancy provide redundant memory cells for memory cells determined to be defective on a bit-by-bit or byte-by-byte basis. By performing the mapping (e.g., copying, moving) after all the data has been loaded into the page buffer, from either the I/O connections during a program operation or the memory array during a read operation, the need for real time address comparison can be eliminated along with its associated problems.
Although specific embodiments have been illustrated and described herein, it will be appreciated by those of ordinary skill in the art that any arrangement that is calculated to achieve the same purpose may be substituted for the specific embodiments shown. Many adaptations of the invention will be apparent to those of ordinary skill in the art. Accordingly, this application is intended to cover any adaptations or variations of the invention.
