Programming non-volatile memory with high resolution...

Static information storage and retrieval – Floating gate – Multiple values

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C365S185190, C365S185220

Reexamination Certificate

active

08045375

ABSTRACT:
Multiple programming processes are performed for a plurality of non-volatile storage elements. Each of the programming processes operate to program at least a subset of the non-volatile storage elements to a respective set of target conditions using program pulses. At least a subset of the programming processes include identifying a program pulse associated with achieving a particular result for a respective programming process and performing one or more sensing operations at one or more alternative results for the non-volatile storage elements. Subsequent programming process are adjusted based on a first alternative result and the identification of the program pulse if the one or more sensing operations determined that greater than a predetermined number of non-volatile storage elements achieved the first alternative result. Subsequent programming process are adjusted based on the identification of the program pulse if the one or more sensing operations determined that less than a required number of non-volatile storage elements achieved any of the alternative results.

REFERENCES:
patent: 5070032 (1991-12-01), Yuan
patent: 5095344 (1992-03-01), Harari
patent: 5172338 (1992-12-01), Mehrotra
patent: 5313421 (1994-05-01), Guterman
patent: 5315541 (1994-05-01), Harari
patent: 5343063 (1994-08-01), Yuan
patent: 5570315 (1996-10-01), Tanaka
patent: 5595924 (1997-01-01), Yuan
patent: 5661053 (1997-08-01), Yuan
patent: 5768192 (1998-06-01), Eitan
patent: 5903495 (1999-05-01), Takeuchi
patent: 6011725 (2000-01-01), Eitan
patent: 6046935 (2000-04-01), Takeuchi
patent: 6185134 (2001-02-01), Tanaka
patent: 6222762 (2001-04-01), Guterman
patent: 7092290 (2006-08-01), Hemink
patent: 7177199 (2007-02-01), Chen
patent: 7230854 (2007-06-01), Wan
patent: 7243275 (2007-07-01), Gongwer
patent: 7339834 (2008-03-01), Lutze
patent: 7434111 (2008-10-01), Sugiura
patent: 7450426 (2008-11-01), Li
patent: 7451264 (2008-11-01), Yero
patent: 7467253 (2008-12-01), Yero
patent: 7474561 (2009-01-01), Li
patent: 2005/0105337 (2005-05-01), Cohen et al.
patent: 2005/0286304 (2005-12-01), Krishnamachari et al.
patent: 2006/0140007 (2006-06-01), Cernea
patent: 2007/0263450 (2007-11-01), Cernea
patent: 2007/0297247 (2007-12-01), Hemink
patent: 2008/0062770 (2008-03-01), Tu
patent: 2008/0101126 (2008-05-01), Hemink
patent: 2008/0158979 (2008-07-01), Kamei
patent: 2008/0158980 (2008-07-01), Kamei et al.
patent: 2008/0198660 (2008-08-01), Mokhlesi
patent: 2008/0198661 (2008-08-01), Mokhlesi
patent: 2008/0198662 (2008-08-01), Mokhlesi
patent: 2008/0198664 (2008-08-01), Mokhlesi
patent: 2008/0198665 (2008-08-01), Mokhlesi
patent: 2010/0103733 (2010-04-01), Hemink
patent: WO2005/041206 (2005-05-01), None
Seung-Ho Chang et al. “A 48nm 32Gb 8-level NAND flash Memory with 5.5 MB/s Program Throughput,” ISSCC 2009, 2009 IEEE International Solid State Circuits Conference, Feb. 10, 2009.
International Search Report, dated Nov. 24, 2009, PCT/US2009/058882.
Written Opinion of the International Searching Authority, dated Nov. 24, 2009, PCT/US2009/058882.

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

Programming non-volatile memory with high resolution... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Programming non-volatile memory with high resolution..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Programming non-volatile memory with high resolution... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4299726

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