Segmented bitscan for verification of programming

Static information storage and retrieval – Floating gate – Particular biasing

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C365S185050

Reexamination Certificate

active

07924625

ABSTRACT:
A set non-volatile storage elements are subjected to a programming process in order to store a set of 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. Decisions about whether to continue programming or whether the programming is successful are made based on whether overlapping groups of the non-volatile storage elements have less than a threshold number of non-volatile storage elements that are not properly programmed.

REFERENCES:
patent: 4967415 (1990-10-01), Tanagawa
patent: 5043940 (1991-08-01), Harari
patent: 5052002 (1991-09-01), Tanagawa
patent: 5153723 (1992-10-01), Citta
patent: 5218569 (1993-06-01), Banks
patent: 5262342 (1993-11-01), Toyama
patent: 5450424 (1995-09-01), Okugaki
patent: 5687114 (1997-11-01), Khan
patent: 5694406 (1997-12-01), Lipovski
patent: 5754567 (1998-05-01), Norman
patent: 5862081 (1999-01-01), Harari
patent: 5898606 (1999-04-01), Kobayashi
patent: 6360347 (2002-03-01), Walters, Jr.
patent: 6438726 (2002-08-01), Walters, Jr.
patent: 6498749 (2002-12-01), Cuppens
patent: 6510537 (2003-01-01), Lee
patent: 6601211 (2003-07-01), Norman
patent: 6678192 (2004-01-01), Gongwer
patent: 6751766 (2004-06-01), Guterman
patent: 7440319 (2008-10-01), Li
patent: 7545681 (2009-06-01), Li
patent: 2003/0046631 (2003-03-01), Gappisch
patent: 2003/0154437 (2003-08-01), Chih
patent: 2003/0217323 (2003-11-01), Guterman
patent: 2004/0015771 (2004-01-01), Lasser
patent: 2004/0022087 (2004-02-01), Satori
patent: 2004/0083333 (2004-04-01), Chang
patent: 2004/0257888 (2004-12-01), Noguchi
patent: 2005/0125708 (2005-06-01), Simon
patent: 2005/0268208 (2005-12-01), Simizume
patent: 2006/0133141 (2006-06-01), Gorobets
patent: 2009/0207661 (2009-08-01), Li
patent: 2008005735 (2008-01-01), None
patent: 2008067185 (2008-06-01), None
International Search Report dated May 9, 2008, PCT Appl. No. PCT/US2007/084872, filed Nov. 15, 2007.
Written Opinion of the International Searching Authority dated May 9, 2008, PCT Appl. No. PCT/US2007/084872, filed Nov. 15, 2007.
International Preliminary Report dated Jun. 3, 2009, PCT Appl. No. PCT/US2007/084872, filed Nov. 15, 2007.
European Office Action dated Jul. 22, 2009, European Patent Appl. 07864477.0.
Response to European Office Action dated Jul. 22, 2009, European Patent Appl. 07864477.0.
Office Action dated Nov. 24, 2008, U.S. Appl. No. 11/563,585, filed Nov. 27, 2006.
Response to Office Action dated Dec. 10, 2008, U.S. Appl. No. 11/563,585, filed Nov. 27, 2006.
Notice of Allowance dated Jan. 29, 2009, U.S. Appl. No. 11/563,585, filed Nov. 27, 2006.
Office Action dated Dec. 12, 2007, U.S. Appl. No. 11/563,590, filed Nov. 27, 2006.
Response to Office Action dated Apr. 3, 2008, U.S. Appl. No. 11/563,590, filed Nov. 27, 2006.
Notice of Allowance dated Jul. 21, 2008, U.S. Appl. No. 11/563,590, filed Nov. 27, 2006.
Notice of Allowance dated Nov. 2, 2009, U.S. Appl. No. 12/431,573, filed Apr. 28, 2009.
Korean Office Action dated Dec. 8, 2010, Korean Patent Application No. 10-2009-7013318.

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

Segmented bitscan for verification of programming does not yet have a rating. At this time, there are no reviews or comments for this patent.

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

Rate now

     

Profile ID: LFUS-PAI-O-2727539

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