# US 2005/0240750 A1 · Interleaved mapping method and apparatus for accessing memory

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

- Number: US 2005/0240750 A1
- Document ID: US20050240750A1
- Status: Published application
- Kind: A1
- Application number: 10/711,843
- Filed: 2004-10-08
- Published: 2005-10-27
- Earliest claimed: 2004-04-27
- Assignees: VIA Technologies, Inc.
- Inventors: Kevin Lin
- Web page: https://patentgrep.com/patent/US20050240750A1

## CPC

- G06F 12/0607: {Interleaved addressing}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

This invention provides a method for accessing memory. The method includes, generating a block index for a block of data, mapping the block index to a physical address of a memory based on the block index and a number N, wherein N is bank number of the memory, storing the block of data into the memory at the physical address, and repeating from the generating step, wherein the mapping step makes each one of the block indexes map in turns to one physical address located at different banks, and result in any logical adjacent block of data be stored physically at different banks of the memory.

## Claims

### Claim 1

A method for accessing memory, comprising:
generating a block index for a block of data;
mapping the block index to a physical address of a memory based on the block index and a number N, wherein N is bank number of the memory;
storing the block of data into the memory at the physical address; and
looping to the generating step,
wherein the mapping step makes each one of the block indexes map in turns to one physical address located at different banks, and result in any logical adjacent block of data be stored physically at different banks of the memory.

### Claim 2 (depends on 1)

The method of claim 1, wherein the memory supports pipelining access.

### Claim 3 (depends on 1)

The method of claim 1, wherein the memory is a SDRAM.

### Claim 4 (depends on 1)

The method of claim 1, the mapping steps further comprises:
dividing the block index by N to obtain a quotient Q and a remainder R; and
calculating the physical address based on Q and R, wherein the physical address=Q*block_size+R*bank_size.

### Claim 5 (depends on 4)

The method of claim 4, wherein bank_size equals the memory size divided by N, and block_size equals the size of which the system is in need to process one sector from the optical disc.

### Claim 6

A method of operating a disc player with a memory comprising:
retrieving a block of data from a source media;
assigning a block index for the block of data;
dividing value of the block index by N for acquiring a quotient Q and a reminder R, wherein N is bank number of the memory;
calculating the physical address based on Q and R;
storing the block of data in the memory at the physical address; and
repeating form the retrieving step, wherein the calculating step makes the block index interleaved mapping to the physical address located at different banks and any two logically successive blocks of data be stored physically at different banks of the memory.

### Claim 7 (depends on 6)

The method of claim 6, wherein the memory supports pipelining access.

### Claim 8 (depends on 6)

The method of claim 6, wherein the memory is a SDRAM.

### Claim 9 (depends on 6)

The method of claim 6, wherein the calculating step further comprises a reference function, as follows:
the physical address=Q*block_size+R*bank_size.

### Claim 10 (depends on 9)

The method of claim 9, wherein bank_size equals the memory size divided by N, and block_size is bank_size divided into a plurality of parts.

### Claim 11 (depends on 9)

The method of claim 9, further comprises:
reading the block of data according to the block index and the reference function; and
recording the block of data to a destination media, whereby the reading step makes each one of the block of data read at different banks in turns and result in time saving and reduces pre-charge overloads by reading in one bank and pre-charge in another bank accessed just before.

### Claim 12

An apparatus for processing digital data with a memory in a disc player, comprising:
means for generating a block index for the block of data;
means for dividing value of the block index by N for acquiring a quotient Q and a reminder R, wherein N is bank number of the memory; and
means for calculating the physical address based on Q and R, wherein the calculating means makes the block index interleaved mapping to the physical address located at different banks and any two logically successive blocks of data be stored physically at different banks of the memory.

### Claim 13 (depends on 12)

The apparatus of claim 12, wherein the memory supports pipelining access.

### Claim 14 (depends on 12)

The apparatus of claim 12, wherein the memory is a SDRAM.

### Claim 15 (depends on 12)

The apparatus of claim 12, wherein the means for calculating implements a reference function as follow:
the physical address=Q*block_size+R*bank_size.

### Claim 16 (depends on 15)

The apparatus of claim 15, wherein bank_size equals the memory size divided by N, and block_size is bank_size divided into a plurality of parts.

### Claim 17

A method for accessing memory, comprising:
generating a plurality of block indexes for a plurality of blocks of data;
mapping the block indexes sequentially to a plurality of physical address of a memory based on the block indexes and a number N, wherein N is bank number of the memory; and
storing the block of data into the memory at the physical address, wherein the mapping step makes each one of the block indexes map in turns to one physical address located at different banks, and result in any logical adjacent block of data be stored physically at different banks of the memory.

### Claim 18 (depends on 17)

The method of claim 17, wherein the memory supports pipelining access.

### Claim 19 (depends on 17)

The method of claim 17, wherein the memory is a SDRAM.

### Claim 20 (depends on 17)

The method of claim 17, the mapping steps further comprises:
dividing the block index by N to obtain a quotient Q and a remainder R; and
calculating the physical address based on Q and R, wherein the physical address=Q*block_size+R*bank_size, bank_size equals the memory size divided by N, and block_size equals the size of a plurality of sectors on the optical disc.
