Constructive threshold logic addition: A synopsis of the last decade

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2714, Issue , 2003, Pages 745-752

  Beiu, Valeriu ^a  

^a WASHINGTON STATE UNIVERSITY   (United States)

Author keywords

Addition; Circuit VLSI complexity; Threshold logic

Indexed keywords

COMPLEX NETWORKS; LOGIC GATES; NEURAL NETWORKS;

ADDITION; BINARY NUMBER; VLSI IMPLEMENTATION;

THRESHOLD LOGIC;

EID: 35248876646     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44989-2_89     Document Type: Article

References (68)

1. N. Alon, J. Bruck: Explicit construction of depth-2 majority circuits for comparison and addition. Res. Rep. RJ 8300 (75661), IBM Almaden Res. Center (1991)
2. [Also in: Proc. ISIT'93, 433 (1993);
3. SIAM J. Disc. Math., 7(1), 1-8 (1994); US Patent 5357528 (10/18/1994)]
4. V. Beiu: Neural Networks Using Threshold Gates: A Complexity Analysis of Their Area-and Time-Efficient VLSI Implementations, PhD dissertation, Katholieke Univ. Leuven, Belgium (1994)
5. V. Beiu: Digital integrated circuit implementations, Chapter E1.4 in [20] (1996)
6. V. Beiu: On the circuit and VLSI complexity of threshold gate COMPARISON. Neurocomputing, 19(1-3), 77-98 (1998)
7. V. Beiu: Neural addition and Fibonacci numbers. Proc. IWANN'99, LNCS 1607, Vol. 2, 198-207 (1999)
8. V. Beiu: Adder and multiplier circuits employing logic gates having discrete, weighted inputs and methods of performing combinatorial operations therewith. US Patent 6205458 (03/20/2001)
9. V. Beiu: Adder having reduced number of internal layers and method of operation thereof. US Patent 6438572 (08/20/2002)
10. V. Beiu, J.G. Taylor: On the circuit complexity of sigmoid feedforward neural networks. Neural Networks, 9(7), 1155-1171 (1996)
11. V. Beiu, I.A. Peperstraete, J. Vandewalle, R. Lauwereins: Comparison and threshold gate decomposition. Proc. MicroNeuro'93, 83-90 (1993)
12. V. Beiu, J.A. Peperstraete, J. Vandewalle, R. Lauwereins: Area-time performances of some neural computation. Proc. SPRANN'94, 664-668 (1994)
13. V. Beiu, J.A. Peperstraete, J. Vandewalle, R. Lauwereins: Addition using constrained threshold gates. Proc. ConTI'94, 166-177 (1994)
14. V. Beiu, J.M. Quintana, M.J. Avedillo: VLSI implementation of threshold logic: A comprehensive survey. IEEE Trans. Neural Networks (Special Issue on Hardware Implementations), 14(5), in press (2003)
15. R. Betts: Majority logic binary adder. US Patent 3440413 (04/22/1969)
16. R.P. Brent, H.T. Kung: A regular layout for parallel adders. IEEE Trans. Comput., 31(3), 260-264 (1982)
17. J. Bruck, J.W. Goodmann: On the power of neural networks for solving hard problems. J. Complexity, 6(2), 129-135 (1990)
18. S.A. Cannas: Arithmetic perceptrons. Neural Computation, 7(1), 173-181 (1995)
19. P.K. Chang, M.D.F Schlag, C.D. Thomborson, V.G. Oklobdzija: Delay optimization of carry-skip adders and block carry-lookahead adders using multidimensional programming. IEEE Trans. Comput., 41(8), 920-930 (1992)
20. S. Cotofana, S. Vassiliadis: Low weight and fan-in neural networks for basic arithmetic operations. Proc. IMACS'97, Vol. 4, 227-232 (1997)
21. R.W. Doran: Variants of an improved carry look-ahead adder. IEEE Trans. Comput., 37(9), 1110-1113 (1988)
22. E. Fiesler, R. Beale (eds.): Handbook of Neural Computation. New York: Inst. of Physics (1996)
23. K.F. Goser, C. Pacha, A. Kanstein, and M.L. Rossmann: Aspects of system and circuits for nanoelectronics. Proc. IEEE, 85(4), 558-573 (1997)
24. D. Hammerstrom: The connectivity analysis of simple associations -or- How many connections do you need. In D.Z. Anderson (ed.): Neural Inform. Proc. Sys., New York: Inst. of Physics, 338-347 (1988)
25. T. Han, D.A. Carlson, S.P Levitan: VLSI design of high-speed, low-area addition circuitry. Proc. ICCD'87, 418-422 (1987)
26. J. Håstad: On the size of weights for threshold gates. SIAM J. Discr. Math., 7(3), 484-492 (1994)
27. H. Jeong: Neural network implementation of a binary adder. US Patent 5016211 (05/14/1991)
28. M.G. Johnson: A symmetric CMOS NOR gate for high-speed applications. IEEE J. Solid-State Circuits, 23(10), 1233-1236 (1988)
29. T.P. Kelliher, R.M. Owens, M.J. Irwin, T.-T. Hwang: ELM a fast addition algorithm discovered by a program. IEEE Trans. Comput., 41(9), 1181-1184 (1992)
30. V.M. Khrapchenko: Asymptotic estimation of addition time of a parallel adder. Problemy Kibernetiki, 19, 107-125 (1967).
31. English transl., Syst. Th. Res., 19, 105-122 (1970)
32. P.M. Kogge, H.S. Stone: A parallel algorithm for the efficient solution of a general class of recurrence equations. IEEE Trans. Comput., 22(8), 783-791 (1973)
33. R.E. Ladner, M.J. Fischer: Parallel prefix computations. J. ACM, 27(4), 831-838 (1980)
34. J.B. Lerch: Threshold gate circuits employing field-effect transistors. US Patent 3715603 (02/06/1973)
35. L.A. Lev et al.: A 64-b microprocessor with multimedia support. IEEE J. Solid-State Circuits, 30(11), 1227-1238 (1995)
36. L.A. Lev: Fast static cascode logic gate. US Patent 5438283 (08/01/1995)
37. H. Ling: High speed binary adder. IBM J. Res. Develop., 25(2-3), 156-166 (1981)
38. O.B. Lupanov: On circuits of threshold elements. Dokl. Akad. Nauk SSSR, 202, 1288-1291 (1971).
39. English transl., Sov. Phys. Dokl., 17(2), 91-93 (1972)
40. T. Lynch, E.E. Swartzlander Jr.: A spanning tree carry lookahead adder. IEEE Trans. Comput., 41(8), 931-939 (1992)
41. R.C. Minnik: Linear-input logic, IRE Trans. Electron. Comput., 10(1), 6-16 (1961)
42. R.K. Montoye: Area-time efficient addition in charge based technology. Proc. DAC'81, 862-872 (1981)
43. S. Muroga: Threshold Logic and Its Applications. New York: Wiley (1971)
44. S.D. Naffziger, G. Colon-Bonet, T. Fischer, R. Reidlinger, T.J. Sullivan, T. Grutkowski: The implementation of the Itanium 2 microprocessor. IEEE J. Solid-State Circuits, 37(11), 1448-1460 (2002)
45. E.I. Nechiporuk: The synthesis of networks from threshold elements. Problemy Kibernetiki, 11(1), 49-62 (1964).
46. English transl., Automation Express, 7(1), 27-32 and 35-39 (1964)
47. T.F. Ngai, M.J. Irwin: Regular area-efficient carry-lookahead adders. Proc. ARITH 7, 9-15 (1985)
48. S. Ong, D.E. Atkins: A comparison of ALU structures for VLSI technology. Proc. ARITH 6, 10-16 (1983)
49. C. Pacha, U. Auer, C. Burwick, P. Glösekötter, A. Brennemann, W. Prost, F.-J. Tegude, K.F. Goser: Threshold logic circuit design for parallel adders using resonant tunneling devices. IEEE Trans. VLSI Syst., 8(10), 558-572 (2000)
50. I. Parberry: Circuit Complexity and Neural Networks. Cambridge, MA: MIT Press (1994)
51. N.T. Quach, M.J. Flynn: High-speed addition in CMOS. IEEE Trans. Comput., 41(12), 1612-1615 (1992)
52. J.F. Ramos, A.G. Bohórquez: Two operand binary adders with threshold logic. IEEE Trans. Comput., 48(12), 1324-1337 (1999)
53. N.P. Red'kin: Synthesis of threshold circuits for certain classes of Boolean functions, Kibernetika, 5(1), 6-9 (1970).
54. English transl., Cybernetics, 6(1), 540-544 (1973)
55. T. Rhyne: Limitations on carry lookahead networks. IEEE Trans. Comput., 33(4), 373-374 (1984)
56. V.P. Roychowdhury, A. Orlitsky, K.-Y. Siu: Lower bounds on threshold and related circuits via communication complexity. IEEE Trans. Info. Th., 40(2), 467-474 (1994)
57. K.-Y. Siu, J. Bruck: Neural computations of arithmetic functions. Proc. IEEE, 78(10), 1669-1675 (1990)
58. K.-Y. Siu, J. Bruck: On the power of threshold circuits with small weights. SIAM J. Discr. Math., 4(3), 423-435 (1991)
59. K.-Y. Siu, J. Bruck: Neural computing with small weights. In J.E. Moody, S.J. Hanson, R.P. Lippmann (eds.): Advs. Neural Inform. Proc. Sys. 4, San Mateo: Morgan Kaufmann, 944-949 (1992)
60. K.-Y. Siu, V. Roychowdhury, T. Kailath: Computing with almost optimal size threshold circuits. Tech. Rep., Info. Sys. Lab., Stanford University (1990)
61. [Also in: Proc. ISIT'91, 370 (1991);
62. in S.J. Hanson, J.D. Cowan and C.L. Giles (eds.): Advs. Neural Inform. Proc. Sys. 5, San Mateo: Morgan Kaufmann, 19-26 (1993)]
63. K.-Y. Siu, V.P. Roychowdhury, T. Kailath: Depth-size tradeoffs for neural computations. IEEE Trans. Comput., 40(12), 1402-1412 (1991)
64. S. Vassiliadis, S. Cotofana, K. Berteles: 2-1 addition and related arithmetic operations with threshold logic. IEEE Trans. Comput., 45(9), 1062-1067 (1996)
65. I. Wegener: The Complexity of Boolean Functions. Stuttgart: Wiley-Teubner (1987)
66. B.W.Y. Wei, C.D. Thompson: Area-time optimal adder design. IEEE Trans. Comput., 39(5), 666-675 (1990)
67. C.-H. Yeh, E.A. Varvarigos, B. Parhami, H. Lee: Optimal-depth threshold circuits for multiplication and related problems. Proc. Asilomar'99, Vol. 2, 1331-1335 (1999)
68. C.-H. Yeh, E.A. Varvarigos, B. Parhami: Optimal-depth circuits for prefix computation and addition. Proc. Asilomar'2000, Vol. 2, 1349-1353 (2000)