← Back to Patent Explorer
US4833655A Expired / Lapsed US ⏱️ 0.0 years remaining

FIFO memory with decreased fall-through delay

Assignee: AD TECHNOLOGIES LLC
•
Filing: 1985-06-28
•
Granted: 1989-05-23
•
Expires: 2005-06-28
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A first-in, first out data memory minimizes fall-through delay. The FIFO memory has a plurality of cascaded register stages arranged in sections, with the input of each section selectively coupled to a bypass bus. Data is introduced on the bypass bus, and control logic writes the data into the section nearest the output which is currently not full. The individual register stages are self-clocked, so that data is then shifted toward the output through any vacant registers. In another aspect, the register stages are arranged in sections of different length, with the shortes section closest to the output and the longest section closest to the input. Decreased fall-through delay is achieved by minimizing the length of the FIFO buffer actually traversed by the data while insuring that the order of the data remains unchanged.

Inventors

  • 👤 Michael A. Wolf
  • 👤 Jeffrey M. Bessolo

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-27 14:49
CPC Classifications
G; G06; G06F; G06F5/00; G06F5/06; G06F5/08; G06F5/065

Claims Analysis

Total Claims: 13
Claim 1
Independent Claim 128 words
A first in, first out data memory comprising a plurality of shift register sections, sequentially arranged and coupled for cascade operation, each of said sections comprising a predetermined number of shift register stages; each section having a smaller number of stages than the one preceding it; input means coupled to each section for writing data thereto; output means coupled to the last of said sections for reading date from said data memory; means for shifting data written to any one of said stages sequentially through the stages to the last of the stages which does not presently contain data; and means for selectively writing data directly into the section nearest the output means which is not presently full of data for the purpose of decreasing fall-through delay time.
Claim 2
Dependent Claim 128 words
A first in, first out data memory comprising a plurality of shift register sections, sequentially arranged and coupled for cascade operation, each of said sections comprising a predetermined number of shift register stages; each section having a smaller number of stages than the one preceding it; input means coupled to each section for writing data thereto; output means coupled to the last of said sections for reading date from said data memory; means for shifting data written to any one of said stages sequentially through the stages to the last of the stages which does not presently contain data; and means for selectively writing data directly into the section nearest the output means which is not presently full of data for the purpose of decreasing fall-through delay time.
Claim 3
Dependent Claim 238 words
A first in, first out data memory comprising a plurality of shift register sections, sequentially arranged and coupled for cascade operation, each of said sections comprising a predetermined number of shift register stages; each section having a small number of register stages than the one preceding it; input means coupled to each section for writing data thereto; a bypass bus, selectively coupled to the input means of each section, through which data is introduced; output means, coupled to the last of said sections, for reading data from said data memory; first status means, associated with each of said register stages, for indicating an empty data condition for that stage and a full data condition for the preceding register stage; first control logic means, associated with each of said register stages and responsive to said first status means, to advance said data from the preceding register stage to the present register stage; second status means, coupled to each of said sections, for indicating either a full or not full data condition for that section; and second control logic means, coupled to each of said sections and responsive to said second status means, for selecting which of said sections is to receive data from said bypass bus; whereby data input to said data memory is always written into the section nearest the output means which presently indicates a not full data condition for the purpose of decreasing fall-through delay time.
Claim 4
Dependent Claim 238 words
A first in, first out data memory comprising a plurality of shift register sections, sequentially arranged and coupled for cascade operation, each of said sections comprising a predetermined number of shift register stages; each section having a small number of register stages than the one preceding it; input means coupled to each section for writing data thereto; a bypass bus, selectively coupled to the input means of each section, through which data is introduced; output means, coupled to the last of said sections, for reading data from said data memory; first status means, associated with each of said register stages, for indicating an empty data condition for that stage and a full data condition for the preceding register stage; first control logic means, associated with each of said register stages and responsive to said first status means, to advance said data from the preceding register stage to the present register stage; second status means, coupled to each of said sections, for indicating either a full or not full data condition for that section; and second control logic means, coupled to each of said sections and responsive to said second status means, for selecting which of said sections is to receive data from said bypass bus; whereby data input to said data memory is always written into the section nearest the output means which presently indicates a not full data condition for the purpose of decreasing fall-through delay time.
Claim 5
Dependent Claim 59 words
A first in, first out data memory as claimed in claim 2, further including first clock input means, coupled to said bypass bus, for controlling the rate at which data is introduced onto said bypass bus; and second clock input means, coupled to said output means, for controlling the rate at which data is read from said data memory.
Claim 6
Dependent Claim 139 words
A first in, first out data memory as claimed in claim 2, wherein the number of register stages in the last of said sections is governed by the relationship N.sub.1 =T.sub.fallthru /T.sub.drip and the number of register stages in preceding sections is governed by the relationship N.sub.j =(N.sub.1 + . . . N.sub.(j-1))×(T.sub.shift -T.sub.bubble -T.sub.drip)/ T.sub.drip to optimize said register section lengths so that a continuous input data stream will not have time delay gaps introduced therein upon reading said output means; where Tfallthru is the desired fall-through delay for the FIFO, Tdrip is the time for a datum to move form one register stage to the next consecutive stage, Tshift is the required input or output time, and Tbubble is the time for a data vacancy to move from one register stage to the full stage preceding it.
Claim 7
Dependent Claim 22 words
A first in, first out data memory as claimed in claim 2, wherein said memory is constructed as a solid-state integrated circuit.
Claim 8
Dependent Claim 165 words
A programmable first in, first out data memory comprising a first bidirectional port for transferring data into or out of said data memory; a second bidirectional port for transferring data into or out of said data memory; control means, coupled to the first and second directional ports, for selecting the direction of data transfer through the ports; a register block including a plurality of shift register sections coupled for cascade operation, an input, and an output, such that data introduced at the input of the register block is shifted sequentially through the shift register sections to the output; each of said sections comprising a predetermined number of shift register stages; each section having a smaller number of register stages than the one preceding it; an input bus for transferring data from the first or second bidirectional port to the input of said register block; and an output bus for transferring data from the output of the register block to the first or second bidirectional port.
Claim 9
Dependent Claim 165 words
A programmable first in, first out data memory comprising a first bidirectional port for transferring data into or out of said data memory; a second bidirectional port for transferring data into or out of said data memory; control means, coupled to the first and second directional ports, for selecting the direction of data transfer through the ports; a register block including a plurality of shift register sections coupled for cascade operation, an input, and an output, such that data introduced at the input of the register block is shifted sequentially through the shift register sections to the output; each of said sections comprising a predetermined number of shift register stages; each section having a smaller number of register stages than the one preceding it; an input bus for transferring data from the first or second bidirectional port to the input of said register block; and an output bus for transferring data from the output of the register block to the first or second bidirectional port.
Claim 10
Dependent Claim 43 words
A programmable first in, first out data memory as recited in claim 6, further comprising means for selectively writing data directly into the section nearest the output means which is not presently full of data for the purpose of decreasing fall-through delay time.
Claim 11
Dependent Claim 25 words
A first in, first out data memory circuit, as recited in claim 6, further including data error detection means coupled to at least one port.
Claim 12
Dependent Claim 24 words
A first in, first out data memory circuit, as recited in claim 6, further including data recirculating means coupled to at least one port.
Claim 13
Dependent Claim 23 words
A first in, first out data memory circuit as recited in claim 6, wherein said memory is constructed as a solid-state integrated circuit.

References Cited (Backward Citations)

US4058773A Cited
US4151609A Cited
US4156288A Cited
US4296477A Cited
US4592019A Cited
US4642797A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1992-05-22 1992-11-21 1993-05-23 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1996-05-22 1996-11-21 1997-05-23 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2000-05-22 2000-11-21 2001-05-23 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag