Electrical pulse counters – pulse dividers – or shift registers: c – Systems – Counter includes circuit for performing an arithmetic function
Reexamination Certificate
2005-06-21
2005-06-21
Wambach, Margaret R. (Department: 2816)
Electrical pulse counters, pulse dividers, or shift registers: c
Systems
Counter includes circuit for performing an arithmetic function
C377S004000
Reexamination Certificate
active
06909767
ABSTRACT:
Circuit for selecting a second set of binary inputs according to the number of high input signals applied to a first input set. A first subcircuit has the first input set, logic generating control output signals, each control output signal represents whether the first input set has exactly a predetermined number of high input signals. Each control output signal corresponds to a different predetermined number of high input signals. A second subcircuit has a second input set, a set of control inputs for receiving control output signals from the first subcircuit, and logic including a plurality of switches including one or more pass gates. Each switching component switches to connect or isolate one of the second input set to a common output. The control inputs control the switches. The first and second subcircuits are configured such that only one switch can be switched to connect at a time.
REFERENCES:
patent: 3634658 (1972-01-01), Brown
patent: 3711692 (1973-01-01), Batcher
patent: 3757098 (1973-09-01), Wright
patent: 4399517 (1983-08-01), Niehaus et al.
patent: 4463344 (1984-07-01), Adler 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: 5325320 (1994-06-01), Chiu
patent: 5343417 (1994-08-01), Flora
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: 5712792 (1998-01-01), Yamashita 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: 6173414 (2001-01-01), Zumkehr et al.
patent: 6175852 (2001-01-01), Dhong et al.
patent: 6269386 (2001-07-01), Siers et al.
patent: 6430251 (2002-08-01), Gold
patent: 6470443 (2002-10-01), Emer et al.
patent: 6490608 (2002-12-01), Zhu
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: 0992882 (2000-04-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-99/22292 (1999-05-01), None
patent: WO-02/12995 (2002-02-01), None
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., “on Parallel Digital Multipliers,”Associazione Elettrontecnia ed Elettronica Italiana, Reprinted from Alta Freq. 45:574-580, (1976), pp. 126-132.
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 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), 22 pages.
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), pp. 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.II :28cm, (1992), pp. 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), 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.
Knowles, S., “A Family of Adders,”Proc. 14th IEEE Symp. on computer Arithmetic, (1999), pp. 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,” available 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), pp. 786-793.
Ladner, Richard E., et al., “Parallel Prefix Computation,”Journal of ACM, vol. 27, No. 4, (Oct. 1980), pp. 831-838.
Ling, Huey, “High-Speed Binary Adder,”IBM Journal of Research and Developmentvol. 25, No. 3, (1981), pp. 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.
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), pp. 292-301.
Sklansky, J., “Conditional-Sum Addition Logic,”IRE Trans., EC-9, (Jun. 1960), pp. 226-231.
Swartzlander Jr., E E., “Parallel Counters,”IEEE Transactions on Computers, C-22(11), (Nov. 1973), pp. 1021-1024.
Swartzlander Jr., E E., “Parallel Counters,”IEEE Transactions on Computers, C-22(11), (Nov. 1973), pp. 1021-1024.
Vassiliadis, S., et al., “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 Implementation,”IEEE Transactions on Computer-Aided Design, vol. 9, No. 9, (Sep. 1990), pp. 905-924.
Wallace, C., “A Suggestion for a Fast Multipiler,”IEEE Transactions on Electronic Computers, vol. EC-13, (1964), pp. 14-17.
Weinberger, A., et al., “A Logic for High-Speed Addition,”Nat. Bur. Stand. Circ., 591, (1958), pp. 3-12.
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), pp. 814-819.
PCT International Search Report relating to PCT/GB2004/00135, (Jun. 17, 2004),4 Pages.
“United Kingdom Search Report relating to Great Britain Patent Application No. GB0400799.3”, (Jun. 23, 2004), 1 Page.
Tietze, U., et al., “Halbleiterschaltungstechnik”, (1993),226-227, 273-276.
Arithmatica Limited
Schwegman Lundberg Woessner & Kluth P.A.
Wambach Margaret R.
LandOfFree
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 Logic circuit, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Logic circuit will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3464859