Paragraph 159
Paragraph 159
Application
Calibrating non-volatile memory read thresholds
Matter Number
US10998041B1
Paragraph Number
159
Application Number
16869424
Reference Case 1
US10998041B1
Reference Case 2
—
Created
12/22/21, 12:00 AM
Modified
12/22/21, 12:00 AM
Id
6,399
Content
By way of example, a valley search operation may iteratively determine an optimal read level for each of read level A 406, read level D 412, read level F 416, and read level K 426. For read level A 406, suppose the default read level is candidate read level #5 and memory state Er has moved up, shifted to the right and memory state A has shifted to the left, moved down. After determining how many memory cells candidate read level #5 activates (or alternatively how many bit errors are in a code word when read level A 406 is a candidate read level #5), the valley search operation may next check a next highest candidate read level #6 or check a next lowest candidate read level #4.
Notes
Added by DJM 12 2021