Patent US4639894A successfully refreshed from Google Patents.
← Back to Patent Explorer
US4639894A Expired / Lapsed US ⏱️ 0.0 years remaining

Data transferring method

Assignee: Fujifilm Business Innovation Corp
•
Filing: 1985-02-25
•
Granted: 1987-01-27
•
Expires: 2005-02-25
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method of improving data transfer speed for a word-organized memory arranged by rows and columns. The method includes the steps of selecting a first row of the memory and transferring all the bits in the first row of the memory to a set of registers. A second row of the memory is then selected and the contents of all the registers are transferred to the second row of the memory. The invention may also be for transferring rows of data between memories.

Inventors

  • 👤 Chiharu Ishii

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-01 11:19
CPC Classifications
G; G06; G06F; G06F13/00; G06F13/14; G06F13/16; G11; G11C; G11C7/00; G11C7/10; G11C7/1006

Claims Analysis

Total Claims: 17
Claim 1
Independent Claim 114 words
A high speed memory data transfer method for a word-organized memory arranged by rows and columns and having for each row N columns and P bits per word, said method comprising the steps of: (a) selecting a first row of said memory having data to be transferred to a second row of said memory, said second row being different from said first row; (b) transferring all N×P bits in said first row of memory to a set of P registers each having N words; (c) selecting said second row of said memory to receive said transferred data; and (d) transferring the contents of all said P registers to said second row of said memory.
Claim 2
Dependent Claim 114 words
A high speed memory data transfer method for a word-organized memory arranged by rows and columns and having for each row N columns and P bits per word, said method comprising the steps of: (a) selecting a first row of said memory having data to be transferred to a second row of said memory, said second row being different from said first row; (b) transferring all N×P bits in said first row of memory to a set of P registers each having N words; (c) selecting said second row of said memory to receive said transferred data; and (d) transferring the contents of all said P registers to said second row of said memory.
Claim 3
Dependent Claim 19 words
The method of claim 1 wherein said transferring steps each include the step of effecting a parallel data transfer.
Claim 4
Dependent Claim 30 words
The method of claim 1 wherein said selecting steps each include the step of enabling a row decoder of said memory with selected portion of an address for said memory.
Claim 5
Dependent Claim 38 words
The method of claim 1 wherein said first transferring step includes the step of sending a read signal to said memory and wherein said second transferring step includes the step of sending a write signal to said memory.
Claim 6
Independent Claim 112 words
A method for high speed data transfer between a first and second word-organized memories arranged according to rows and columns, each said memory having for each row N columns and P bits per word, said method comprising the steps of: (a) selecting a first row of said first memory, said first row having data to be transferred; (b) transferring all N×P bits in said first row of said first memory into a set of P registers each having N words; (c) selecting a second row of said second memory to receive said transferred data; and (d) transferring the contents of all said P registers into said second row of said second memory.
Claim 7
Independent Claim 112 words
A method for high speed data transfer between a first and second word-organized memories arranged according to rows and columns, each said memory having for each row N columns and P bits per word, said method comprising the steps of: (a) selecting a first row of said first memory, said first row having data to be transferred; (b) transferring all N×P bits in said first row of said first memory into a set of P registers each having N words; (c) selecting a second row of said second memory to receive said transferred data; and (d) transferring the contents of all said P registers into said second row of said second memory.
Claim 8
Dependent Claim 48 words
The method of claim 5 wherein said set of P registers of N words includes first and second P register sets of N words per register and wherein said method further includes the step of transferring the contents of said first register set to said second register set.
Claim 9
Independent Claim 21 words
The method of claims 5 or 6 wherein said transferring steps each include the step of effecting a parallel data transfer.
Claim 10
Dependent Claim 29 words
The methods of claims 5 or 6 wherein said selecting steps each include the step of enabling a row detector with selected portions of an address for said memory.
Claim 11
Dependent Claim 52 words
The methods of claims 5 or 6 wherein said step of transferring data from said first memory includes the step of sending a read signal to said first memory and wherein said step of transferring data to said second memory includes the step of sending a write signal to said second memory.
Claim 12
Dependent Claim 114 words
A memory addressed by an address word comprising: a word-organized memory cell assembly arranged as M rows by N words with P bits per word; a row decoder coupled to said memory cell assembly and enabled by certain bits of said address word; P registers of N words, coupled to said memory cell assembly to receive the data from an entire row of said memory selected by said row decoder and to present for input the data in an entire row of said memory selected by said row decoder; and P column decoders enabled by certain bits of said address word for transferring P-bit data between said P registers and a P-bit data bus.
Claim 13
Dependent Claim 114 words
A memory addressed by an address word comprising: a word-organized memory cell assembly arranged as M rows by N words with P bits per word; a row decoder coupled to said memory cell assembly and enabled by certain bits of said address word; P registers of N words, coupled to said memory cell assembly to receive the data from an entire row of said memory selected by said row decoder and to present for input the data in an entire row of said memory selected by said row decoder; and P column decoders enabled by certain bits of said address word for transferring P-bit data between said P registers and a P-bit data bus.
Claim 14
Dependent Claim 190 words
A memory arrangement comprising: (a) a first memory addressed by a first address word said first memory including; (i) a first word-organized memory cell assembly arranged as M rows by N columns with P bits per word, and (ii) a first row decoder coupled to said first memory cell assembly and enabled by certain bits of said first address word; (b) a second memory addressed by a second address word, said second memory including (i) a second word-organized memory cell assembly arranged as M' rows by N columns and P bits per word, and (ii) a second row decoder coupled to said second memory cell assembly and enabled by certain bits of said second address word; and (c) P registers of N words coupled to said first memory cell assembly to receive an entire row of said first memory selected by said first row decoder and to present for input to said second memory an entire row selected by said second row decoder; and (d) P column decoders enabled by certain bits of said second address word for transferring P-bit data between said P registers and a P-bit data bus.
Claim 15
Dependent Claim 190 words
A memory arrangement comprising: (a) a first memory addressed by a first address word said first memory including; (i) a first word-organized memory cell assembly arranged as M rows by N columns with P bits per word, and (ii) a first row decoder coupled to said first memory cell assembly and enabled by certain bits of said first address word; (b) a second memory addressed by a second address word, said second memory including (i) a second word-organized memory cell assembly arranged as M' rows by N columns and P bits per word, and (ii) a second row decoder coupled to said second memory cell assembly and enabled by certain bits of said second address word; and (c) P registers of N words coupled to said first memory cell assembly to receive an entire row of said first memory selected by said first row decoder and to present for input to said second memory an entire row selected by said second row decoder; and (d) P column decoders enabled by certain bits of said second address word for transferring P-bit data between said P registers and a P-bit data bus.
Claim 16
Dependent Claim 221 words
A memory arrangement comprising: (a) a first memory addressed by a first address word, said first memory including (i) a first word-organized memory cell assembly arranged as M rows by N columns with P bits per word, (ii) a first row decoder coupled to said first memory cell assembly and enabled by certain bits of said first address word, and (iii) a first set of P registers of N words coupled to said first memory cell assembly to transfer an entire row of said first memory selected by said first row decoder; and (b) a second memory addressed by a second address word, said second memory including (i) a second word-organized memory cell assembly arranged as M' rows by N columns with P bits per word, (ii) a second row decoder coupled to said second memory cell assembly and enabled by certain bits of said second address word, (iii) a second set of P registers of N words coupled to said second memory cell assembly to transfer an entire row of said second memory selected by said second row decoder and coupled to transfer data with said first P register set; and (c) P column decoders enabled by certain bits of said second address word for transfering P-bit data between said second set of P registers and a P-bit data bus.
Claim 17
Dependent Claim 221 words
A memory arrangement comprising: (a) a first memory addressed by a first address word, said first memory including (i) a first word-organized memory cell assembly arranged as M rows by N columns with P bits per word, (ii) a first row decoder coupled to said first memory cell assembly and enabled by certain bits of said first address word, and (iii) a first set of P registers of N words coupled to said first memory cell assembly to transfer an entire row of said first memory selected by said first row decoder; and (b) a second memory addressed by a second address word, said second memory including (i) a second word-organized memory cell assembly arranged as M' rows by N columns with P bits per word, (ii) a second row decoder coupled to said second memory cell assembly and enabled by certain bits of said second address word, (iii) a second set of P registers of N words coupled to said second memory cell assembly to transfer an entire row of said second memory selected by said second row decoder and coupled to transfer data with said first P register set; and (c) P column decoders enabled by certain bits of said second address word for transfering P-bit data between said second set of P registers and a P-bit data bus.

References Cited (Backward Citations)

US3906461A Cited
US4354256A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1990-01-26 1990-07-28 1991-01-27 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1994-01-26 1994-07-28 1995-01-27 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1998-01-26 1998-07-28 1999-01-27 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag