US 5,850,568 A · Circuit having plurality of carry/sum adders having read count, write count, and offset inputs to generate an output flag in response to FIFO fullness

Abstract

The present invention provides an efficient design that can be used to generate a programmable almost empty or programmable almost full flags. The present invention accomplishes this by efficiently evaluating the read count minus write count plus a user programmed offset being greater than or equal to zero for the programmable almost empty flag generation. Similarly, evaluating write count minus the read count plus the user programmed offset minus the size of the FIFO is greater than or equal to zero for the programmable almost full flag generation. The counters in the FIFO count from 0 to twice the size of the FIFO minus one and the user programmed offset can be between 0 to the size of the FIFO minus one. The offset has one less bit than the read and write counters. The processing block masks out the higher order bits of the Offset input based on the size of the FIFO. The first stage performs the bit wise addition of the offset, read counter and write counter inputs without any carry chain propagation. From the sum and carry outputs of the first stage bitwise addition, bits with equal weights are united and the overall carry out of this addition is generated very efficiency. The overall carry represents the external almost empty or almost full flag.

Claims17

Dependent claims

A circuit for generating an output flag indicating the fullness of a FIFO buffer, said circuit comprising:

an adder circuit configured to generate a sum output and a carry output in response to (i) a read count signal and (ii) a write count signal;
a generator circuit configured to generate an output flag in response to (i) said sum output and (ii) said carry output, wherein said output flag is at a first logic state when a FIFO is almost full and is at a second logic state when said FIFO is not almost full;
and
a plurality of carry/sum adders each having a first input receiving said read count signal, a second input receiving said write count signal and a third input receiving an offset signal indicating the level of fullness of said FIFO when said output flag is at said first logic state, each of said carry/sum adders having a carry output and a sum output, wherein said carry output of a most significant carry/sum adder is discarded.

1 more element

A circuit for generating an output flag indicating the fullness of a FIFO buffer, said circuit comprising:

adder means having a first input receiving a read count signal, a second input receiving a write count signal and a third input receiving an offset signal indicating the level of fullness of a FIFO, said adder means for providing a sum output and a carry output;
generator means having a first input coupled to said sum output and a second input coupled to said carry output, said generator means for producing an output flag that is at a first logic state when said FIFO is almost full and is at a second logic state when said FIFO is not almost full;
and
a plurality of carry/sum adders each having a first input receiving said read count signal, a second input receiving said write count signal and a third input receiving said offset signal, each of said carry/sum adders having a carry output and a sum output;
said carry output of a most significant carry/adder is discarded.

2 more elements

Dependencies are inferred from the claim text.

Circuit having plurality of carry/sum adders having read count, write count, and offset inputs to generate an output flag in response to FIFO fullness

Life of this patent

Circuit having plurality of carry/sum adders having read count, write count, and offset inputs to generate an output flag in response to FIFO fullness

Life of this patent

Abstract

Claims17