← Back to Patent Explorer
EP0353942A2 Expired / Lapsed EP ⏱️ 0.0 years remaining

A ripple-through FIFO memory

Assignee: Advanced Micro Devices Inc
•
Filing: 1989-07-27
•
Granted: —
•
Expires: 2009-07-27
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A data buffer for facilitating data communication between two asynchronous devices has at least two arrays of first-in, first-out ripple-through memory. Data from each input operation is stored into the arrays based upon a first logic function, and data for each output operation is output based upon a second logic function.

Inventors

  • 👤 Yun-Che Wang
  • 👤 Paul Scott

Bibliographic Details

Application Number —
Jurisdiction EP
Data Source google_patents
Last Synchronized 2026-10-27 17:30
CPC Classifications
G; G06; G06F; G06F5/00; G06F5/06; G06F5/16; H; H03; H03M; H03M9/00

Claims Analysis

Total Claims: 20
Claim 1
Independent Claim 69 words
A first-in, first-out memory, comprising: (a) at least two arrays of ripple-through memory each having an input and an output; (b) input control means coupled to said arrays of memory for enabling input to each of the arrays based upon a first logic function; and (c) output control means coupled to said arrays of memory for enabling output from each of the arrays based upon a second logic function.
Claim 2
Dependent Claim 69 words
A first-in, first-out memory, comprising: (a) at least two arrays of ripple-through memory each having an input and an output; (b) input control means coupled to said arrays of memory for enabling input to each of the arrays based upon a first logic function; and (c) output control means coupled to said arrays of memory for enabling output from each of the arrays based upon a second logic function.
Claim 3
Dependent Claim 86 words
A first-in, first-out memory as in claim 1, wherein the input of the arrays are connected in common, wherein the output of the arrays are connected in common, wherein said input control means sequentially selects in accordance with a predetermined order at each input operation, one of said arrays to store an input data, and wherein said output control means sequentially selects in accordance with said predetermined order at each output operation, output from one of said arrays as the output of the first-in, first-out memory.
Claim 4
Dependent Claim 49 words
A first-in, first-out memory as in claim 2 wherein said input control means comprises a first sequential state machine having N states, N being the number of arrays in the first-in, first-out memory, each of said N states enabling a corresponding one of said arrays to store input data.
Claim 5
Dependent Claim 19 words
A first-in, first-out memory as in claim 3 wherein said first sequential state machine is a binary ring coun­ter.
Claim 6
Dependent Claim 48 words
A first-in, first-out memory as in claim 2 wherein said output control means comprises a second sequential state machine having N states, N being the number of arrays in the first-in, first-out memory, each of said N states enabling data output from a corresponding one of said arrays.
Claim 7
Dependent Claim 19 words
A first-in, first-out memory as in claim 5 wherein said second sequential state machine is a binary ring counter.
Claim 8
Dependent Claim 57 words
A first-in, first-out memory as in claim 1, wherein said input control means selects a subset of the arrays to receive data input in parallel, and wherein said output control means sequentially selects in accordance with a predetermined order at each output operation, output from one of said arrays as the output of the first-in, first-out memory.
Claim 9
Dependent Claim 47 words
A first-in, first-out memory as in claim 7 wherein said output control means comprises a sequential state machine having N states, N being the number of arrays in the first-in, first-out memory, each of said N states enabling data output from a corresponding one of said arrays.
Claim 10
Dependent Claim 18 words
A first-in, first-out memory as in claim 8 wherein said sequential state machine is a binary ring counter.
Claim 11
Dependent Claim 22 words
The first-in, first-out memory as in claim 7, wherein the input control means selects all the arrays to simultaneously receive input data.
Claim 12
Dependent Claim 57 words
A first-in, first-out memory as in claim 1, wherein said output control means selects output from a subset of the arrays to provide a parallel output of the selected arrays, and wherein said input control means sequentially selects in accordance with a predetermined order at each input operation, one of said arrays to store an input data.
Claim 13
Dependent Claim 48 words
A first-in, first-out memory as in claim 11, wherein said input control means comprises a sequential state machine having N states, N being the number of arrays in the first-in, first-out memory, each of said N states enabling a corresponding one of said arrays to store input data.
Claim 14
Dependent Claim 18 words
A first-in, first-out memory as in claim 12 wherein said sequential state machine is a binary ring coun­ter.
Claim 15
Dependent Claim 20 words
The first-in, first-out memory as in claim 11, wherein the output control means output data from all the arrays simultaneously.
Claim 16
Dependent Claim 86 words
A first-in, first-out memory as in claim 1, wherein each of said arrays of memory comprising: (a) more than one row of memory cells, including a top row wherein input data is received into the array and a bottom row wherefrom data of the array is output; (b) ripple control means coupled to the rows of memory cells for enabling data into respective rows of memory cells and for controlling rippling of data from the top row to a vacant row closest to the bottom row.
Claim 17
Dependent Claim 15 words
A first-in, first-out memory as in claim 15, wherein said ripple control means operates asynchronously.
Claim 18
Dependent Claim 31 words
A first-in, first-out memory as in claim 15, wherein said ripple control means comprises a plurality of latches serially linked, each latch being coupled to one row of the memory cells.
Claim 19
Dependent Claim 23 words
A first-in, first-out memory as in claim 1, including means coupled to the arrays for converting serial input data into parallel input data.
Claim 20
Dependent Claim 31 words
A first-in, first-out memory as in claim 1, including means coupled to the arrays for converting paral­lel data out of the array into serial output data of the first-in, first-out memory.

References Cited (Backward Citations)

No citation records indexed.

USPTO Annuity & Maintenance Windows

Maintenance schedule is calculated for granted US utility patents.

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag