# US 6,732,222 B1 · Method for performing flash memory file management

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 6,732,222 B1
- Document ID: US6732222B1
- Status: Granted
- Kind: B1
- Application number: 10/062,323
- Filed: 2002-02-01
- Granted: 2004-05-04
- Earliest claimed: 2002-02-01
- Assignees: Silicon Motion, Inc.
- Inventors: Frido Garritsen; Brian Y. Huang
- Web page: https://patentgrep.com/patent/US6732222B1

## CPC

- G06F 3/0643: {Management of files}
- G06F 3/0607: {by facilitating the process of upgrading existing storage systems, e.g. for improving compatibility between host and storage device}
- G06F 3/0679: {Non-volatile semiconductor memory device, e.g. flash memory, one time programmable memory [OTP]}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

According to one aspect of the invention, there is provided a method for accessing data in a memory to be performed. The method includes receiving a request to read a file stored in the memory, the memory having a fragmented array of files across a single partition. The method also includes building a look up table (LUT) for the memory. The method also includes storing the LUT in the processor. The method also includes accessing the LUT in the processor to create an index table which specifies a plurality of addresses for the file. The method further includes storing the index table in the memory.

## Claims

### Claim 1

A method for a processor to access data in a memory, the method comprising:
receiving a request to read a file stored in the memory, the memory having a fragmented array of files across a single partition;
building a look up table (LUT) for the memory;
storing at least temporarily the LUT in the processor;
accessing the LUT in the processor to create an index table which specifies a plurality of addresses for the file;
storing the index table in the memory.

### Claim 2 (depends on 1)

A method as in claim 1 wherein the memory is a flash memory.

### Claim 3 (depends on 1)

A method as in claim 1 wherein the memory is a SmartMedia.

### Claim 4 (depends on 1)

A method as in claim 1 wherein building a lookup table comprises parsing the memory's File Allocation Table to find clusters for all files located on the memory.

### Claim 5 (depends on 1)

A method as in claim 1 wherein building a lookup table comprises converting file clusters associated with a file into logical sectors.

### Claim 6 (depends on 5)

A method as in claim 5 wherein building a lookup table further comprises mapping the logical sectors of the files to their corresponding physical sectors.

### Claim 7 (depends on 1)

A method as in claim 1 wherein storing the LUT comprises storing the LUT into a Digital Signal Processor (DSP).

### Claim 8 (depends on 1)

A method as in claim 1 wherein creating an index table comprises utilizing the LUT to create an index table which specifies physical addresses for each file.

### Claim 9 (depends on 1)

A method as in claim 1 wherein the index table in the memory comprises a table of records readable by the processor.

### Claim 10 (depends on 9)

A method as in claim 9 wherein the processor is a Digital Signal Processor.

### Claim 11

A method for a processor to write data to a memory, the method comprising:
receiving a request to write a file to the memory, the memory having a fragmented array of files across a single partition;
determining the size of the file;
writing the file to the memory;
building a look up table (LUT) for the memory;
storing at least temporarily the LUT in the processor;
accessing the LUT in the processor to create an index table which specifies a plurality of addresses for the file;
storing the index table in the memory.

### Claim 12 (depends on 11)

A method as in claim 11 wherein the memory is a flash memory.

### Claim 13 (depends on 11)

A method as in claim 11 wherein the memory is a SmartMedia.

### Claim 14 (depends on 11)

A method as in claim 11 wherein writing the file to the memory comprises searching a file allocation table (FAT) to find empty space within the memory to store the file.

### Claim 15 (depends on 11)

A method as in claim 11 wherein writing the file to the memory comprises allocating empty clusters within flash memory for the file.

### Claim 16 (depends on 11)

A method as in claim 11 wherein writing the file to the memory comprises storing the file in empty clusters in the memory.

### Claim 17 (depends on 11)

A method as in claim 11 wherein building a lookup table comprises parsing the memory's File Allocation Table to find clusters for all files located on the memory.

### Claim 18 (depends on 11)

A method as in claim 11 wherein building a lookup table comprises converting file clusters associated with a file into logical sectors.

### Claim 19 (depends on 18)

A method as in claim 18 wherein building a lookup table further comprises mapping the logical sectors of the files to their corresponding physical sectors.

### Claim 20 (depends on 11)

A method as in claim 11 wherein storing the LUT comprises storing the LUT into a Digital Signal Processor (DSP).

### Claim 21 (depends on 11)

A method as in claim 11 wherein creating an index table comprises utilizing the LUT to create an index table which specifies physical addresses for each file.

### Claim 22 (depends on 11)

A method as in claim 11 wherein the index table in the memory comprises a table of records which can be read by a processor.

### Claim 23 (depends on 22)

A method as in claim 22 wherein the processor is a Digital Signal Processor.

### Claim 24

A computer readable storage medium containing executable computer program instructions which when executed cause a method for a processor to access data in a memory, the method comprising:
receiving a request to read a file stored in the memory, the memory having a fragmented array of files across a single partition;
building a look up table (LUT) for the memory;
storing at least temporarily the LUT in the processor;
accessing the LUT in the processor to create an index table which specifies a plurality of addresses for the file;
storing the index table in the memory.

### Claim 25 (depends on 24)

A computer readable storage medium as in claim 24 wherein the memory is a flash memory.

### Claim 26 (depends on 24)

A computer readable storage medium as in claim 24 wherein the memory is a SmartMedia.

### Claim 27 (depends on 24)

A computer readable storage medium as in claim 24 wherein building a lookup table comprises parsing the memory's File Allocation Table to find clusters for all files located on the memory.

### Claim 28 (depends on 24)

A computer readable storage medium as in claim 24 wherein building a lookup table comprises converting file clusters associated with a file into logical sectors.

### Claim 29 (depends on 28)

A computer readable storage medium as in claim 28 wherein building a lookup table further comprises mapping the logical sectors of the files to their corresponding physical sectors.

### Claim 30 (depends on 24)

A computer readable storage medium as in claim 24 wherein storing the LUT comprises storing the LUT into a Digital Signal Processor (DSP).

### Claim 31 (depends on 24)

A computer readable storage medium as in claim 24 wherein creating an index table comprises utilizing the LUT to create an index table which specifies physical addresses for each file.

### Claim 32 (depends on 24)

A computer readable storage medium as in claim 24 wherein the index table in the memory comprises a table of records readable by the processor.

### Claim 33 (depends on 32)

A computer readable storage medium as in claim 32 wherein the processor is a Digital Signal Processor.

### Claim 34

A computer readable storage medium containing executable computer program instructions which when executed cause a method for a processor to write data to a memory, the method comprising:
receiving a request to write a file to the memory, the memory having a fragmented array of files across a single partition;
determining the size of the file;
writing the file to the memory;
building a look up table (LUT) for the memory;
storing at least temporarily the LUT in the processor;
accessing the LUT in the processor to create an index table which specifies a plurality of addresses for the file;
storing the index table in the memory.

### Claim 35 (depends on 34)

A computer readable storage medium as in claim 34 wherein the memory is a flash memory.

### Claim 36 (depends on 34)

A computer readable storage medium as in claim 34 wherein the memory is a SmartMedia.

### Claim 37 (depends on 34)

A computer readable storage medium as in claim 34 wherein writing the file to the memory comprises searching a file allocation table (FAT) to find empty space within the memory to store the file.

### Claim 38 (depends on 34)

A computer readable storage medium as in claim 34 wherein writing the file to the memory comprises allocating empty clusters within flash memory for the file.

### Claim 39 (depends on 34)

A computer readable storage medium as in claim 34 wherein writing the file to the memory comprises storing the file in empty clusters in the memory.

### Claim 40 (depends on 34)

A computer readable storage medium as in claim 34 wherein building a lookup table comprises parsing the memory's File Allocation Table to find clusters for all files located on the memory.

### Claim 41 (depends on 34)

A computer readable storage medium as in claim 34 wherein building a lookup table comprises converting file clusters associated with a file into logical sectors.

### Claim 42 (depends on 41)

A computer readable storage medium as in claim 41 wherein building a lookup table further comprises mapping the logical sectors of the files to their corresponding physical sectors.

### Claim 43 (depends on 34)

A computer readable storage medium as in claim 34 wherein storing the LUT comprises storing the LUT into a Digital Signal Processor (DSP).

### Claim 44 (depends on 34)

A computer readable storage medium as in claim 34 wherein creating an index table comprises utilizing the LUT to create an index table which specifies physical addresses for each file.

### Claim 45 (depends on 34)

A computer readable storage medium as in claim 34 wherein the index table in the memory comprises a table of records which can be read by a processor.

### Claim 46 (depends on 45)

A computer readable storage medium as in claim 45 wherein the processor is a Digital Signal Processor.
