Browse Prior Art Database

High Performance Flash Memory Rewriting Algorithm

IP.com Disclosure Number: IPCOM000123135D
Original Publication Date: 1998-Jun-01
Included in the Prior Art Database: 2005-Apr-04
Document File: 2 page(s) / 39K

Publishing Venue

IBM

Related People

Motoki, T: AUTHOR

Abstract

Disclosed is an algorithm to rewrite data on flash memory rapidly by omitting unnecessary Write Sequence. 1. Conventional algorithm to rewrite data on flash memory

This text was extracted from an ASCII text file.
This is the abbreviated version, containing approximately 95% of the total text.

High Performance Flash Memory Rewriting Algorithm

   Disclosed is an algorithm to rewrite data on flash memory
rapidly by omitting unnecessary Write Sequence.
  1.  Conventional algorithm to rewrite data on flash memory

   The attached figures describe a example under the following
conditions:
    Flash memory sector size 64KBytes
    Flash memory area        600000h-7FFFFFh
    SRAM area                400000h-47FFFFh
    Required rewriting       8KBytes data into 686000h
    (1) A flash memory rewriting algorithm copies the whole data
         on the flash memory sector (Area1) including the target
         address into the other memory area (Area2) which can be
         rewritten by a byte unit (see FIG. 1).
    (2) It rewrites the required data (DATA1) into the data
         (DATA2) on Area2 (see FIG. 2).  *It doesn't execute the
         following 3. nor 4. if "DATA1==DATA2" about all data.
    (3) It executes Erase Sequence to Area1 (see FIG. 3).
    (4) It copies the data on Area2 into Area1 (see FIG. 4).
  2.  This new algorithm to rewrite data on flash memory
       above (2) is modified as the following (2').  in this new
       algorithm.  (2') It rewrites the required data(DATA1) into
       the data (DATA2) on Area2.  * It doesn't execute the
       following 3. nor 4. if "DATA1==DATA2" about all data.  * It
       doesn't execut...