{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:05:06Z","timestamp":1725570306407},"publisher-location":"Berlin, Heidelberg","reference-count":60,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540404088"},{"type":"electronic","value":"9783540449898"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44989-2_89","type":"book-chapter","created":{"date-parts":[[2010,11,19]],"date-time":"2010-11-19T17:10:02Z","timestamp":1290186602000},"page":"745-752","source":"Crossref","is-referenced-by-count":2,"title":["Constructive Threshold Logic Addition"],"prefix":"10.1007","author":[{"given":"Valeriu","family":"Beiu","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"89_CR1","unstructured":"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) [Also in: Proc. ISIT\u201993, 433 (1993); SIAM J. Disc. Math., 7(1), 1\u20138 (1994); US Patent 5357528 (10\/18\/1994)]"},{"key":"89_CR2","volume-title":"Neural Networks Using Threshold Gates: A Complexity Analysis of Their Areaand Time-Efficient VLSI Implementations","author":"V. Beiu","year":"1994","unstructured":"V. Beiu: Neural Networks Using Threshold Gates: A Complexity Analysis of Their Areaand Time-Efficient VLSI Implementations, PhD dissertation, Katholieke Univ. Leuven, Belgium (1994)"},{"key":"89_CR3","volume-title":"Handbook of Neural Computation","author":"V. Beiu","year":"1996","unstructured":"V. Beiu: Digital integrated circuit implementations, Chapter E1.4 in R. Beale (eds.): Handbook of Neural Computation. New York: Inst. of Physics [20] (1996)"},{"issue":"1\u20133","key":"89_CR4","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0925-2312(97)00099-4","volume":"19","author":"V. Beiu","year":"1998","unstructured":"V. Beiu: On the circuit and VLSI complexity of threshold gate COMPARISON. Neurocomputing, 19(1\u20133), 77\u201398 (1998)","journal-title":"Neurocomputing"},{"key":"89_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/BFb0100486","volume-title":"Proc. IWANN\u201999","author":"V. Beiu","year":"1999","unstructured":"V. Beiu: Neural addition and Fibonacci numbers. Proc. IWANN\u201999, LNCS 1607, Vol. 2, 198\u2013207 (1999)"},{"key":"89_CR6","unstructured":"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)"},{"key":"89_CR7","unstructured":"V. Beiu: Adder having reduced number of internal layers and method of operation thereof. US Patent 6438572 (08\/20\/2002)"},{"issue":"7","key":"89_CR8","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1016\/0893-6080(96)00130-X","volume":"9","author":"V. Beiu","year":"1996","unstructured":"V. Beiu, J.G. Taylor: On the circuit complexity of sigmoid feedforward neural networks. Neural Networks, 9(7), 1155\u20131171 (1996)","journal-title":"Neural Networks"},{"key":"89_CR9","first-page":"83","volume":"93","author":"V. Beiu","year":"1993","unstructured":"V. Beiu, J.A. Peperstraete, J. Vandewalle, R. Lauwereins: Comparison and threshold gate decomposition. Proc. MicroNeuro\u201993, 83\u201390 (1993)","journal-title":"Proc. MicroNeuro\u2019"},{"key":"89_CR10","first-page":"664","volume":"94","author":"V. Beiu","year":"1994","unstructured":"V. Beiu, J.A. Peperstraete, J. Vandewalle, R. Lauwereins: Area-time performances of some neural computation. Proc. SPRANN\u201994, 664\u2013668 (1994)","journal-title":"Proc. SPRANN\u2019"},{"key":"89_CR11","first-page":"166","volume":"94","author":"V. Beiu","year":"1994","unstructured":"V. Beiu, J.A. Peperstraete, J. Vandewalle, R. Lauwereins: Addition using constrained threshold gates. Proc. ConTI\u201994, 166\u2013177 (1994)","journal-title":"Proc. ConTI\u2019"},{"key":"89_CR12","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1109\/TNN.2003.816365"},{"key":"89_CR13","unstructured":"R. Betts: Majority logic binary adder. US Patent 3440413 (04\/22\/1969)"},{"issue":"3","key":"89_CR14","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1109\/TC.1982.1675982","volume":"31","author":"R.P. Brent","year":"1982","unstructured":"R.P. Brent, H.T. Kung: A regular layout for parallel adders. IEEE Trans. Comput., 31(3), 260\u2013264 (1982)","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"89_CR15","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0885-064X(90)90001-T","volume":"6","author":"J. Bruck","year":"1990","unstructured":"J. Bruck, J.W. Goodmann: On the power of neural networks for solving hard problems. J. Complexity, 6(2), 129\u2013135 (1990)","journal-title":"J. Complexity"},{"issue":"1","key":"89_CR16","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1162\/neco.1995.7.1.173","volume":"7","author":"S.A. Cannas","year":"1995","unstructured":"S.A. Cannas: Arithmetic perceptrons. Neural Computation, 7(1), 173\u2013181 (1995)","journal-title":"Neural Computation"},{"issue":"8","key":"89_CR17","doi-asserted-by":"publisher","first-page":"920","DOI":"10.1109\/12.156534","volume":"41","author":"P.K. Chang","year":"1992","unstructured":"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\u2013930 (1992)","journal-title":"IEEE Trans. Comput."},{"key":"89_CR18","first-page":"227","volume":"4","author":"S. Cotofana","year":"1997","unstructured":"S. Cotofana, S. Vassiliadis: Low weight and fan-in neural networks for basic arithmetic operations. Proc. IMACS\u201997, Vol. 4, 227\u2013232 (1997)","journal-title":"Proc. IMACS\u201997"},{"issue":"9","key":"89_CR19","doi-asserted-by":"publisher","first-page":"1110","DOI":"10.1109\/12.2261","volume":"37","author":"R.W. Doran","year":"1988","unstructured":"R.W. Doran: Variants of an improved carry look-ahead adder. IEEE Trans. Comput., 37(9), 1110\u20131113 (1988)","journal-title":"IEEE Trans. Comput."},{"volume-title":"Handbook of Neural Computation","year":"1996","key":"89_CR20","unstructured":"E. Fiesler, R. Beale (eds.): Handbook of Neural Computation. New York: Inst. of Physics (1996)"},{"issue":"4","key":"89_CR21","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1109\/5.573741","volume":"85","author":"K.F. Goser","year":"1997","unstructured":"K.F. Goser, C. Pacha, A. Kanstein, and M.L. Rossmann: Aspects of system and circuits for nanoelectronics. Proc. IEEE, 85(4), 558\u2013573 (1997)","journal-title":"Proc. IEEE"},{"key":"89_CR22","unstructured":"D. Hammerstrom: The connectivity analysis of simple associations \u2014or\u2014 How many connections do you need. In D.Z. Anderson (ed.): Neural Inform. Proc. Sys., New York: Inst. of Physics, 338\u2013347 (1988)"},{"key":"89_CR23","first-page":"418","volume":"87","author":"T. Han","year":"1987","unstructured":"T. Han, D.A. Carlson, S.P Levitan: VLSI design of high-speed, low-area addition circuitry. Proc. ICCD\u201987, 418\u2013422 (1987)","journal-title":"Proc. ICCD\u2019"},{"issue":"3","key":"89_CR24","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1137\/S0895480192235878","volume":"7","author":"J. H\u00e5stad","year":"1994","unstructured":"J. H\u00e5stad: On the size of weights for threshold gates. SIAM J. Discr. Math., 7(3), 484\u2013492 (1994)","journal-title":"SIAM J. Discr. Math."},{"key":"89_CR25","unstructured":"H. Jeong: Neural network implementation of a binary adder. US Patent 5016211 (05\/14\/1991)"},{"issue":"10","key":"89_CR26","doi-asserted-by":"publisher","first-page":"1233","DOI":"10.1109\/4.5949","volume":"23","author":"M.G. Johnson","year":"1988","unstructured":"M.G. Johnson: A symmetric CMOS NOR gate for high-speed applications. IEEE J. Solid-State Circuits, 23(10), 1233\u20131236 (1988)","journal-title":"IEEE J. Solid-State Circuits"},{"issue":"9","key":"89_CR27","doi-asserted-by":"publisher","first-page":"1181","DOI":"10.1109\/12.165399","volume":"41","author":"T.P. Kelliher","year":"1992","unstructured":"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\u20131184 (1992)","journal-title":"IEEE Trans. Comput."},{"key":"89_CR28","first-page":"107","volume":"19","author":"V.M. Khrapchenko","year":"1967","unstructured":"V.M. Khrapchenko: Asymptotic estimation of addition time of a parallel adder. Problemy Kibernetiki, 19, 107\u2013125 (1967). English transl., Syst. Th. Res., 19, 105\u2013122 (1970)","journal-title":"Problemy Kibernetiki"},{"issue":"8","key":"89_CR29","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1109\/TC.1973.5009159","volume":"22","author":"P.M. Kogge","year":"1973","unstructured":"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\u2013791 (1973)","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"89_CR30","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1145\/322217.322232","volume":"27","author":"R.E. Ladner","year":"1980","unstructured":"R.E. Ladner, M.J. Fischer: Parallel prefix computations. J. ACM, 27(4), 831\u2013838 (1980)","journal-title":"J. ACM"},{"key":"89_CR31","unstructured":"J.B. Lerch: Threshold gate circuits employing field-effect transistors. US Patent 3715603 (02\/06\/1973)"},{"issue":"11","key":"89_CR32","doi-asserted-by":"publisher","first-page":"1227","DOI":"10.1109\/4.475710","volume":"30","author":"L.A. Lev","year":"1995","unstructured":"L.A. Lev et al.: A 64-b microprocessor with multimedia support. IEEE J. Solid-State Circuits, 30(11), 1227\u20131238 (1995)","journal-title":"IEEE J. Solid-State Circuits"},{"key":"89_CR33","unstructured":"L.A. Lev: Fast static cascode logic gate. US Patent 5438283 (08\/01\/1995)"},{"issue":"2-3","key":"89_CR34","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1147\/rd.252.0156","volume":"25","author":"H. Ling","year":"1981","unstructured":"H. Ling: High speed binary adder. IBM J. Res. Develop., 25(2-3), 156\u2013166 (1981)","journal-title":"IBM J. Res. Develop."},{"issue":"2","key":"89_CR35","first-page":"1288","volume":"202","author":"O.B. Lupanov","year":"1971","unstructured":"O.B. Lupanov: On circuits of threshold elements. Dokl. Akad. Nauk SSSR, 202, 1288\u20131291 (1971). English transl., Sov. Phys. Dokl., 17(2), 91\u201393 (1972)","journal-title":"Dokl. Akad. Nauk SSSR"},{"issue":"8","key":"89_CR36","doi-asserted-by":"publisher","first-page":"931","DOI":"10.1109\/12.156535","volume":"41","author":"T. Lynch","year":"1992","unstructured":"T. Lynch, E.E. Swartzlander Jr.: A spanning tree carry lookahead adder. IEEE Trans. Comput. 41(8), 931\u2013939 (1992)","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"89_CR37","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1109\/TEC.1961.5219146","volume":"10","author":"R.C. Minnik","year":"1961","unstructured":"R.C. Minnik: Linear-input logic, IRE Trans. Electron. Comput., 10(1), 6\u201316 (1961)","journal-title":"IRE Trans. Electron. Comput."},{"key":"89_CR38","first-page":"862","volume":"81","author":"R.K. Montoye","year":"1981","unstructured":"R.K. Montoye: Area-time efficient addition in charge based technology. Proc. DAC\u2019 81, 862\u2013872 (1981)","journal-title":"Proc. DAC\u2019"},{"key":"89_CR39","volume-title":"Threshold Logic and Its Applications","author":"S. Muroga","year":"1971","unstructured":"S. Muroga: Threshold Logic and Its Applications. New York: Wiley (1971)"},{"issue":"11","key":"89_CR40","doi-asserted-by":"publisher","first-page":"1448","DOI":"10.1109\/JSSC.2002.803943","volume":"37","author":"S.D. Naffziger","year":"2002","unstructured":"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\u20131460 (2002)","journal-title":"IEEE J. Solid-State Circuits"},{"issue":"1","key":"89_CR41","first-page":"49","volume":"11","author":"E.I. Nechiporuk","year":"1964","unstructured":"E.I. Nechiporuk: The synthesis of networks from threshold elements. Problemy Kibernetiki, 11(1), 49\u201362 (1964). English transl., Automation Express, 7(1), 27\u201332 and 35\u201339 (1964)","journal-title":"Problemy Kibernetiki"},{"key":"89_CR42","first-page":"9","volume":"7","author":"T.F. Ngai","year":"1985","unstructured":"T.F. Ngai, M.J. Irwin: Regular area-efficient carry-lookahead adders. Proc. ARITH 7, 9\u201315 (1985)","journal-title":"Proc. ARITH"},{"key":"89_CR43","first-page":"10","volume":"6","author":"S. Ong","year":"1983","unstructured":"S. Ong, D.E. Atkins: A comparison of ALU structures for VLSI technology. Proc. ARITH 6, 10\u201316 (1983)","journal-title":"Proc. ARITH"},{"issue":"10","key":"89_CR44","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1109\/92.894161","volume":"8","author":"C. Pacha","year":"2000","unstructured":"C. Pacha, U. Auer, C. Burwick, P. Gl\u00f6sek\u00f6tter, 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\u2013572 (2000)","journal-title":"IEEE Trans. VLSI Syst."},{"key":"89_CR45","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1836.001.0001","volume-title":"Circuit Complexity and Neural Networks","author":"I. Parberry","year":"1994","unstructured":"I. Parberry: Circuit Complexity and Neural Networks. Cambridge, MA: MIT Press (1994)"},{"issue":"12","key":"89_CR46","doi-asserted-by":"publisher","first-page":"1612","DOI":"10.1109\/12.214671","volume":"41","author":"N.T. Quach","year":"1992","unstructured":"N.T. Quach, M.J. Flynn: High-speed addition in CMOS. IEEE Trans. Comput., 41(12), 1612\u20131615 (1992)","journal-title":"IEEE Trans. Comput."},{"issue":"12","key":"89_CR47","doi-asserted-by":"publisher","first-page":"1324","DOI":"10.1109\/12.817389","volume":"48","author":"J.F. Ramos","year":"1999","unstructured":"J.F. Ramos, A.G. Boh\u00f3rquez: Two operand binary adders with threshold logic. IEEE Trans. Comput., 48(12), 1324\u20131337 (1999)","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"89_CR48","first-page":"6","volume":"5","author":"N.P. Redkin","year":"1970","unstructured":"N.P. Red\u2019kin: Synthesis of threshold circuits for certain classes of Boolean functions, Kibernetika, 5(1), 6\u20139 (1970). English transl., Cybernetics, 6(1), 540\u2013544 (1973)","journal-title":"Kibernetika"},{"issue":"4","key":"89_CR49","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1109\/TC.1984.1676445","volume":"33","author":"T. Rhyne","year":"1984","unstructured":"T. Rhyne: Limitations on carry lookahead networks. IEEE Trans. Comput., 33(4), 373\u2013374 (1984)","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"89_CR50","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1109\/18.312169","volume":"40","author":"V.P. Roychowdhury","year":"1994","unstructured":"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\u2013474 (1994)","journal-title":"IEEE Trans. Info. Th."},{"issue":"10","key":"89_CR51","doi-asserted-by":"publisher","first-page":"1669","DOI":"10.1109\/5.58350","volume":"78","author":"K.-Y. Siu","year":"1990","unstructured":"K.-Y. Siu, J. Bruck: Neural computations of arithmetic functions. Proc. IEEE, 78(10), 1669\u20131675 (1990)","journal-title":"Proc. IEEE"},{"issue":"3","key":"89_CR52","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1137\/0404038","volume":"4","author":"K.-Y. Siu","year":"1991","unstructured":"K.-Y. Siu, J. Bruck: On the power of threshold circuits with small weights. SIAM J. Discr. Math., 4(3), 423\u2013435 (1991)","journal-title":"SIAM J. Discr. Math."},{"key":"89_CR53","first-page":"944","volume-title":"Advs. Neural Inform. Proc. Sys.","author":"K.-Y. Siu","year":"1992","unstructured":"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\u2013949 (1992)"},{"key":"89_CR54","first-page":"19","volume-title":"Tech. Rep., Info. Sys. Lab.","author":"K.-Y. Siu","year":"1990","unstructured":"K.-Y. Siu, V. Roychowdhury, T. Kailath: Computing with almost optimal size threshold circuits. Tech. Rep., Info. Sys. Lab., Stanford University (1990) [Also in: Proc. ISIT\u201991, 370 (1991); in S.J. Hanson, J.D. Cowan and C.L. Giles (eds.): Advs. Neural Inform. Proc. Sys. 5, San Mateo: Morgan Kaufmann, 19\u201326 (1993)]"},{"issue":"12","key":"89_CR55","doi-asserted-by":"publisher","first-page":"1402","DOI":"10.1109\/12.106225","volume":"40","author":"K.-Y. Siu","year":"1991","unstructured":"K.-Y. Siu, V.P. Roychowdhury, T. Kailath: Depth-size tradeoffs for neural computations. IEEE Trans. Comput., 40(12), 1402\u20131412 (1991)","journal-title":"IEEE Trans. Comput."},{"issue":"9","key":"89_CR56","doi-asserted-by":"publisher","first-page":"1062","DOI":"10.1109\/12.537130","volume":"45","author":"S. Vassiliadis","year":"1996","unstructured":"S. Vassiliadis, S. Cotofana, K. Berteles: 2-1 addition and related arithmetic operations with threshold logic. IEEE Trans. Comput., 45(9), 1062\u20131067 (1996)","journal-title":"IEEE Trans. Comput."},{"key":"89_CR57","doi-asserted-by":"crossref","unstructured":"I. Wegener: The Complexity of Boolean Functions. Stuttgart: Wiley-Teubner (1987)","DOI":"10.1007\/3-540-18170-9_185"},{"issue":"5","key":"89_CR58","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1109\/12.53579","volume":"39","author":"B.W.Y. Wei","year":"1990","unstructured":"B.W.Y. Wei, C.D. Thompson: Area-time optimal adder design. IEEE Trans. Comput., 39(5), 666\u2013675 (1990)","journal-title":"IEEE Trans. Comput."},{"key":"89_CR59","first-page":"1331","volume":"2","author":"C.-H. Yeh","year":"1999","unstructured":"C.-H. Yeh, E.A. Varvarigos, B. Parhami, H. Lee: Optimal-depth threshold circuits for multiplication and related problems. Proc. Asilomar\u201999, Vol. 2, 1331\u20131335 (1999)","journal-title":"Proc. Asilomar\u201999"},{"key":"89_CR60","first-page":"1349","volume":"2","author":"C.-H. Yeh","year":"2000","unstructured":"C.-H. Yeh, E.A. Varvarigos, B. Parhami: Optimal-depth circuits for prefix computation and addition. Proc. Asilomar\u20192000, Vol. 2, 1349\u20131353 (2000)","journal-title":"Proc. Asilomar\u20192000"}],"container-title":["Lecture Notes in Computer Science","Artificial Neural Networks and Neural Information Processing \u2014 ICANN\/ICONIP 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44989-2_89","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T07:42:27Z","timestamp":1559806947000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44989-2_89"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540404088","9783540449898"],"references-count":60,"URL":"https:\/\/doi.org\/10.1007\/3-540-44989-2_89","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}