16869424

Paragraph Number

159

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.

Added by DJM 12 2021