Parallel counter and a multiplication logic circuit

Details Parallel counter and a multiplication logic circuit Parallel counter and a multiplication logic circuit

2005-04-19

2005-04-19

Malzahn, D. H. (Department: 2124)

Electrical computers: arithmetic processing and calculating

Electrical digital calculating computer

Particular function performed

C708S626000

Reexamination Certificate

active

06883011

ABSTRACT:
A parallel counter comprises logic for generating output bits as symmetrical functions of the input bits. The parallel counter can be used in a multiplication circuit. A multiplication circuit is also provided in which an array of combinations of each bit of a binary number with each other bit of another binary number is generated having a reduced form in order to reduce the steps required in array reduction.

REFERENCES:
patent: 3634658 (1972-01-01), Brown
patent: 3757098 (1973-09-01), Wright
patent: 4399517 (1983-08-01), Niehaus et al.
patent: 4596256 (1986-06-01), Ascher et al.
patent: 4607176 (1986-08-01), Burrows et al.
patent: 4993421 (1991-02-01), Thornton
patent: 5095457 (1992-03-01), Jeong
patent: 5175862 (1992-12-01), Phelps et al.
patent: 5187679 (1993-02-01), Vassiliadis et al.
patent: D341423 (1993-11-01), Bible
patent: 5325320 (1994-06-01), Chiu
patent: 5343417 (1994-08-01), Flora
patent: 5497342 (1996-03-01), Mou et al.
patent: 5524082 (1996-06-01), Horstmann et al.
patent: D377983 (1997-02-01), Sabri et al.
patent: D407159 (1999-03-01), Roberg
patent: 5964827 (1999-10-01), Ngo et al.
patent: 5995029 (1999-11-01), Ryu
patent: 6023566 (2000-02-01), Belkhale et al.
patent: 6175852 (2001-01-01), Dhong et al.
patent: 6269386 (2001-07-01), Siers et al.
patent: 6490608 (2002-12-01), Zhu
patent: 20020026465 (2002-02-01), Rumynin et al.
patent: 20020078110 (2002-06-01), Rumynin et al.
patent: 0168650 (1986-01-01), None
patent: 0309292 (1989-03-01), None
patent: 0442356 (1991-08-01), None
patent: 0741354 (1996-11-01), None
patent: 2475250 (1981-08-01), None
patent: 2016181 (1979-09-01), None
patent: 2062310 (1981-05-01), None
patent: 2365636 (2002-02-01), None
patent: 2365637 (2002-02-01), None
patent: WO-9922292 (1999-05-01), None
patent: WO-0212995 (2002-02-01), None
Booth, A.D., “A Signed Binary Multiplication Technique”,Oxford University Press, Reprinted from Q.J. Mech. Appl. Math. 4:236-240, pp. 100-104, (1951).
Dadda, L., “On Parallel Digital Multipliers”,Associazione Elettrontecnia ed Elettronica Italiana, Reprinted from Alta Freq. 45:574-580, pp. 126132, (1976).
Dadda, L., “Some Schemes For Parallel Multipliers”,Assocciazione Elettrotenica ed Elettronica Italiana, Reprinted from Alta Freq. 34:349-356, pp. 118-125, (1965).
Foster, C.C., et al., “Counting Responders in an Associative Memory”,The Institute of Electrical and Electronics Engineers, Inc., Reprinted, with permission, from IEEE Trans. Comput. C-20:1580-1583, pp. 86-89, (1971).
Swartzlander, Jr., E.E., “Parallel Counters”,Institute of Electrical and Electronic Engineers, Inc., Reprinted, with permission from IEEE Trans. Comput. C-22:1021-1024, pp. 14-17, (1973).
Wallace, C.S., “A Suggestion for a Fast Multiplier”,The Institute of Electrical and Electronics Engineers, Inc., Reprinted, with permission, from IEEE Trans. Electron. Comput. EC-13:14-17, pp. 14-17, (1964).
Jones, R.F., et al., “Parallel Counter Implementation”,Conf. Rec. 26th Asilomar Conf. Signals, Systems & Computers, vol. 1, ISBN 0-8186-3160-0, pp. 381-385, (1992).
Fleisher, H., “Combinatorial Techniques for Performing Arithmetic and Logical Operations”,IBM Research Center, RC-289, Research Report, pp. 1-20, (Jul. 18, 1960).
Ho, I.T., et al., “Multiple Addition by Residue Threshold Functions and Their Representation By Array Logic”,The Institute of Electrical and Electronics Engineers, Inc., Trans. Comput. C-22: 762-767, pp. 80-85, (1973).
Chakraborty, S.,et al. ,“Synthesis of Symmetric Functions for Path-Delay Fault Testability”,12th International Conference on VLSI Design, (1999),pp. 512-517.
Debnath, D.,“Minimization of AND-OR-EXOR Three-Level Networks with AND Gate Sharing”,IEICE Trans. Inf.&Syst., E80-D, 10, (1997),pp. 1001-1008.
Drechsler, R.,et al. ,“Sympathy: Fast Exact Minimization of Fixed Polarity Reed-Muller Expressions for Symmetric Functions”,IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 16(1), (1997),pp. 1-5.
Drechsler, R.,et al. ,“Sympathy: Fast Exact Minimization of Fixed Polarity Reed-Muller Expressions for Symmetric Functions”,IEEE, (1995),pp. 91-97.
Jones, Jr., R..,et al. ,“Parallel Counter Implementation”,IEEE, (1992),pp. 381-385.
Nienhaus, H.,“Efficient Multiplexer Realizations of Symmetric Functions”,IEEE, (1981), pp. 522-525.
Vassiliadis, S.,et al. ,“7/2 Counters and Multiplication with Threshold Logic”,IEEE, (1997), pp. 192-196.
Goto, et al., “A 54 ×54-b Regularly Structured Tree Multiplier”,IEEE Journal of Solid-State Circuits, vol. 27, No. 9, (Sep. 1992),1229-1236.
Hekstra, et al., “A Fast Parallel Multiplier Architecture”,IEEE International Symposium on Circuits and Systems; Institute of Electrical and Electronic Engineers, c1977-c1996, 20v. :ill. :28cm, (1992),2128-2131.
Oklobdzija, V G., et al., “Improving multiplier design by using improved column compression tree and optimized final adder in CMOS technology”,IEEE transactions on Very Large Scale Integration(VLSI)Systems, IEEE, Inc, New York, vol. 3, No. 2,(Jun. 1995),292-301.
Zuras, D , et al., “Balanced delay trees and combinatorial division in VLSI”,IEEE Journal of Solid State Circuits, IEEE Inc, New York, vol. SC-21, No. 5,(Oct. 1986),814-819.
Bedrij, O. J., “Carry-Select Adder”,IRE Trans., EC-11, (Jun. 1962),340-346.
Knowles, S. , “A Family of Adders”,Proc. 14th IEEE Symp. on Computer Arithmetic, (1999),30-34.
Kogge, P. M., et al., “A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations”,IEEE Trans. Computers, vol. C-22, No. 8, (Aug. 1973),788-793.
Ladner, Richard E., et al., “Parallel Prefix Computation”,Journal of ACM, vol. 27, No. 4, (Oct. 1980),831-838.
Ling, Huey , “High-Speed Binary Adder”,IBM Journal of Research and Development, vol. 25, No. 3, (1981),156-166.
Sklansky, J. , “Conditional-Sum Addition Logic”,IRE Trans., EC-9, (Jun. 1960),226-231.
Weinberger, A. , et al., “A Logic for High-Speed Addition”,Nat. Bur. Stand. Circ., 591, (1958),3-12.

Affiliated with

Also associated with

Rating

Parallel counter and a multiplication logic circuit does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Parallel counter and a multiplication logic circuit, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parallel counter and a multiplication logic circuit will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3395458