Electronic digital logic circuitry – Threshold
Reexamination Certificate
2006-05-09
2006-05-09
Pascal, Robert (Department: 2817)
Electronic digital logic circuitry
Threshold
Reexamination Certificate
active
07042246
ABSTRACT:
Logic circuit generating four binary outputs as four threshold functions of four binary inputs, including: first, second, third, and fourth threshold functions which are respectively high if at least one, two, three and all of the binary inputs are high; first logic having two logic parts that each include NOR and NAND gates, and having two first-level inputs for receiving the binary inputs and two first-level outputs; and second logic having four second-level outputs, four second-level inputs for receiving second-level binary inputs and connected to the four first-level outputs, NAND gate, first gate generating logical OR combinations and NAND combining the logical OR combination with two other second-level binary inputs, a second gate generating logical OR combinations of two pairs of second-level binary inputs and NAND combining the logical OR combinations, and a NOR gate; wherein one of four binary outputs is generated at each of the four outputs.
REFERENCES:
patent: 3634658 (1972-01-01), Brown
patent: 3757098 (1973-09-01), Wright
patent: 4399517 (1983-08-01), Niehaus et al.
patent: 4607176 (1986-08-01), Burrows et al.
patent: 5095457 (1992-03-01), Jeong
patent: 5175862 (1992-12-01), Phelps et al.
patent: 5187679 (1993-02-01), Vassiliadis et al.
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: 5701504 (1997-12-01), Timko
patent: 5964827 (1999-10-01), Ngo et al.
patent: 5995029 (1999-11-01), Ryu
patent: 6008668 (1999-12-01), Saruwatari
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: 6344760 (2002-02-01), Pyo
patent: 6445210 (2002-09-01), Nojiri
patent: 6490608 (2002-12-01), Zhu
patent: 6577164 (2003-06-01), Tomita
patent: 6724223 (2004-04-01), Ichiguchi et al.
patent: 6882175 (2005-04-01), Motegi et al.
patent: 2002/0026465 (2002-02-01), Rumynin et al.
patent: 2002/0078110 (2002-06-01), Rumynin et al.
patent: 2003/0016055 (2003-01-01), Oodaira et al.
patent: 2004/0103135 (2004-05-01), Talwar 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: WO-99/22292 (1999-05-01), None
patent: WO-02/12995 (2002-02-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 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.
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.
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.
Fleisher, H., “Combinatorial Techniques for Performing Arithmetic and Logical Operations”,IBM Research Center, RC-289, Research Report, (Jul. 18, 1960),1-20.
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. ;iII. ;28cm, (1992),2128-2131.
Ho, Irving, 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, (1973),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.
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., et al., “7/2 Counters and Multiplication with Threshold Logic”,IEEE, (1997),pp. 192-196.
Wallace, C., “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, (1964),114-117.
Zuras, D , et al., “Balanced delay trees and combinatorial division in VLSI”,IEEE Journal of Solid State Circuits, SC-21, IEEE Inc, New York, vol. SC-21, No. 5,(1986),814-819.
“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.
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),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.
Nicholson, J. O., “Parallel-Carry Adders Listing Two-Bit Covers”,IBM Technical Disclosure Bulletin, 22(11), (Apr. 1980),5036-5037.
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., “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.
Weinberger, A., “Extension of the Size of Group Carry Signals”,IBM Technical Disclosure Bulletin, 22(4), (Sep., 1979),1548-1550.
Weinberger, A., “Improved Carry-Look-Ahead”,IBM Technical Disclosure Bulletin, 21(6), (Nov., 1978),2460-2461.
Meulemans Peter
Rumynin Dmitriy
Talwar Sunil
Arithmatica Limited
Flanagan Krista
Pascal Robert
LandOfFree
Logic circuits for performing threshold functions 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 circuits for performing threshold functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Logic circuits for performing threshold functions will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3561736