Circuit having plurality of carry/sum adders having read count,

Details Circuit having plurality of carry/sum adders having read count, Circuit having plurality of carry/sum adders having read count,

1995-12-22

1998-12-15

Lee, Thomas C.

Electric lamp and discharge devices: consumable electrodes

With economizer

3142396, G06F 1300

Patent

active

058505687

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.

REFERENCES:
patent: 4467443 (1984-08-01), Shima
patent: 4833651 (1989-05-01), Seltzer et al.
patent: 4847812 (1989-07-01), Lodhi
patent: 4864543 (1989-09-01), Ward et al.
patent: 4888739 (1989-12-01), Frederick et al.
patent: 4891788 (1990-01-01), Kreifels
patent: 4942553 (1990-07-01), Dalrymple et al.
patent: 5021994 (1991-06-01), Tai et al.
patent: 5079693 (1992-01-01), Miller
patent: 5121346 (1992-06-01), McClure
patent: 5222047 (1993-06-01), Matsuda et al.
patent: 5265063 (1993-11-01), Kogure
patent: 5274600 (1993-12-01), Ward et al.
patent: 5278956 (1994-01-01), Thomsen et al.
patent: 5315184 (1994-05-01), Benhamida
patent: 5325487 (1994-06-01), Au et al.
patent: 5336938 (1994-08-01), Sywyk
patent: 5345419 (1994-09-01), Fensternmaker et al.
patent: 5365485 (1994-11-01), Ward et al.
patent: 5381126 (1995-01-01), McClure
patent: 5384744 (1995-01-01), Lee
patent: 5412611 (1995-05-01), Hattori et al.
patent: 5471583 (1995-11-01), Au et al.
patent: 5473756 (1995-12-01), Traylor
patent: 5487049 (1996-01-01), Hang
patent: 5495451 (1996-02-01), Cho
patent: 5502655 (1996-03-01), McClure
patent: 5506815 (1996-04-01), Hsieh et al.
patent: 5508679 (1996-04-01), McClure
patent: 5515330 (1996-05-01), Hattori et al.
patent: 5519701 (1996-05-01), Colmant et al.
patent: 5557575 (1996-09-01), Lee
patent: 5587962 (1996-12-01), Hashimoto et al.
patent: 5619681 (1997-04-01), Benhamida et al.
patent: 5623449 (1997-04-01), Fischer et al.
patent: 5625842 (1997-04-01), Dalrymple
patent: 5627797 (1997-05-01), Hawkins et al.
patent: 5636176 (1997-06-01), Hashimoto et al.
patent: 5661418 (1997-08-01), Narayana et al.
Andrew Hawkins et al., U.S.S.N. 08/567,893 State Machine Design for Generating Empty and Full Flags in an Asynchronous FIFO, filed Dec. 6, 1995.
Andrew Hawkins et al., U.S.S.N. 08/567,918 State Machine Design for Generating Half-Full and Half-Empty Flags in an Synchronous FIFO, filed Dec. 6, 1995.
Andrew Hawkins et al., U.S.S.N. 08/578,209 Programmable Read-Write Word Line Equality Signal Generation for FIFOs, filed Dec. 29, 1995.
Pidugu Narayana et al., U.S.S.N. 08/666,751 Half-Full Flag Generator for Synchronous FIFOs, filed Jun. 19, 1996.
P. Forstner, FIFOs With a Word Width of One Bit, First-In, First-Out Technology, Mar. 1996, pp. 1-24.
T. Jackson, FIFO Memories: Solution to Reduce FIFO Metastability, First-In, First-Out Technology, Mar. 1996, pp. 1-6.
T. Jackson, Advanced Bus-Matching/Byte-Swapping Features for Internetworking FIFO Applications, Mar. 1996, pp. 1-3, 5-12.
T. Jackson, Parity-Generate and Parity-Check Features for High Bandwidth-Computing FIFO Applications, Mar. 1996, pp. 1-3, 5-8.
T. Ishii et al., High-Speed, High-Drive SN74ABT7819 FIFO, Mar. 1996, pp. 1-3, 5-12.
C. Wellheuser et al., Internetworking the SN74ABT3614, Mar. 1996, pp. 1-21.
C. Wellheuser, Metastability Performance of Clocked FIFOs, 1996, pp. 1-3, 5-12.
High Speed CMOS 256 x 36 x 2 Bi-direction FIFO, QS725420A, MDSF-00018-01, Apr. 24, 1995, pp. 1-36.
High-Speed CMOS 4K x 9 Clocked FIFO with Output Enable, QS7244A, MDSF-00008-05, Jun. 6, 1995, pp. 1-12.
High-Speed CMOS 1K X 36 Clocked FIFO with Bus Sizing, QS723620, MDSF-00020-00, Jul. 17, 1995, pp. 1-36.
Cypress Preliminary CY7C 4425/4205/4215/CY7C4225/4235/4245 64, 256,512, 1K, 2K,4K x 18 Synchronous FIFOS, pp. 5-67-5-82.

Affiliated with

Also associated with

Rating

Circuit having plurality of carry/sum adders having read count, does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Circuit having plurality of carry/sum adders having read count, , we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Circuit having plurality of carry/sum adders having read count, will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-1464963