10990475

Read Level Edge Find Operations in a Memory Sub-System

PublishedApril 27, 2021
Assigneenot available in USPTO data we have
Technical Abstract

Patent Claims
20 claims

Legal claims defining the scope of protection, as filed with the USPTO.

1

1. A memory system comprising: one or more memory devices; and a processing device coupled to the one or more memory devices, wherein the processing device is to receive a request to locate one or more distribution edges of one or more programming distributions of a memory cell, the request specifying a target bit error rate (BER) for the one or more programming distributions, wherein the processing device, in response to the request, is to: select a first programming distribution for which to locate a first distribution edge; measure a first BER sample of the first programing distribution using a first offset value that is offset from a first center value corresponding to a first read level threshold; measure a second BER sample of the first programming distribution using a second offset value that is offset from the first offset value; determine that the second BER sample exceeds the target BER and the first BER sample does not exceed the target BER; and determine a first location of the first distribution edge at the target BER by interpolating between the first BER sample and the second BER sample.

2

2. The memory system of claim 1 , wherein the processing device, in response to the request, is further to: measure a third BER sample of the first programing distribution using a third offset value that is offset from a second center offset value of a second read level threshold, the second read level threshold being on an opposite side of the first programming distribution; measure a fourth BER sample of the first programming distribution using a fourth offset value that is offset from the third offset value; determine that the fourth BER sample exceeds the target BER and the third BER sample does not exceed the target BER; and determine a second location of a second distribution edge of the first programming distribution at the target BER by interpolating between the third BER sample and the fourth BER sample.

3

3. The memory system of claim 2 , wherein the processing device is to determine a distribution width of the first programming distribution using the first location of the first distribution edge and the second location of the second distribution edge.

4

4. The memory system of claim 3 , wherein the processing device is further to: determine a third location of a third distribution edge of a second programming distribution by interpolating between two BER samples where one of the two BER samples exceeds the target BER; determine a fourth location of a fourth distribution edge of the second programming distribution by interpolating between two BER samples where one of the two BER samples exceeds the target BER; determine a second distribution width of the second programming distribution using the third location of the third distribution edge and the fourth location of the fourth distribution edge; and determine a total distribution level width using the distribution width of the first programming distribution and the second distribution width of the second programming distribution.

5

5. The memory system of claim 1 , wherein the processing device, in response to the request, is further to: select a second programming distribution for which to locate a third distribution edge, the second programming distribution being adjacent to the first programming distribution; measure a third BER sample of the second programing distribution using a third offset value that is offset from the first center offset value corresponding to the first read level threshold; measure a fourth BER sample of the second programming distribution using a fourth offset value that is offset from the third offset value; determine that the fourth BER sample exceeds the target BER and the third BER sample does not exceed the target BER; and determine a third location of the third distribution edge at the target BER by interpolating between the third BER sample and the fourth BER sample.

6

6. The memory system of claim 5 , wherein the processing device is to determine a first valley margin between the first programming distribution and the second programming distribution using the first location of the first distribution edge and the third location of the third distribution edge.

7

7. The memory system of claim 6 , wherein the processing device is to: determine a fourth location of a fourth distribution edge of the second programming distribution by interpolating between two BER samples where one of the two BER samples exceeds the target BER; determine a fifth location of a fifth distribution edge of a third programming distribution by interpolating between two BER samples where one of the two BER samples exceeds the target BER, the third programming distribution being adjacent to the second programming distribution; determine a second valley margin between the second programming distribution and the third programming distribution using the fourth location of the fourth distribution edge and the fifth location of the fifth distribution edge; and determine a read window budget using the first valley margin and the second valley margin.

8

8. The memory system of claim 1 , wherein the processing device, to determine the first location of the first distribution edge, is to: calculate a first fractional increment location by dividing a first difference between the target BER and the first BER sample by a second difference between the second BER sample and the target BER; add the first fractional increment location to the first BER sample to obtain a first value; add the first value to the first center value to obtain a second value; and multiply the second value by a voltage resolution to obtain the first location of the first distribution edge.

9

9. The memory system of claim 1 , wherein the first read level threshold corresponds to a specified page of a specified page type, wherein the processing device, to measure the first BER sample, is to read the first BER sample for the specified page, wherein the processing device is to compare the first BER sample against the target BER and increment the first offset value to the second offset value in response to the first BER not exceeding the target BER, wherein the processing device, to measure the second BER sample, is to read the second BER sample for the specified page, and wherein the processing device, to determine that the second BER sample exceeds the target BER, is to compare the second BER sample against the target BER.

10

10. The memory system of claim 9 , wherein the processing device, in response to the request and prior to the first BER sample being measured, is further to: measure a third BER sample of the first programming distribution using a third offset value that is offset from the first center value; compare the third BER sample against the target BER; and increment the third offset value to the first offset value or to an intervening offset value between the first offset value and the third offset value.

11

11. A method comprising: receiving a request to locate one or more distribution edges of one or more programming distributions of a memory cell, the request specifying a target bit error rate (BER) for the one or more programming distributions; selecting a first programming distribution for which to locate a first distribution edge; measuring a first BER sample of the first programing distribution using a first offset value that is offset from a first center value corresponding to a first read level threshold; measuring a second BER sample of the first programming distribution using a second offset value that is offset from the first offset value; determining that the second BER sample exceeds the target BER and the first BER sample does not exceed the target BER; and determining a first location of the first distribution edge at the target BER by interpolating between the first BER sample and the second BER sample.

12

12. The method of claim 11 , further comprising: measuring a third BER sample of the first programing distribution using a third offset value that is offset from a second center offset value of a second read level threshold, the second read level threshold being on an opposite side of the first programming distribution; measuring a fourth BER sample of the first programming distribution using a fourth offset value that is offset from the third offset value; determining that the fourth BER sample exceeds the target BER and the third BER sample does not exceed the target BER; determining a second location of a second distribution edge of the first programming distribution at the target BER by interpolating between the third BER sample and the fourth BER sample; and determining a distribution width of the first programming distribution using the first location of the first distribution edge and the second location of the second distribution edge.

13

13. The method of claim 12 , further comprising: determining a third location of a third distribution edge of a second programming distribution by interpolating between two BER samples where one of the two BER samples exceeds the target BER; determining a fourth location of a fourth distribution edge of the second programming distribution by interpolating between two BER samples where one of the two BER samples exceeds the target BER; determining a second distribution width of the second programming distribution using the third location of the third distribution edge and the fourth location of the fourth distribution edge; and determining a total distribution level width using the distribution width of the first programming distribution and the second distribution width of the second programming distribution.

14

14. The method of claim 11 , further comprising: selecting a second programming distribution for which to locate a third distribution edge, the second programming distribution being adjacent to the first programming distribution; measuring a third BER sample of the second programing distribution using a third offset value that is offset from the first center offset value corresponding to the first read level threshold; measuring a fourth BER sample of the second programming distribution using a fourth offset value that is offset from the third offset value; determining that the fourth BER sample exceeds the target BER and the third BER sample does not exceed the target BER; determining a third location of the third distribution edge at the target BER by interpolating between the third BER sample and the fourth BER sample; and determining a first valley margin between the first programming distribution and the second programming distribution using the first location of the first distribution edge and the third location of the third distribution edge.

15

15. The method of claim 14 , further comprising: determining a fourth location of a fourth distribution edge of the second programming distribution by interpolating between two BER samples where one of the two BER samples exceeds the target BER; determining a fifth location of a fifth distribution edge of a third programming distribution by interpolating between two BER samples where one of the two BER samples exceeds the target BER, the third programming distribution being adjacent to the second programming distribution; determining a second valley margin between the second programming distribution and the third programming distribution using the fourth location of the fourth distribution edge and the fifth location of the fifth distribution edge; and determining a read window budget using the first valley margin and the second valley margin.

16

16. The method of claim 11 , wherein the determining the first location of the first distribution edge comprises: calculating a first fractional location by dividing a first difference between the target BER and the first BER sample by a second difference between the second BER sample and the target BER; adding the first fractional location to the first BER sample to obtain a first value; adding the first value to the first center value to obtain a second value; and multiplying the second value by a voltage resolution to obtain the first location of the first distribution edge.

17

17. The method of claim 11 , further comprising: measuring a third BER sample of the first programming distribution using a third offset value that is offset from the first center value prior to the measuring the first BER sample; comparing the third BER sample against the target BER; and incrementing the third offset value to the first offset value or to an intervening offset value between the first offset value and the third offset value.

18

18. The method of claim 11 , wherein the measuring the first BER sample comprise reading the first BER sample for a specified page of a specified page type, wherein the determining that the second BER sample exceeds the target BER and the first BER sample does not exceed the target BER comprises: comparing the first BER sample against the target BER; incrementing the first offset value to the second offset value in response to the first BER not exceeding the target BER; and comparing the second BER sample against the target BER.

19

19. A system comprising: a host system; and a memory sub-system coupled to the host system, wherein the memory sub-system comprises: one or more memory devices; and a processing device coupled to the one or more memory devices, wherein the processing device is to receive a request from the host system to calculate a read window budget (RWB) of a memory cell, the request specifying a target bit error rate (BER) for a plurality of programming distributions of the memory cell, wherein the processing device, in response to the request, is to: determine a location for each distribution edge of each of the plurality of programming distributions, wherein to determine the location of a respective distribution edge, the processing device is to: iteratively measure BER samples of a respective side of a respective programming distribution until a first BER sample exceeds the target BER; and determine the location of the respective distribution edge by interpolating a fractional location between the first BER sample that exceeds the target BER and a second BER sample that does not exceed the target BER; measure a valley margin of a valley between each pair of the plurality of programming distributions using the locations of respective distribution edges at a respective valley; calculate the RWB of the memory cell by summing the valley margins between the plurality of programing distributions; and send the RWB to the host system.

20

20. The system of claim 19 , wherein the processing device is further to: receive a second request from the host system to calculate a total distribution level width of the memory cell, the second request specifying the target BER; measure a distribution width of each of the plurality of programming distributions using the locations of respective distribution edges of a respective programming distribution; calculate the total distribution level width of the memory cell by summing distribution widths of the plurality of programing distributions; and send the total distribution level width to the host system.

Patent Metadata

Filing Date

Unknown

Publication Date

April 27, 2021

Inventors

Bruce A. Liikanen
Larry J. Koudele

Want to explore more patents?

Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.

Citation & reuse

Analysis on this page is generated by Patentable — an AI-powered patent intelligence platform. AI-generated summaries, explanations, and analysis may be reused with attribution and a visible link back to the canonical URL below. Patent abstracts and claims are USPTO public domain.

Cite as: Patentable. “READ LEVEL EDGE FIND OPERATIONS IN A MEMORY SUB-SYSTEM” (10990475). https://patentable.app/patents/10990475

© 2026 Patentable. All rights reserved.

Patentable is a research and drafting-assistant tool, not a law firm, and does not provide legal advice. Documents we generate are drafts for review by a licensed patent attorney.

READ LEVEL EDGE FIND OPERATIONS IN A MEMORY SUB-SYSTEM — Bruce A. Liikanen | Patentable