States encoding in multi-bit flash cells

Multiplex communications – Pathfinding or routing – Switching a message which includes an address header

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C365S185240

Reexamination Certificate

active

11035807

ABSTRACT:
N data bits are stored in ┌N/M┐ cells by programming each cell with up to M of the bits according to a valid, nonserial bit ordering that satisfies one of the following criteria: Either the number of threshold voltage comparisons needed to read all M bits sequentially is at most 1 more than the smallest such number, or the largest number of threshold voltage comparisons needed to read any bit is minimized, or the smallest number of threshold voltage comparisons needed to read any bit is minimized, or the difference between the largest and smallest number of threshold voltage comparisons needed to read any bit statically is at most 1 more than the smallest such difference, or the difference between the largest and smallest number of threshold voltage comparisons needed to read any bit dynamically is minimized.

REFERENCES:
patent: 5404485 (1995-04-01), Ban
patent: 5434825 (1995-07-01), Harari
patent: 6046935 (2000-04-01), Takeuchi
patent: 6522580 (2003-02-01), Chen
patent: 6643188 (2003-11-01), Tanaka
patent: 2003/0021149 (2003-01-01), So et al.
patent: 2003/0021155 (2003-01-01), Yachareni et al.
patent: 2004/0022249 (2004-02-01), Katayama et al.
patent: 2004/0080979 (2004-04-01), Park

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

States encoding in multi-bit flash cells does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with States encoding in multi-bit flash cells, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and States encoding in multi-bit flash cells will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3889185

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