Electronic digital logic circuitry – Exclusive function – Half-adder or quarter-adder
Reexamination Certificate
2007-01-30
2007-01-30
Nguyen, Linh (Department: 2819)
Electronic digital logic circuitry
Exclusive function
Half-adder or quarter-adder
C708S702000
Reexamination Certificate
active
10755723
ABSTRACT:
Sum bit generation circuit includes first logic generating first signal as XOR of first and second input signals and second signal as the inverse of XOR of the first and second input signals; second logic receiving the first and second signals generated by first logic and generating an output signal as XOR of first signal and third input signal. Second logic includes at least two pass gates. First gate terminal of the first pass gate receives third input signal. A second gate terminal of the first pass gate receives the inverse of third input signal. First gate terminal of the second pass gate receives the inverse of the third input signal. Second gate terminal of the second pass gate receives the third input signal. Input terminals of the first and second pass gates receive the first signal and the second signal respectively. Pass gate output terminals generate the output signal.
REFERENCES:
patent: 3634658 (1972-01-01), Brown
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: D341423 (1993-11-01), Bible
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: D377983 (1997-02-01), Sabri 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: D407159 (1999-03-01), Roberg
patent: 5943250 (1999-08-01), Kim et al.
patent: 5964827 (1999-10-01), Ngo et al.
patent: 5995029 (1999-11-01), Ryu
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: 6353843 (2002-03-01), Chehrazi et al.
patent: 6469541 (2002-10-01), Tran et al.
patent: 6490608 (2002-12-01), Zhu
patent: 6700405 (2004-03-01), Hirairi
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: 2004/0153490 (2004-08-01), Talwar 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: 2263002 (1993-07-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
“PCT international Search Report relating to PCT/GB 03/05489”, (Sep. 15, 2004), 4 Pages.
“United Kingdom Search Report relating to Great Britain Patent Application No. GB0326611.1”, (Mar. 29, 2004), 1 Page.
Bedrij, O. J., “Carry-Select Adder”,IRE Trans.,EC-11, (Jun. 1962),340-346.
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 Freq.45:574-580, (1976),pp. 126-132.
Dadda, L. , “Some Schemes for Parallel Multipliers”,Assocciazione Elettrotenica ed Elettronica Italiana, Reprinted from Alta Freq.34:349-356, (1965),pp. 118-125.
De Micheli, G., et al., “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., et al., “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 , et al., “Advanced Computer Arithmetic 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.
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.
Ho, I. , et al., “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),80-85.
Jones, Jr., Robert , et al., “Parallel Counter Implementation”,Conf. Rec. 26th Asilomar Conf. Signals, Systems&Computers, 1, (1992),pp. 381-385.
Knowles, S. , “A Family of Adders”,Proc. 14th IEEE Symp. on Computer Arithmetic, (1999),30-34.
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”, availabe at ftp://ftp.rsasecurity.com/pub/pdfs/tr801.pdf., Version 1.0,(Aug. 1995),30 pages.
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),786-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.
Monteiro, J. , et al., “Bitwise Encoding of Finite State Machines”,Proceedings of the 7th International Conference on VLSI Design, (Jan. 1994),pp. 379-382.
Nicholson, J. O., “Parallel-Carry Adders Listing Two-Bit Covers”,IBM Technical Disclosure Bulletin, 22(11), (Apr. 1980),5036-5037.
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.
Ong, S., et al., “A Comparision of ALU Structures for VLSI Technology”,Proceedings, 6th Symposium on Computer Arithmetic(IEEE), (1983),10-16.
Schmookler, M. S., et al., “Group-Carry Generator”,IBM Technical Disclosure Bulletin, 6(1), (Jun. 1963),77-78.
Sklansky, J. , “Con
Arithmatica Limited
Nguyen Linh
Schwegman Lundberg Woessner & Kluth P.A.
LandOfFree
Sum bit generation 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 Sum bit generation circuit, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sum bit generation circuit will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3765240