Binary tree calculations on monolithic integrated circuits

Details Binary tree calculations on monolithic integrated circuits Binary tree calculations on monolithic integrated circuits

1984-02-08

1987-10-13

Harkcom, Gary V.

Boots, shoes, and leggings

364770, 364784, G05F 750

Patent

active

047003251

ABSTRACT:
Integrated circuits for performing calculations such as carry propagate addition where the number of logic stages necessary to perform each calculation is proportional to log.sub.2 times the number of bits on which the calculation is performed. The circuits are divisible into a limited number of cells, thereby minimizing complexity, for ease of design and manufacture. Each cell comprises a device for accepting a bit or bits from an operand or operands and a device for accepting intemediate binary tree values. The cell then combines the input information to produce an arithmetic resultant and intermediate binary tree values for a next succeeding cell.

REFERENCES:
patent: 3553446 (1966-08-01), Kruy
patent: 3728532 (1973-04-01), Pryor
patent: 3987291 (1976-10-01), Gooding et al.
patent: 4052604 (1977-10-01), Maitland et al.
patent: 4110832 (1978-10-01), Leininger et al.
patent: 4138731 (1979-02-01), Kamimoto et al.
patent: 4153939 (1979-05-01), Kudou
patent: 4157590 (1979-06-01), Grice et al.
patent: 4168530 (1979-09-01), Gajski et al.
patent: 4348736 (1982-09-01), Weinberger
patent: 4422157 (1983-12-01), Uhlemhoff
patent: 4425623 (1984-01-01), Russell
patent: 4559608 (1985-12-01), Young et al.
MacSorley, "High Speed Arithmetic in Binary Computers", Proceeding of the IRE, vol. #49, No. 1, pp. 67-91, Jan. 1961.
Weinberger, "A 32-Bit Adder Using Partitioned Memory Arrays as Universal Logic Elements", IBM Technical Disclosure Bulletin, vol. 14, #1, pp. 205-207, Jan. 1971.
Unger, "Tree Realizations of Iterative Circuits", IEEE Trans. on Computers, vol. C-26, #4, pp. 365-383, Apr. 1977.
Schmookler, "Two-Level Programmed Logic Array Adder", IBM Technical Disclosure Bulletin, vol. 21, #11, Apr. 1979, pp. 4313-4316.
Bechade et al., "Inverted Carry Propagation Cham", IBM Technical Disclosure Bulletin, vol. 25, #4, pp. 1818-1819, Sep. 1982.
O. J. Bedrij, "Carry-Select Adder", 3/26/1962 (364-788), IRE Transactions on Electronic Computers, pp. 340-346.
Hallin, Thomas G., Flynn, Michael J., "Pipelining of Arithmetic Functions"; Aug. 1972, IEEE Transactions on Computers, pp. 880-886.
J. Millman, "Microelectronics", pp. 170-171, McGraw-Hill, Inc. 1979.

Affiliated with

Also associated with

Rating

Binary tree calculations on monolithic integrated circuits does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Binary tree calculations on monolithic integrated circuits, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Binary tree calculations on monolithic integrated circuits will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-416039