EP3899711B1 - Procédé de programmation d'un dispositif de mémoire à plans multiples - Google Patents

Procédé de programmation d'un dispositif de mémoire à plans multiples Download PDF

Info

Publication number
EP3899711B1
EP3899711B1 EP20913055.8A EP20913055A EP3899711B1 EP 3899711 B1 EP3899711 B1 EP 3899711B1 EP 20913055 A EP20913055 A EP 20913055A EP 3899711 B1 EP3899711 B1 EP 3899711B1
Authority
EP
European Patent Office
Prior art keywords
controller
plane
planes
program
program state
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.)
Active
Application number
EP20913055.8A
Other languages
German (de)
English (en)
Other versions
EP3899711A4 (fr
EP3899711A1 (fr
Inventor
Jialiang DENG
Yu Wang
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Yangtze Memory Technologies Co Ltd
Original Assignee
Yangtze Memory Technologies Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Yangtze Memory Technologies Co Ltd filed Critical Yangtze Memory Technologies Co Ltd
Priority to EP24152294.5A priority Critical patent/EP4332973A3/fr
Publication of EP3899711A1 publication Critical patent/EP3899711A1/fr
Publication of EP3899711A4 publication Critical patent/EP3899711A4/fr
Application granted granted Critical
Publication of EP3899711B1 publication Critical patent/EP3899711B1/fr
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
    • G06F3/0604—Improving or facilitating administration, e.g. storage management
    • G06F3/0607—Improving or facilitating administration, e.g. storage management by facilitating the process of upgrading existing storage systems, e.g. for improving compatibility between host and storage device
    • G—PHYSICS
    • G11—INFORMATION STORAGE
    • G11C—STATIC STORES
    • G11C16/00—Erasable programmable read-only memories
    • G11C16/02—Erasable programmable read-only memories electrically programmable
    • G11C16/06—Auxiliary circuits, e.g. for writing into memory
    • G11C16/34—Determination of programming status, e.g. threshold voltage, overprogramming or underprogramming, retention
    • G11C16/3436—Arrangements for verifying correct programming or erasure
    • G11C16/3454—Arrangements for verifying correct programming or for detecting overprogrammed cells
    • G11C16/3459—Circuits or methods to verify correct programming of nonvolatile memory cells
    • G—PHYSICS
    • G11—INFORMATION STORAGE
    • G11C—STATIC STORES
    • G11C16/00—Erasable programmable read-only memories
    • G11C16/02—Erasable programmable read-only memories electrically programmable
    • G11C16/06—Auxiliary circuits, e.g. for writing into memory
    • G11C16/10—Programming or data input circuits
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F12/00—Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02—Addressing or allocation; Relocation
    • G06F12/0223—User address space allocation, e.g. contiguous or non contiguous base addressing
    • G06F12/023—Free address space management
    • G06F12/0238—Memory management in non-volatile memory, e.g. resistive RAM or ferroelectric memory
    • G06F12/0246—Memory management in non-volatile memory, e.g. resistive RAM or ferroelectric memory in block erasable memory, e.g. flash memory
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0655—Vertical data movement, i.e. input-output transfer; data movement between one or more hosts and one or more storage devices
    • G06F3/0658—Controller construction arrangements
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
    • G06F3/0671—In-line storage system
    • G06F3/0673—Single storage device
    • G06F3/0679—Non-volatile semiconductor memory device, e.g. flash memory, one time programmable memory [OTP]
    • G—PHYSICS
    • G11—INFORMATION STORAGE
    • G11C—STATIC STORES
    • G11C11/00—Digital stores characterised by the use of particular electric or magnetic storage elements; Storage elements therefor
    • G11C11/56—Digital stores characterised by the use of particular electric or magnetic storage elements; Storage elements therefor using storage elements with more than two stable states represented by steps, e.g. of voltage, current, phase, frequency
    • G11C11/5621—Digital stores characterised by the use of particular electric or magnetic storage elements; Storage elements therefor using storage elements with more than two stable states represented by steps, e.g. of voltage, current, phase, frequency using charge storage in a floating gate
    • G11C11/5628—Programming or writing circuits; Data input circuits
    • G—PHYSICS
    • G11—INFORMATION STORAGE
    • G11C—STATIC STORES
    • G11C11/00—Digital stores characterised by the use of particular electric or magnetic storage elements; Storage elements therefor
    • G11C11/56—Digital stores characterised by the use of particular electric or magnetic storage elements; Storage elements therefor using storage elements with more than two stable states represented by steps, e.g. of voltage, current, phase, frequency
    • G11C11/5671—Digital stores characterised by the use of particular electric or magnetic storage elements; Storage elements therefor using storage elements with more than two stable states represented by steps, e.g. of voltage, current, phase, frequency using charge trapping in an insulator
    • G—PHYSICS
    • G11—INFORMATION STORAGE
    • G11C—STATIC STORES
    • G11C16/00—Erasable programmable read-only memories
    • G11C16/02—Erasable programmable read-only memories electrically programmable
    • G11C16/06—Auxiliary circuits, e.g. for writing into memory
    • G11C16/08—Address circuits; Decoders; Word-line control circuits
    • G—PHYSICS
    • G11—INFORMATION STORAGE
    • G11C—STATIC STORES
    • G11C16/00—Erasable programmable read-only memories
    • G11C16/02—Erasable programmable read-only memories electrically programmable
    • G11C16/06—Auxiliary circuits, e.g. for writing into memory
    • G11C16/24—Bit-line control circuits
    • G—PHYSICS
    • G11—INFORMATION STORAGE
    • G11C—STATIC STORES
    • G11C16/00—Erasable programmable read-only memories
    • G11C16/02—Erasable programmable read-only memories electrically programmable
    • G11C16/06—Auxiliary circuits, e.g. for writing into memory
    • G11C16/26—Sensing or reading circuits; Data output circuits
    • 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/50—Marginal testing, e.g. race, voltage or current testing
    • G11C29/50004—Marginal testing, e.g. race, voltage or current testing of threshold voltage
    • 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/70—Masking faults in memories by using spares or by reconfiguring
    • G11C29/88—Masking faults in memories by using spares or by reconfiguring with partially good memories
    • G11C29/883—Masking faults in memories by using spares or by reconfiguring with partially good memories using a single defective memory device with reduced capacity, e.g. half capacity
    • G—PHYSICS
    • G11—INFORMATION STORAGE
    • G11C—STATIC STORES
    • G11C5/00—Details of stores covered by group G11C11/00
    • G11C5/02—Disposition of storage elements, e.g. in the form of a matrix array
    • G11C5/025—Geometric lay-out considerations of storage- and peripheral-blocks in a semiconductor storage device
    • G—PHYSICS
    • G11—INFORMATION STORAGE
    • G11C—STATIC STORES
    • G11C7/00—Arrangements for writing information into, or reading information out from, a digital store
    • G11C7/10—Input/output [I/O] data interface arrangements, e.g. I/O data control circuits, I/O data buffers
    • G11C7/1006—Data managing, e.g. manipulating data before writing or reading out, data bus switches or control circuits therefor
    • G—PHYSICS
    • G11—INFORMATION STORAGE
    • G11C—STATIC STORES
    • G11C8/00—Arrangements for selecting an address in a digital store
    • G11C8/12—Group selection circuits, e.g. for memory block selection, chip selection, array selection
    • G—PHYSICS
    • G11—INFORMATION STORAGE
    • G11C—STATIC STORES
    • G11C16/00—Erasable programmable read-only memories
    • G11C16/02—Erasable programmable read-only memories electrically programmable
    • G11C16/04—Erasable programmable read-only memories electrically programmable using variable threshold transistors, e.g. FAMOS
    • G11C16/0483—Erasable programmable read-only memories electrically programmable using variable threshold transistors, e.g. FAMOS comprising cells having several storage transistors connected in series
    • 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
    • G11C2029/0409—Online test
    • G—PHYSICS
    • G11—INFORMATION STORAGE
    • G11C—STATIC STORES
    • G11C2211/00—Indexing scheme relating to digital stores characterized by the use of particular electric or magnetic storage elements; Storage elements therefor
    • G11C2211/56—Indexing scheme relating to G11C11/56 and sub-groups for features not covered by these groups
    • G11C2211/564—Miscellaneous aspects
    • G11C2211/5642—Multilevel memory with buffers, latches, registers at input or output
    • G—PHYSICS
    • G11—INFORMATION STORAGE
    • G11C—STATIC STORES
    • G11C2211/00—Indexing scheme relating to digital stores characterized by the use of particular electric or magnetic storage elements; Storage elements therefor
    • G11C2211/56—Indexing scheme relating to G11C11/56 and sub-groups for features not covered by these groups
    • G11C2211/564—Miscellaneous aspects
    • G11C2211/5644—Multilevel memory comprising counting devices

Definitions

  • the invention relates to memory control, and in particular, to a method of programming a multi-plane memory device.
  • Non-volatile memory has been used extensively in personal computers, telecommunications, consumer electronics and other fields. Electrically erasable programmable read only memory (EEPROM) and flash memory are among the most widely employed non-volatile memory.
  • EEPROM Electrically erasable programmable read only memory
  • flash memory is among the most widely employed non-volatile memory.
  • Memory devices may be classified into a single-plane type and a multi-plane type in accordance with the structural configuration of memory arrays.
  • the single-plane type memory device includes memory arrays organized into a single plane
  • the multi-plane type memory device includes memory arrays organized into a plurality of planes.
  • two or more memory planes may be programmed simultaneously to enhance the programming efficiency.
  • both the normal memory planes and defective memory planes will be repeatedly programmed in an attempt to program data into the defective memory planes, decreasing the programming speed, reducing the programming efficiency, and increasing program disturbance in the normal memory plane.
  • an apparatus comprising a first plane of memory cells including an associated first buffer; a second plane of memory cells including an associated second buffer; and a controller configured to transfer data corresponding to a first memory state to the first buffer; and to transfer data corresponding to a second memory state to the second buffer.
  • a state machine is configured to apply program pulses to the first and second planes of memory cells; and the read/write circuitry is configured to confirm that the first plane of memory cells has reached the first memory state and independently confirm that the second plane of memory cells has reached the second memory state by determining a number of memory cells in the first plane that have been programmed to the first memory state based on the data transferred to the first buffer and by determining a number of memory cells in the second plane that have been programmed to the second memory state based on the data transferred to the second buffer.
  • US 2017/352430 A1 and US 2019/066736 A1 disclose program-verify methods.
  • embodiments of the invention will be described with reference to a 2-dimentional NAND flash device, it will be understood that embodiments of the present inventive concept are not limited thereto to this configuration but are also applicable to a 3-dimentional NAND flash memory device.
  • the invention is applicable to other nonvolatile memory devices, such as an electrically erasable and programmable read only memory (EEPROM), a NOR flash memory, a phase-change RAM (PRAM), a magnetic RAM (MRAM), a resistive RAM (RRAM), a ferroelectric RAM (FRAM), and the like, without departing from the scope of the present invention.
  • EEPROM electrically erasable and programmable read only memory
  • NOR flash memory NOR flash memory
  • PRAM phase-change RAM
  • MRAM magnetic RAM
  • RRAM resistive RAM
  • FRAM ferroelectric RAM
  • FIG. 1 is a block diagram of a memory device 1 according to an embodiment of the invention.
  • the memory device 1 has a dual-plane structure, and includes a controller 10, a voltage generation circuit 11, a row decoder 12, column drivers 131, 132 and planes 141, 142. While the dual-plane structure is used in the embodiment, it should be appreciated that other numbers of planes may also be adopted within the scope of the invention.
  • the planes 141, 142 are programmed simultaneously. After programming, if the plane 141 or the plane 142 is verified as failed for a predetermined number of times, the row driver 12 may disable the failed plane 141 or 142 from subsequent programming. The disablement of the failed plane reduces the time spent in an attempt to program the same, and reduce program disturbance in the operating plane.
  • the controller 10 may be coupled to the voltage generation circuit 11 and the column drivers 131, 132.
  • the voltage generation circuit 11 may be coupled to the row driver 12.
  • the row driver 12 may be coupled to the plane 142 via a string select line SSL2, word lines WL2(1) to WL2 (N) and a ground select line GSL2.
  • the column driver 132 may be coupled to the plane 142 via bit lines BL2(1) to BL2(M).
  • Each of the planes 141, 142 may contain a plurality of blocks, each block may contain a plurality of pages, and each page may contain an array of memory cells.
  • the array of memory cells in the plane 141 may be addressed by the word lines WL1 (1) to WL1(N) and the bit lines BL1 (1) to BL1(M), and the array of memory cells in the plane 142 may be addressed by the word lines WL2 (1) to WL2 (N) and the bit lines BL2 (1) to BL2 (M) .
  • the controller 10 may communicate with an external host to receive data for storage in the planes 141, 142 and to transmit data fetched from the planes 141, 142.
  • the controller 10 may receive commands, addresses or data from the external host and generate column address signals Scadr1, Scadr2, a row address signal Sradr and a voltage control signal Svc.
  • the voltage generation circuit 11 may generate voltages for read, program, erasure and verification operations in response to the voltage control signal Svc from the controller 10. The voltages generated by the voltage generation circuit 11 may exceed a supply voltage provided to the memory device 1.
  • the row driver 12 may operate in response to the row address signal Sradr from the controller 10 to select word lines for the read, program, erasure and verification operations.
  • the column drivers 131, 132 may operate in response to the column address signals Scadr1, Scadr2 from the controller 10 to generate bit line signals to select bit lines for the read, program, erasure and verification operations .
  • the voltage generation circuit 11 may generate a program voltage (e.g., 20V) and a program pass voltage (e.g., 10V) using the supply voltage (e.g., 3.3V)
  • the row driver 12 may apply a program pulse having the magnitude of the program voltage to selected word lines, apply the program pass voltage to unselected word lines, apply the supply voltage to the string select lines SSL1, SSL2 and apply the ground voltage to the ground select lines GSL1, GSL2, and the column drivers 131, 132 may apply a ground voltage (e.g., 0V) to selected bit lines, and apply the supply voltage to unselected bit lines.
  • the voltage generation circuit 11 may generate an appropriate verification voltage
  • the row driver 12 may apply the appropriate verification voltage to selected word lines, apply the supply voltage to the string select lines SSL1, SSL2 and apply the supply voltage to the ground select lines GSL1, GSL2, and the column drivers 131, 132 may apply the ground voltage to unselected bit lines, and apply the supply voltage to selected bit lines of the planes 141, 142 to read data from selected memory cells on the selected bit lines, respectively. If data read is incorrect, the controller 10 may verify the selected memory cell as failed, and if data read is correct, the controller 10 may verify the selected memory cell as passed.
  • FIG. 2 is a schematic diagram of a page in the planes 141, 142.
  • the page may include memory cells C(1,1) to C(M,N), string select cells Css(1) to Css(M) and ground select cells Cgs(1) to Cgs(M).
  • the memory cells C(1, 1) to C(M,N) may be floating-gate transistors or charge-trapping transistors, and each of the memory cells C (1, 1) to C(M,N), the string select cells Css(1) to Css(M) and the ground select cells Cgs(1) to Cgs(M) may include a control terminal, a first terminal and a second terminal.
  • a string select line SSLn may be coupled to the control terminals of the string select cells Css(1) to Css (M), and the bit lines BL(1) to BL(M) may be respectively coupled to the first terminals of the string select cells Css(1) to Css(M).
  • the memory cells C(1,1) to C(M,N) may be arranged into rows of memory cells coupled to the respective word lines WL(1) to WL(N) .
  • the word lines WL(1) to WL(N) may be coupled to the control terminals of the memory cells C(1,1) to C(M,1) of the first row to the control terminals of the memory cells C(1,N) to C(M,N) of the Nth row, respectively, and the first terminals of the memory cells C(1,1) to C(M,1) may be respectively coupled to the second terminals of the string select cells Css (1) to Css (M) .
  • a ground select line GSLn may be coupled to the control terminals of the ground select cells Cgs(1) to Cgs(M), the first terminals of the ground select cells Cgs(1) to Cgs(M) may be respectively coupled to the second terminals of the memory cells C (1,N) to C (M,N), and the second terminals of the ground select cells Cgs (1) to Cgs (M) may be coupled to ground terminals .
  • the ground terminals may provide the ground voltage.
  • the memory cells C(1,1) to C(M,N) may be of a single-level cell (SLC) type, a multi-level cell (MLC) type, a triple-level cell (TLC) type, a quad-level cell (QLC) type, a penta-level cell (PLC) type, or a higher-level type.
  • the Q possible data states may include an erase state S(0) and program states S(1) to S(Q-1), with the program state S(1) being the lowest program state and the program state S (Q-1) being the highest program state.
  • a TLC may be programmed into one of 8 possible data states, with the program state S (1) being the lowest program state and the program state S(7) being the highest program state.
  • the memory cells C (1, 1) to C (M,N) may be initially set in the erase state S(0), and later, a series of program-verification operations may be performed on the memory cells C(1,1) to C(M,N) to program the same into respective target program states.
  • the series of program-verification operations may start from the lowest program state S (1) and proceed to higher program states until the threshold voltages of selected memory cells reach respective verification voltage levels of respective target program states.
  • the verification voltages may be selected as the minimum threshold voltages of threshold voltage distribution curves of the program states S(1) to S(Q-1), respectively.
  • Each program-verification operation may include a program operation and a subsequent verification operation.
  • some of the memory cells C (1, 1) to C (M,N) may be selected and programmed into a program state in a row-by-row manner from the first row to the Nth row, or from the Nth row to the first row.
  • the controller 10 may verify whether the selected memory cells have reached the program states in the row-by-row manner from the first row to the Nth row, or from the Nth row to the first row. In this fashion, the memory cells C(1,1) to C(M,N) may be programmed into the respective target program states.
  • FIG. 3 is a block diagram of the column drivers 131, 132 and the controller 10.
  • Each of the column drivers 131, 132 may include page buffers 301 to 30n, fail bit counters 321 to 32n and column decoders 341 to 34n.
  • the controller 10 may include an adder 36.
  • the column drivers 131, 132 may further include sense amplifiers to detect currents from the selected bit lines, thereby reading data from the planes 141, 142, respectively.
  • the page buffers 301 to 30n may be coupled to the fail bit counters 321 to 32n, respectively.
  • the fail bit counters 321 to 32n may be coupled to the column decoders 341 to 34n, respectively.
  • the column decoders 341 to 34n may be coupled to the adder 36.
  • the adder 36 may be located in each of the column drivers 131, 132, and may be coupled to the controller 10.
  • the column decoders 341 to 34n may receive column addresses in the column address signals Scadr1, Scadr2 to select bit lines of the planes 141, 142, so as to retrieve data from selected memory cells in the pages of the planes 141, 142 to the page buffers 301 to 30n, respectively.
  • the fail bit counters 321 to 32n may count the number of memory cells verified as failed in the pages of the planes 141, 142 to generate page fail bit counts, respectively.
  • the adder 36 may accumulate page fail bit counts of all pages of the plane 141 to generate a first plane fail bit count, and accumulate page fail bit counts of all pages of the plane 142 to generate a second plane fail bit count.
  • the controller 10 may verify the plane 141 as passed, and if the first plane fail bit count exceeds the preset plane fail bit count, the controller 10 may verify the plane 141 as failed.
  • the controller 10 may verify the plane 142 as passed, and if the second plane fail bit count exceeds the preset plane fail bit count, the controller 10 may verify the plane 142 as failed.
  • the controller 10 may disable the planes 141, 142.
  • the controller 10 may continue to program the planes 141, 142 into the next program state S(q+1) .
  • the controller 10 may generate a fail bit pass signal indicating a program pass, and when both the plane 141 and the plane 142 are verified as failed, the controller 10 may generate a fail bit pass signal indicating a program failure.
  • the fail bit pass signal may be used to determine whether to continue to program the memory device 1.
  • the controller 10 may set the fail bit pass signal to the logical high to continue programming of the memory device 1, and set the fail bit pass signal to the logical low to cease programming of the memory device 1.
  • the controller 10 may further generate a status report indicating a program result upon exiting the program-verification operations.
  • the status report may indicate a program pass.
  • the status report may indicate a program failure.
  • program pulses applied to the memory device 1 exceed a maximum program pulse count, the status report may indicate a program failure.
  • FIG. 4 is a schematic diagram of a selected circuit in the controller 10.
  • the controller 10 may include AND gates 41 and 42 to control access to the planes 141 and 142, respectively.
  • the AND gate 41 may receive a plane address signal Sap1, a fail bit pass signal Sfbp and a plane disable signal Sdisp1 to generate a plane select signal Ssp1.
  • the AND gate 42 may receive a plane address signal Sap2, the fail bit pass signal Sfbp and a plane disable signal Sdisp2 to generate a plane select signal Ssp2.
  • the controller 10 may generate the column address signal Scadr1 according to the plane select signal Ssp1, generate the column address signal Scadr2 according to the plane select signal Ssp2, and generate the row address signal Sradr according to the plane select signals Ssp1, Ssp2.
  • the controller 10 may set the plane disable signal Sdisp1 a logical low, the AND gate 41 may block the plane select signal Ssp1 in response to the plane disable signal Sdisp1 by setting the plane select signal Ssp1 to the logical low, and the controller 10 may generate the row address signal Sradr and the column address signal Scadr1 to deselect the word lines WL1(1) to WL1(N) and the bit lines BL1(1) to BL1(M) of the plane 141.
  • the controller 10 may set the plane disable signal Sdisp2 to the logical low, the AND gate 42 may block the plane select signal Ssp2 in response to the plane disable signal Sdisp2 by setting the plane select signal Ssp2 to the logical low, and the controller 10 may generate the row address signal Sradr and the column address signal Scadr2 to deselect the word lines WL2(1) to WL2(N) and the bit lines BL2(1) to BL2(M) of the plane 142.
  • the AND gate 41 may receive a first block address signal in place of the plane address signal Sap1 to generate a first block select signal
  • the AND gate 42 may receive a second block address signal in place of the plane address signal Sap2 to generate a second block select signal.
  • the controller 10 may generate the column address signal Scadr1 according to the first block select signal, generate the column address signal Scadr2 according to the second block select signal, and generate the row address signal Sradr according to the first block select signal and the second block select signal.
  • the controller 10 may set the plane disable signal Sdisp1 to the logical low, the AND gate 41 may block the first block select signal in response to the plane disable signal Sdisp1 by setting the first block select signal to the logical low, and the controller 10 may generate the row address signal Sradr and the column address signal Scadr1 to deselect the word lines WL1(1) to WL1(N) and the bit lines BL1(1) to BL1(M) of the plane 141.
  • the controller 10 may set the plane disable signal Sdisp2 to the logical low, the AND gate 42 may block the second block select signal in response to the plane disable signal Sdisp2 by setting the second block select signal to the logical low, and the controller 10 may generate the row address signal Sradr and the column address signal Scadr2 to deselect the word lines WL2(1) to WL2(N) and the bit lines BL2(1) to BL2(M) of the plane 142.
  • the controller 10 may employ a program state counter q, failed verification counts Cvf1, Cvf2 and a program pulse count Cp to generate the plane disable signals Sdisp1, Sdisp2 to control access to the planes 141, 142.
  • the program state counter q may be a positive integer ranging between 1 and (Q-1) .
  • the failed verification counts Cvf1, Cvf2 may be positive integers ranging between 1 and a maximum failure count Cvmax(q).
  • the maximum failure count Cvmax(q) may define the maximum number of times to perform verifications of a program state S(q) prior to disabling a plane, and may be specific to the program state S(q).
  • the program states S(1) to S (7) may be assigned maximum failure counts Cvmax (1) to Cvmax (7), respectively.
  • the maximum failure count Cvmax (q) may be a positive integer greater than 1, and may be set during a manufacturing setup.
  • the program pulse count Cp may be positive integers ranging between 1 and a maximum program pulse count Cpmax.
  • the maximum program pulse count Cpmax may define the maximum number of times to apply program pulses to the planes 141, 142, and may be a positive integer greater than 1 and set during the manufacturing setup.
  • the controller 10 may disable the planes 141, 142 for the subsequent programming, thereby accelerating data programming and reducing program disturbance in the operating plane.
  • FIG. 5 is a flowchart of a method 500 of programming the memory device 1.
  • the method 500 comprises Steps S502 to S542, performing multi-plane program on the planes 141, 142 and disabling the planes 141, 142 according to respective failed verification counts Cvf1, Cvf2 of the planes 141, 142.
  • Steps S502 to S508 are used to program and verify the memory device 1.
  • Steps S512 to S516 are used to determine whether to disable the plane 141.
  • Steps S522 to S526 are used to determine whether to disable the plane 142.
  • Steps S532 to S536 are used to complete programming of the program-enabled planes 141, 142.
  • Steps S540 and S542 are used to disable programming of the memory device 1 according to a program pulse count Cp. Any reasonable step change or adjustment is within the scope of the disclosure. Steps S502 to S542 are explained as follows: Step S502: The controller 10 resets the program pulse count Cp, the failed verification counts Cvf1, Cvf2 and the program state counter q; Step S504: The row driver 12 applies a program pulse to the planes 141, 142; Step S506: The controller 10 increments the program pulse count Cp; Step S508: The controller 10 verifies a program state S(q) of the planes 141, 142; Step S510: The controller 10 has verified the plane 141 as failed; Step S512: The controller 10 determines whether the failed verification count Cvf1 is less than a maximum failure count Cvmax (q) ; If so, go to Step S514, and if not, go to Step S516; Step S514: The controller 10 increments the failed verification count Cvf1; Go to
  • Step S534 The controller 10 increments the program state S(q) and resets the failed verification counts Cvf1, Cvf2; Go to Step S540; Step S536: The controller 10 generates the status report indicating a program pass; exit the method 500; Step S540: The controller 10 determines whether the program pulse count Cp is less than the maximum program pulse count Cpmax; If so, go to Step S504, and if not, go to Step S542; Step S542: The controller 10 generates the status report indicating a program failure; exit the method 500.
  • the method 500 may be exemplified using the memory device 1 and TLC memory cells to illustrate details of Steps.
  • the planes 141, 142 are initialized for programming.
  • the controller 10 sets the plane disable signals Sdisp1, Sdisp2 and the fail bit pass signal Sfbp to the logical high, and sets the program pulse count Cp, the failed verification counts Cvf1, Cvf2 to and the program state counter q (S502).
  • the controller 10 verifies if memory cells of the planes 141, 142 has reached the program state S(1) (S508). If more than a preset number of the memory cells of the planes 141, 142 have failed to reach the program state S(1), the controller 10 will verify the planes 141, 142 as failed. If less than the preset number of the memory cells of the planes 141, 142 have failed to reach the program state S(1), the controller 10 will verify the planes 141, 142 as passed.
  • the controller 10 next determines whether the failed verification count Cvf1 is less than a maximum failure count Cvmax(1) of the program state S (1) (S512) .
  • the controller 10 iterates over Steps S504 to S514 and Step S540 until the plane 141 remains verified as failed when the failed verification count Cvf1 reaches 4.
  • Step S504 the controller 10 iterates over Steps S504 to S508, Steps S520 to S524 and Step S540 until the plane 142 remains verified as failed when the failed verification count Cvf2 reaches 4.
  • the controller 10 sets the plane disable signal Sdisp2 to the logical low while maintaining the fail bit pass signal Sfbp to the logical high to disable the plane 142 (S526).
  • the controller 10 next determines whether the program state S(1) is less than the highest program state S(7) (S532).
  • the controller 10 iterates over S504 to S514, Steps S530 to S534, and Step S540 until the plane 141 is disabled, the highest program state S (7) is reached, or the program pulse count Cp reaches the maximum program pulse count Cpmax.
  • the controller 10 sets the plane disable signal Sdisp1 and the fail bit pass signal Sfbp to the logical low, generates a status report indicating that a program failure and exits the method 500 (S516).
  • the controller 10 When the highest program state S(7) is reached, the controller 10 generates the status report indicating that a program pass and exits the method 500 (S536).
  • the controller 10 sets the fail bit pass signal Sfbp to the logic low, generates the status report indicating that a program failure and exits the method 500 (S542).
  • the maximum failure count Cvmax(q) may be identical to or different from other maximum failure counts Cvmax (1) to Cvmax (q-1), Cvmax (q+1) to Cvmax(Q-1).
  • the plane disable signals Sdisp1, Sdisp2 are set to the logical low to set the plane select signals Ssp1, Ssp2 to the logical low, set the first block select signal or the second block select signal to the logical low, or set other signals controlling the word lines WL1(1) to WL1(N), WL2 (1) to WL2 (N), the bit lines BL1(1) to BL1(M), BL2(1) to BL2(M), the string select lines SSL1, SSL2, and the ground select lines GSL1, GSL2 to the logical low.
  • the fail bit pass signal Sfbp may be set to the logical high to continue programming of the memory device 1.
  • the method 500 is used to identify a failed plane upon verifying the plane as failed for a predetermined number of times, and disable the failed plane while continuing to program the operating plane, thereby accelerating data programming and reducing program disturbance in the operating plane.
  • FIG. 6 is a flowchart of a method 600 of programming the memory device 1.
  • the method 600 comprises Steps S602 to S616, disabling the planes 141, 142 according to respective failed verification counts Cvf1, Cvf2 of the plane 141/142.
  • Steps S602 and S604 are used to program and verify the memory device 1.
  • Steps S606 to S610 are used to determine whether to disable the plane 141/142.
  • Steps S612 to S616 are used to continue to complete programming of the program-enabled planes 141, 142. Any reasonable step change or adjustment is within the scope of the disclosure.
  • Step S602 The row driver 12 applies a program pulse to a plurality of memory cells of the planes 141, 142;
  • Step S604 The controller 10 verifies if the plurality of memory cells have reached a predetermined program state S (q) ; if so, go to Step S612, and if not, go to Step S606;
  • Step S606 The controller 10 determines whether a preset number of the plurality of memory cells have failed to reach the predetermined program state S (q) for a predetermined number of times Cvmax (q) ; if so, go to Step S608, and if not, go to Step S610;
  • Step S608 The controller 10 disables the planes 141, 142; exit the method 600.
  • Step S610 The controller 10 increments the failed verification counts Cvf1, Cvf2; go to Step S602;
  • Step S612 The controller 10 determines whether the predetermined program state S (q) is the highest program state S(Q-1) ? if so, go to Step S614, and if not, go to Step S616;
  • Step S614 The controller 10 disables the planes 141, 142; exit the method 600.
  • Step S616 The controller 10 sets the predetermined program state S(q) to the next program state S(q+1); go to Step S602.
  • Steps S602 to S616 have been provided in the preceding paragraphs and will not be repeated here.
  • the controller 10 may disable the failed planes 141, 142 for the subsequent programming, thereby accelerating data programming and reducing program disturbance in the operating plane.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Microelectronics & Electronic Packaging (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Human Computer Interaction (AREA)
  • Computer Hardware Design (AREA)
  • Read Only Memory (AREA)
  • Techniques For Improving Reliability Of Storages (AREA)
  • For Increasing The Reliability Of Semiconductor Memories (AREA)

Claims (11)

  1. Procédé (500, 600) de programmation d'un dispositif de mémoire (1), le dispositif de mémoire (1) comprenant une pluralité de plans (141, 142), un pilote de rangée (12) et un contrôleur (10), le procédé (500, 600) comprenant les étapes consistant à :
    dans une opération de programmation, appliquer, via le pilote de rangée (12), une impulsion de programmation à une pluralité de cellules de mémoire (C(1, 1) à C(M, N)) de chacun de la pluralité de plans (141, 142) ;
    après l'étape consistant à appliquer, via le pilote de rangée (12), l'impulsion de programmation (12) à la pluralité de cellules de mémoire (C(1, 1) à C(M, N)), vérifier, via le contrôleur (10), si la pluralité de cellules de mémoire (C(1, 1) à C(M, N)) du premier plan (141) parmi la pluralité de plans (141, 142) ont atteint un état de programmation prédéterminé (S(1) à S(Q-1)) ; et
    si un nombre prédéfini de la pluralité de cellules de mémoire (C(1, 1) à C(M, N)) du premier plan (141) a échoué à atteindre l'état de programmation prédéterminé (S(1) à S(Q-1)) après que la pluralité de cellules de mémoire (C(1, 1) à C(M, N)) ont été vérifiées un nombre prédéterminé de fois, désactiver, via le contrôleur (10), le premier plan (141) parmi la pluralité de plans (141, 142).
  2. Procédé (500, 600) selon la revendication 1, comprenant en outre l'étape consistant à :
    incrémenter, via le contrôleur (10), un décompte d'échecs de vérification (Cvf1, Cvf2) quand le nombre prédéfini de la pluralité de cellules de mémoire (C(1, 1) à C(M, N)) n'ont pas atteint l'état de programmation prédéterminé (S(1) à S(Q-1)).
  3. Procédé (500, 600) selon la revendication 1, dans lequel, pour des cellules multiniveaux, des nombres prédéterminés de fois associés à des échecs de vérification de l'état de programmation prédéterminé (S(1) à S(Q-1)) et d'un autre état de programmation (S(1) à S(Q-1)) sont identiques.
  4. Procédé (500, 600) selon la revendication 1, dans lequel, pour des cellules multiniveaux, des nombres prédéterminés de fois associés à des échecs de vérification de l'état de programmation prédéterminé (S(1) à S(Q-1)) et d'un autre état de programmation (S(1) à S(Q-1)) sont différents.
  5. Procédé (500, 600) selon la revendication 1, dans lequel l'étape consistant à, via le contrôleur (10), désactiver le premier plan (141) comprend :
    de bloquer, via le contrôleur (10), un signal de sélection de plan (Ssp1, Ssp2).
  6. Procédé (500, 600) selon la revendication 1, dans lequel l'étape consistant à, via le contrôleur (10), désactiver le premier plan (141) comprend :
    de bloquer, via le contrôleur (10), un signal de sélection de blocs.
  7. Procédé (500, 600) selon la revendication 1, dans lequel l'étape consistant à, via le contrôleur (10), désactiver le premier plan (141) comprend :
    de désélectionner, via le contrôleur (10), toutes les lignes de mots (WL1 (1) à WL1 (N)) du premier plan (141).
  8. Procédé (500, 600) selon la revendication 1, dans lequel l'étape consistant à, via le contrôleur (10), désactiver le premier plan (141) comprend :
    de désélectionner, via le contrôleur (10), toutes les lignes de bit (BL1 (1) à BL1 (M)) du premier plan (141).
  9. Procédé (500, 600) selon la revendication 1, dans lequel l'étape consistant à, via le contrôleur (10), désactiver le premier plan (141) comprend :
    de définir, via le contrôleur (10), un signal de réussite de décompte de bits d'échec (Sfbp) pour continuer à programmer le dispositif de mémoire (1).
  10. Procédé (500, 600) selon la revendication 1, comprenant en outre l'étape consistant à :
    définir, via le contrôleur (10), l'état de programmation prédéterminé (S(1) à S(Q-1)) un état de programmation suivant (S(1) à S(Q-1)) quand l'un de la pluralité de plans (141, 142) a réussi une vérification de l'état de programmation prédéterminé (S(1) à S(Q-1)) et que l'état de programmation prédéterminé (S(1) à S(Q-1)) n'est pas un état de programmation le plus élevé (S(1) à S(Q-1)).
  11. Procédé (500, 600) selon la revendication 1, comprenant en outre l'étape consistant à :
    désactiver, via le contrôleur (10), la pluralité de plans (141, 142) quand l'un de la pluralité de plans (141, 142) a réussi des vérifications de l'état de programmation prédéterminé (S(1) à S(Q-1)) et que l'état de programmation prédéterminé (S(1) à S(Q-1)) est un état de programmation le plus élevé (S(1) à S(Q-1)).
EP20913055.8A 2020-02-20 2020-02-20 Procédé de programmation d'un dispositif de mémoire à plans multiples Active EP3899711B1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
EP24152294.5A EP4332973A3 (fr) 2020-02-20 2020-02-20 Procédé de programmation d'un dispositif de mémoire multi-plan

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2020/075936 WO2021163945A1 (fr) 2020-02-20 2020-02-20 Procédé de programmation d'un dispositif de mémoire à plans multiples

Related Child Applications (1)

Application Number Title Priority Date Filing Date
EP24152294.5A Division EP4332973A3 (fr) 2020-02-20 2020-02-20 Procédé de programmation d'un dispositif de mémoire multi-plan

Publications (3)

Publication Number Publication Date
EP3899711A1 EP3899711A1 (fr) 2021-10-27
EP3899711A4 EP3899711A4 (fr) 2022-07-27
EP3899711B1 true EP3899711B1 (fr) 2024-02-07

Family

ID=71197892

Family Applications (2)

Application Number Title Priority Date Filing Date
EP20913055.8A Active EP3899711B1 (fr) 2020-02-20 2020-02-20 Procédé de programmation d'un dispositif de mémoire à plans multiples
EP24152294.5A Pending EP4332973A3 (fr) 2020-02-20 2020-02-20 Procédé de programmation d'un dispositif de mémoire multi-plan

Family Applications After (1)

Application Number Title Priority Date Filing Date
EP24152294.5A Pending EP4332973A3 (fr) 2020-02-20 2020-02-20 Procédé de programmation d'un dispositif de mémoire multi-plan

Country Status (7)

Country Link
US (3) US11133077B2 (fr)
EP (2) EP3899711B1 (fr)
JP (1) JP7186892B2 (fr)
KR (1) KR20210109593A (fr)
CN (2) CN111356980B (fr)
TW (1) TWI747219B (fr)
WO (1) WO2021163945A1 (fr)

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111356980B (zh) * 2020-02-20 2021-03-12 长江存储科技有限责任公司 对多平面存储器件进行编程的方法
CN114171092A (zh) * 2020-04-23 2022-03-11 长江存储科技有限责任公司 存储器件及其编程方法
US11657883B2 (en) * 2021-07-22 2023-05-23 Western Digital Technologies, Inc. Isolating problematic memory planes to avoid neighbor plan disturb
JP2023554144A (ja) * 2021-08-30 2023-12-26 長江存儲科技有限責任公司 メモリデバイス、メモリデバイスを動作させるための方法、メモリシステム
WO2023028898A1 (fr) * 2021-08-31 2023-03-09 长江存储科技有限责任公司 Procédé de programmation pour appareil de stockage, appareil de stockage et système de stockage
CN113539336B (zh) * 2021-09-14 2021-12-14 浙江地芯引力科技有限公司 存储器电路系统、设备及写入方法
US11967383B2 (en) * 2022-01-20 2024-04-23 Western Digital Technologies, Inc. Non-volatile memory with enhanced program operation for last state on slow plane
US11862256B2 (en) 2022-02-22 2024-01-02 Sandisk Technologies Llc Non-volatile memory with plane independent screening

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20170352430A1 (en) * 2016-06-03 2017-12-07 Sandisk Technologies Llc Non-volatile memory with customized control of injection type of disturb during program verify for improved program performance
US20190066736A1 (en) * 2017-08-31 2019-02-28 Tyson M. Stichka Nand cell encoding to improve data integrity

Family Cites Families (35)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH1055688A (ja) * 1996-08-12 1998-02-24 Sony Corp 不揮発性半導体記憶装置
KR100335769B1 (ko) * 1999-12-29 2002-05-09 박종섭 플래쉬 메모리 소자의 프로그램 방법
US6504742B1 (en) * 2001-10-31 2003-01-07 Hewlett-Packard Company 3-D memory device for large storage capacity
US6920523B2 (en) * 2002-10-07 2005-07-19 Infineon Technologies Ag Bank address mapping according to bank retention time in dynamic random access memories
US7139864B2 (en) * 2003-12-30 2006-11-21 Sandisk Corporation Non-volatile memory and method with block management system
KR100590388B1 (ko) * 2005-03-10 2006-06-19 주식회사 하이닉스반도체 멀티-플레인 타입 플래쉬 메모리 장치와, 그 프로그램 동작및 리드 동작 제어 방법
KR100892405B1 (ko) * 2005-03-31 2009-04-10 샌디스크 코포레이션 메모리 셀들의 서브세트들에 대한 개별 검증 및 추가소거를 이용한 비휘발성 메모리의 소프트 프로그래밍
JP5112086B2 (ja) * 2007-01-17 2013-01-09 株式会社東芝 半導体記憶装置
US7768836B2 (en) * 2008-10-10 2010-08-03 Sandisk Corporation Nonvolatile memory and method with reduced program verify by ignoring fastest and/or slowest programming bits
US8174895B2 (en) * 2009-12-15 2012-05-08 Sandisk Technologies Inc. Programming non-volatile storage with fast bit detection and verify skip
KR101088450B1 (ko) * 2009-12-31 2011-12-01 주식회사 하이닉스반도체 반도체 메모리 장치
US9122476B2 (en) * 2010-12-07 2015-09-01 Advanced Micro Devices, Inc. Programmable atomic memory using hardware validation agent
US9003102B2 (en) * 2011-08-26 2015-04-07 Sandisk Technologies Inc. Controller with extended status register and method of use therewith
JP5249394B2 (ja) 2011-09-28 2013-07-31 ウィンボンド エレクトロニクス コーポレーション 半導体記憶装置
KR101855169B1 (ko) * 2011-10-13 2018-05-09 삼성전자주식회사 불휘발성 메모리 장치, 불휘발성 메모리 장치의 프로그램 방법, 불휘발성 메모리 장치를 포함하는 메모리 시스템
KR20130072667A (ko) * 2011-12-22 2013-07-02 에스케이하이닉스 주식회사 반도체 메모리 장치 및 이의 동작방법
US9043661B2 (en) * 2012-05-30 2015-05-26 Micron Technology, Inc. Memories and methods for performing column repair
KR102137075B1 (ko) * 2013-09-10 2020-07-23 에스케이하이닉스 주식회사 반도체 메모리 장치 및 그 프로그램 방법
KR102235492B1 (ko) * 2014-08-25 2021-04-05 삼성전자주식회사 불휘발성 메모리 장치 및 그것의 프로그램 검증 방법
KR20160072706A (ko) * 2014-12-15 2016-06-23 에스케이하이닉스 주식회사 반도체 장치 및 이의 동작 방법
US9672920B2 (en) * 2015-03-13 2017-06-06 Macronix International Co., Ltd. Electronic device, non-volatile memorty device, and programming method
TWI537964B (zh) * 2015-04-20 2016-06-11 華邦電子股份有限公司 反及閘快閃記憶體和其操作方法
US9570179B2 (en) * 2015-04-22 2017-02-14 Sandisk Technologies Llc Non-volatile memory with two phased programming
KR102313017B1 (ko) * 2015-08-21 2021-10-18 삼성전자주식회사 불휘발성 메모리 장치 및 불휘발성 메모리 장치의 쓰기를 제어하는 컨트롤러를 포함하는 스토리지 장치 및 스토리지 장치의 동작 방법
KR102391514B1 (ko) * 2015-11-04 2022-04-27 삼성전자주식회사 메모리 장치 및 메모리 장치의 동작 방법
KR102651425B1 (ko) * 2016-06-30 2024-03-28 에스케이하이닉스 주식회사 메모리 시스템 및 메모리 시스템의 동작 방법
KR20180062158A (ko) * 2016-11-30 2018-06-08 삼성전자주식회사 루프 상태 정보를 생성하는 불휘발성 메모리 장치, 그것을 포함하는 저장 장치 및 그것의 동작 방법
CN110800275B (zh) * 2017-05-31 2022-09-23 微软技术许可有限责任公司 Ipsec地理冗余的解耦控制和数据平面同步
CN109509503B (zh) * 2017-09-14 2021-07-16 旺宏电子股份有限公司 编程非易失性存储器的方法及存储器系统
US10134474B1 (en) 2017-10-20 2018-11-20 Sandisk Technologies Llc Independent state completion for each plane during flash memory programming
CN108549588A (zh) * 2018-03-27 2018-09-18 深圳忆联信息系统有限公司 一种消除tlc闪存多片编程失败的方法
CN110400594A (zh) * 2018-04-24 2019-11-01 中国科学院微电子研究所 一种闪存存储器及其编程验证系统和编程验证方法
US10726923B2 (en) * 2018-11-21 2020-07-28 Sandisk Technologies Llc Bias scheme for dummy lines of data storage devices
CN110619916A (zh) * 2019-08-12 2019-12-27 长江存储科技有限责任公司 存储器编程方法、装置、电子设备及可读存储介质
CN111356980B (zh) * 2020-02-20 2021-03-12 长江存储科技有限责任公司 对多平面存储器件进行编程的方法

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20170352430A1 (en) * 2016-06-03 2017-12-07 Sandisk Technologies Llc Non-volatile memory with customized control of injection type of disturb during program verify for improved program performance
US20190066736A1 (en) * 2017-08-31 2019-02-28 Tyson M. Stichka Nand cell encoding to improve data integrity

Also Published As

Publication number Publication date
JP7186892B2 (ja) 2022-12-09
US11133077B2 (en) 2021-09-28
WO2021163945A1 (fr) 2021-08-26
CN112965667A (zh) 2021-06-15
US20230368853A1 (en) 2023-11-16
US20210383882A1 (en) 2021-12-09
CN111356980B (zh) 2021-03-12
EP3899711A4 (fr) 2022-07-27
EP4332973A2 (fr) 2024-03-06
KR20210109593A (ko) 2021-09-06
EP4332973A3 (fr) 2024-05-01
CN111356980A (zh) 2020-06-30
EP3899711A1 (fr) 2021-10-27
JP2022524728A (ja) 2022-05-10
TW202133168A (zh) 2021-09-01
US11776641B2 (en) 2023-10-03
US20210264994A1 (en) 2021-08-26
TWI747219B (zh) 2021-11-21

Similar Documents

Publication Publication Date Title
EP3899711B1 (fr) Procédé de programmation d'un dispositif de mémoire à plans multiples
US11011233B2 (en) Nonvolatile memory device, storage device including nonvolatile memory device, and method of accessing nonvolatile memory device
US7558114B2 (en) Flash memory device capable of improving reliability
EP1894206B1 (fr) Effacement de blocs memoire dans un dispositif de memoire flash
US10699788B2 (en) Non-volatile memory device and operating method thereof for performing an erase detect operation
CN110622249B (zh) 数据存储装置
KR20100034048A (ko) 메모리 프로그래밍을 위한 디바이스
US9437321B2 (en) Error detection method
US7450417B2 (en) Nonvolatile semiconductor memory device
CN107430878B (zh) 非易失性存储系统和方法
US11139029B2 (en) Memory device and programming method thereof
US20230143677A1 (en) Methods for programming a memory device, memory devices, and memory systems
US20230207015A1 (en) Memory device and programming method thereof
TWI740780B (zh) 半導體儲存裝置以及讀出方法
KR20210085842A (ko) 메모리 장치

Legal Events

Date Code Title Description
STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: UNKNOWN

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE INTERNATIONAL PUBLICATION HAS BEEN MADE

PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE

17P Request for examination filed

Effective date: 20210719

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

REG Reference to a national code

Ref document number: 602020025484

Country of ref document: DE

Ref country code: DE

Ref legal event code: R079

Free format text: PREVIOUS MAIN CLASS: G06F0003060000

Ipc: G11C0016340000

A4 Supplementary search report drawn up and despatched

Effective date: 20220628

RIC1 Information provided on ipc code assigned before grant

Ipc: G11C 29/04 20060101ALI20220622BHEP

Ipc: G11C 29/00 20060101ALI20220622BHEP

Ipc: G11C 29/50 20060101ALI20220622BHEP

Ipc: G11C 16/24 20060101ALI20220622BHEP

Ipc: G11C 16/10 20060101ALI20220622BHEP

Ipc: G11C 16/08 20060101ALI20220622BHEP

Ipc: G11C 16/04 20060101ALI20220622BHEP

Ipc: G11C 11/56 20060101ALI20220622BHEP

Ipc: G11C 8/12 20060101ALI20220622BHEP

Ipc: G11C 7/10 20060101ALI20220622BHEP

Ipc: G11C 5/02 20060101ALI20220622BHEP

Ipc: G11C 16/34 20060101AFI20220622BHEP

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: EXAMINATION IS IN PROGRESS

17Q First examination report despatched

Effective date: 20230403

DAV Request for validation of the european patent (deleted)
DAX Request for extension of the european patent (deleted)
GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: GRANT OF PATENT IS INTENDED

INTG Intention to grant announced

Effective date: 20231011

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE PATENT HAS BEEN GRANTED

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602020025484

Country of ref document: DE

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

P01 Opt-out of the competence of the unified patent court (upc) registered

Effective date: 20240228

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20240227

Year of fee payment: 5

Ref country code: GB

Payment date: 20240228

Year of fee payment: 5

REG Reference to a national code

Ref country code: LT

Ref legal event code: MG9D

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 20240306

Year of fee payment: 5

REG Reference to a national code

Ref country code: NL

Ref legal event code: MP

Effective date: 20240207

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20240607