Electrical computers: arithmetic processing and calculating – Electrical digital calculating computer – Particular function performed
Reexamination Certificate
2007-08-21
2007-08-21
Ngo, Chuong D. (Department: 2193)
Electrical computers: arithmetic processing and calculating
Electrical digital calculating computer
Particular function performed
Reexamination Certificate
active
10714408
ABSTRACT:
Logic circuit for generating carry or sum bit output by combining binary inputs, includes bit level carry generate and propagate function logic receiving binary inputs and generating bit level carry generate/propagate function bits for binary inputs by respectively logically AND and OR combining respective bits of binary inputs; logic generating high output if a carry is generated out of a first group of most significant bits of binary input or if carry propagate function bits for the most significant bits are all high; logic for receiving bit level carry generate and propagate function bits for binary inputs to generate high output if any of carry generate function bits for the most significant bits are high or if carry is generated out of another group of least significant bits of binary input; and logic for generating the carry or sum bit output by combining outputs of the two logics.
REFERENCES:
patent: 3634658 (1972-01-01), Brown
patent: 3711692 (1973-01-01), Batcher
patent: 3757098 (1973-09-01), Wright
patent: 3843876 (1974-10-01), Fette et al.
patent: 4399517 (1983-08-01), Niehaus et al.
patent: 4463344 (1984-07-01), Adler et al.
patent: 4564921 (1986-01-01), Suganuma
patent: 4592007 (1986-05-01), Ohhashi
patent: 4596256 (1986-06-01), Ascher et al.
patent: 4607176 (1986-08-01), Burrows et al.
patent: 4713790 (1987-12-01), Kloker et al.
patent: 4831578 (1989-05-01), Bui
patent: 4866658 (1989-09-01), Mazin et al.
patent: 4870609 (1989-09-01), Yasui 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: 5321752 (1994-06-01), Iwamura et al.
patent: 5325320 (1994-06-01), Chiu
patent: 5343417 (1994-08-01), Flora
patent: 5343418 (1994-08-01), Zinger
patent: 5363099 (1994-11-01), Allen
patent: 5475388 (1995-12-01), Gormish et al.
patent: 5497342 (1996-03-01), Mou et al.
patent: 5524082 (1996-06-01), Horstmann et al.
patent: 5701504 (1997-12-01), Timko
patent: 5712792 (1998-01-01), Yamashita et al.
patent: 5717622 (1998-02-01), Kawamoto et al.
patent: 5875124 (1999-02-01), Takahashi
patent: 5943250 (1999-08-01), Kim et al.
patent: 5964827 (1999-10-01), Ngo et al.
patent: 5978827 (1999-11-01), Ichikawa
patent: 5995029 (1999-11-01), Ryu
patent: 6008668 (1999-12-01), Saruwatari
patent: 6023566 (2000-02-01), Belkhale et al.
patent: 6035318 (2000-03-01), Abdallah et al.
patent: 6173414 (2001-01-01), Zumkehr et al.
patent: 6175852 (2001-01-01), Dhong et al.
patent: 6223198 (2001-04-01), Oberman et al.
patent: 6269386 (2001-07-01), Siers et al.
patent: 6344760 (2002-02-01), Pyo
patent: 6353843 (2002-03-01), Chehrazi et al.
patent: 6430251 (2002-08-01), Gold
patent: 6445210 (2002-09-01), Nojiri
patent: 6469541 (2002-10-01), Tran et al.
patent: 6470443 (2002-10-01), Emer et al.
patent: 6490608 (2002-12-01), Zhu
patent: 6577164 (2003-06-01), Tomita
patent: 6598061 (2003-07-01), Symes et al.
patent: 6691143 (2004-02-01), Blaker
patent: 6700405 (2004-03-01), Hirairi
patent: 6724223 (2004-04-01), Ichiguchi et al.
patent: 6748410 (2004-06-01), Gressel et al.
patent: 6882175 (2005-04-01), Motegi et al.
patent: 6883011 (2005-04-01), Rumynin et al.
patent: 6909767 (2005-06-01), White
patent: 6938061 (2005-08-01), Rumynin et al.
patent: 7042246 (2006-05-01), Talwar et al.
patent: 7136888 (2006-11-01), Rumynin et al.
patent: 7139788 (2006-11-01), Talwar et al.
patent: 7170317 (2007-01-01), White
patent: 2001/0010051 (2001-07-01), Oberman et al.
patent: 2002/0026465 (2002-02-01), Rumynin et al.
patent: 2002/0078110 (2002-06-01), Rumynin et al.
patent: 2002/0138538 (2002-09-01), Talwar et al.
patent: 2003/0016055 (2003-01-01), Oodaira et al.
patent: 2003/0120694 (2003-06-01), Qi
patent: 2004/0225705 (2004-11-01), Rumynin
patent: 2004/0236814 (2004-11-01), White
patent: 2005/0144217 (2005-06-01), Parhi 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: 0947914 (1999-10-01), None
patent: 0992882 (2000-04-01), None
patent: 2475250 (1981-08-01), None
patent: 2016181 (1979-09-01), None
patent: 2062310 (1981-05-01), None
patent: 2263002 (1993-07-01), None
patent: 2318892 (1998-05-01), None
patent: 2365636 (2002-02-01), None
patent: 2365637 (2002-02-01), None
patent: 8212057 (1996-08-01), None
patent: WO-99/22292 (1999-05-01), None
patent: WO-02/12995 (2002-02-01), None
patent: WO-03052583 (2003-06-01), None
Booth, Andrew , “A Signed Binary Multiplication Technique”,Oxford University Press, Reprinted from Q.J. Mech. Appl. Math. 4:236-240, (1951),pp. 100-104.
Chakraborty , S. , et al., “Synthesis of Symmetric Functions for Path-Delay Fault Testability”,12th International Conference on VLSI Design, (1999),pp. 512-517.
Dadda, L. , “On Parallel Digital Multipliers”,Associazione Elettrontecnia ed Elettronica Italiana, Reprinted from Alta Freg. 45:574-580, (1976),pp. 126-132.
Dadda, L. , “Some Schemes for Parallel Multipliers”,Assocciazione Elettrotenica ed Elettronica Italiana, Reprinted from Alta Freg. 34:349-356, (9165),pp. 118-125.
De Micheli, G. , “Optimal State Assignment for Finite State Machines”,IEEE Transactions on Computer-Aided Design, vol. CAD-4 (3), (Jul. 1985),pp. 269-285.
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. , “Sympathy: Fast Exact Minimization of Fixed Polarity Reed-Muller Expressions for Symmetric Functions”,IEEE ED&TC 1995, Proceedings European Design and Test Conference, (Mar. 6-9, 1995),91-97.
Fleisher, H , “Combinatorial Techniques for Performing Arithmetic and Logical Operations”,IBM Research Center, RC-289, Research Report, (Jul. 18, 1960),22 pages.
Flynn, M , “Advanced Computer Arithmatic Design”,John Wiley&Sons 2001, (2001),46-59.
Foster, Caxton , 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,(1971),pp. 86-89.
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.
Ho, I. , “Multiple Addition by Residue Threshold Functions and Their Representation By Array Logic”,The Institute of Electrical and Electronics Engineers, Inc., Reprinted, with permission from IEEE Trans. Comput. C-22:762-767, (1973),pp. 80-85.
Jones, Robert , et al., “Parallel Counter Implementation”,Conf. Rec. 26th Asilomar Conf. Signals, Systems&Computers, vol. 1, ISBN 0-8186-3160-0,(1992),pp. 381-385.
Koc, C , “High-Speed RSA Implementation”, available at ftp://ftp.rsasecurity.com/pub/pdfs/tr201.pdf., Version 2.0,(Nov. 1994), 73 pages.
Koc, C , “RSA Hardware Implementation”, available at ftp://ftp.rsasecurity.com/pub/pdfs/tr801.pdf., Version 1.0,(Aug. 1995),30 pages.
Monteiro, J. , et al., “Bitwise Encoding of Finite State Machines”,Proceedings of the 7th International Conference on VLSI Design, (Jan. 1994),pp. 379-382.
Nienhaus, H. , “Efficient Multiplexer Realizations of Symmetric Functions”,IEEE, (1981),pp. 522-525.
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,(1995),292-301.
Swartzlander, Jr., E E., “Parallel Counters”,IEEE Transactions on Computers, C-22(11), (Nov. 1973), 1021-1024.
Vassiliadis, S. , “7/2 Counters and Multiplication with Threshold Logic”,IEEE, (1997),pp. 192-196.
Villa, Tiziano , et al., “NOVA: State Assignment of Finite State Machines for Optimal Two-Level Logic Implem
Jackson Robert
Talwar Sunil
Arithmatica Limited
Ngo Chuong D.
Schwegman, Lundberg, Woessner and Kluth P.A.
LandOfFree
Logic circuit and method for carry and sum generation and... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Logic circuit and method for carry and sum generation and..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Logic circuit and method for carry and sum generation and... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3851056