Detecting the completion of programming for non-volatile...

Static information storage and retrieval – Floating gate – Particular biasing

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C365S185180, C365S236000

Reexamination Certificate

active

08054691

ABSTRACT:
A set of non-volatile storage elements are subjected to a programming process in order to store data. During the programming process, one or more verification operations are performed to determine whether the non-volatile storage elements have reached their target condition to store the appropriate data. Programming can be stopped when all non-volatile storage elements have reached their target level or when the number of non-volatile storage elements that have not reached their target level is less than a number or memory cells that can be corrected using an error correction process during a read operation (or other operation). The number of non-volatile storage elements that have not reached their target level can be estimated by counting the number of non-volatile storage elements that have not reached a condition that is different (e.g., lower) than the target level.

REFERENCES:
patent: 5909449 (1999-06-01), So
patent: 6185134 (2001-02-01), Tanaka
patent: 6418059 (2002-07-01), Kreifels et al.
patent: 6888758 (2005-05-01), Hemink
patent: 6944072 (2005-09-01), Micheloni
patent: 7196928 (2007-03-01), Chen
patent: 7295478 (2007-11-01), Wan
patent: 7304893 (2007-12-01), Hemink
patent: 7434111 (2008-10-01), Sugiura
patent: 7440319 (2008-10-01), Li
patent: 2003/0123286 (2003-07-01), Higuchi
patent: 2004/0109362 (2004-06-01), Gongwer
patent: 2004/0257888 (2004-12-01), Noguchi
patent: 2005/0125708 (2005-06-01), Simon
patent: 2005/0157552 (2005-07-01), Hemink
patent: 2007/0226592 (2007-09-01), Radke
patent: 2008/0016392 (2008-01-01), Earl
patent: 2008/0072120 (2008-03-01), Radke
patent: 2008/0104312 (2008-05-01), Lasser
patent: 2008/0198662 (2008-08-01), Mokhlesi
patent: 2008/0250300 (2008-10-01), Mokhlesi
patent: WO9828745 (1998-07-01), None
patent: WO2005041206 (2005-05-01), None
patent: WO2006138413 (2006-12-01), None
Nonvolatile Memory and Method With Reduced Program Verify by Ignoring Fastest and/or Slowest Programming Bits, Inventors: Li et al., U.S. Appl. No. 12/249,678, filed Oct. 10, 2008.
PCT International Search Report dated Sep. 17, 2010, PCT Patent Appl. PCT/US2010/037846.
PCT Written Opinion of the International Searching Authority dated Sep. 17, 2010, PCT Patent Appl. PCT/US2010/037846.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Detecting the completion of programming for non-volatile... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Detecting the completion of programming for non-volatile..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Detecting the completion of programming for non-volatile... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4276705

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.