IP Library Granted Patent US 12,057,168
Granted Patent B2
US 12,057,168 · App. 16/899,860 · Granted Aug 6, 2024

Neighbor aware multi-bias programming in scaled BICS

Inventors: Muhammad Masuduzzaman (Milpitas, CA); Deepanshu Dutta (Fremont, CA)
G11C16/10G11C16/0483G11C16/14G11C16/24G11C16/26G11C16/3459H10B41/10H10B41/27H10B43/10H10B43/27
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,057,168
App. No.
16/899,860
Granted
Aug 6, 2024
Kind
B2
Abstract

A storage device may be configured to determine data states for a first set of memory cells, of an array of memory cells, that are part of a logical N−1 neighboring word line that is adjacent to a selected word line. The storage device may be further configured to determine a program voltage configuration based on the data states. The storage device may be further configured to determine, using the program voltage configuration, a program operation on the selected word line to iteratively program respective memory cells, of a second set of memory cells that are part of the selected word line. Determining the data states, determining the program voltage configuration, and performing the program operation may be repeated until a program stop condition is satisfied.

Claims (14)

1. A method of programming an array of memory cells formed using a set of word lines and a set of bit lines, the method comprising:

determining data states for a first set of memory cells, of the array of memory cells, that are part of a logical N−1 neighboring word line that is adjacent to a selected word line;

determining bit line voltage biases based on the data states; and

performing, using the bit line voltage biases, a program operation on the selected word line to iteratively program respective memory cells, of a second set of memory cells that are part of the selected word line, wherein performing the program operation comprises:

causing a first bit line voltage bias to be applied to a first subset of the first set of memory cells based on the first subset having neighboring memory cells in an erased data state, and

causing a second bit line voltage bias, that is higher than the first bit line voltage bias, to be applied to a second subset of the first set of memory cells based on the second subset having neighboring memory cells in a programmed data state, the first bit line voltage bias and the second bit line voltage bias to eliminate or reduce a natural threshold voltage distribution (NVD) split of the selected word line,

wherein determining the data states, determining the program voltage configuration, and performing the program operation are to be repeated until a program stop condition is satisfied.

2. The method as set forth in claim 1 , wherein performing the program operation comprises:

causing a modified program voltage to be applied to the selected word line during a first iteration of the program operation, the modified program voltage having a value based on a natural threshold voltage distribution (NVD) split associated with the selected word line.

3. The method as set forth in claim 1 , further comprising:

performing a verify operation that includes verifying data states of the respective memory cells, of the second set of memory cells, during select iterations of the verify operation, wherein a frequency at which to verify the data states is based on a natural threshold voltage distribution (NVD) for the selected word line.

4. The method as set forth in claim 1 , wherein the first set of memory cells are programmed using a normal order programming (NOP) scheme and the logical N−1 neighboring word line is a physical N−1 neighboring word line.

5. The method as set forth in claim 1 , wherein the first set of memory cells are programmed using a reverse order programming (ROP) scheme and the logical N−1 neighboring word line is a physical N+1 neighboring word line.

6. The method as set forth in claim 1 , wherein the array of memory cells are part of a group of at least 20 NAND memory strings included in bit cost scalable (BiCS) architecture.

Assignments (4)
SECURITY AGREEMENT Recorded Apr 25, 2025
From: SANDISK TECHNOLOGIES, INC.
To: JPMORGAN CHASE BANK, N.A., AS COLLATERAL AGENT
Reel/Frame 071050/0001 →
PARTIAL RELEASE OF SECURITY INTERESTS Recorded Apr 25, 2025
From: JPMORGAN CHASE BANK, N.A., AS AGENT
To: SANDISK TECHNOLOGIES, INC.
Reel/Frame 071382/0001 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 31, 2024
From: SANDISK TECHNOLOGIES LLC
To: SANDISK TECHNOLOGIES, INC.
Reel/Frame 069796/0423 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 2, 2020
From: MASUDUZZAMAN, MUHAMMAD; DUTTA, DEEPANSHU
To: SANDISK TECHNOLOGIES LLC
Reel/Frame 053672/0398 →
Continuity (1)
Related Publication 20210391012A1 · Dec 16, 2021