{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:44:07Z","timestamp":1725475447003},"publisher-location":"Berlin, Heidelberg","reference-count":40,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540660682"},{"type":"electronic","value":"9783540487722"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/bfb0100486","type":"book-chapter","created":{"date-parts":[[2006,12,7]],"date-time":"2006-12-07T13:00:25Z","timestamp":1165496425000},"page":"198-207","source":"Crossref","is-referenced-by-count":4,"title":["Neural addition and fibonacci numbers"],"prefix":"10.1007","author":[{"given":"Valeriu","family":"Beiu","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,11,17]]},"reference":[{"key":"21_CR1","series-title":"IBM Technical Report RJ 8300 (75661)","volume-title":"Explicit Construction of Depth-2 Majority Circuits for Comparison and Addition","author":"N. Alon","year":"1991","unstructured":"Alon, N., & Bruck, J. (1991). Explicit Construction of Depth-2 Majority Circuits for Comparison and Addition. IBM Technical Report RJ 8300 (75661). San Jose, CA: IBM Almaden Research Center."},{"unstructured":"Alon, N., & Bruck, J. (1994). Depth-2 Threshold Logic Circuits for Logic and Arithmetic Functions. Patent US 5357528.","key":"21_CR2"},{"unstructured":"Beiu, V., Peperstraete, J.A., Vandewalle, J., & Lauwereins, R., (1994a). Area-Time Performances of Some Neural Computations. In P. Borne. T. Fukuda & S.G. Tzafestas (Eds.): Proc. IMACS Intl. Symp. on Signal Proc. Robotics and Neural Networks, Lille, France (pp. 664\u2013668). Lille: GERF EC.","key":"21_CR3"},{"doi-asserted-by":"crossref","unstructured":"Beiu, V., Peperstraete, J.A., Vandewalle, J., & Lauwereins, R., (1994b). On the Circuit Complexity of Feedforward Neural Networks. In M. Marinaro & P.G. Morasso (eds.): Proc. Intl. Conf. on Artif. Neural Networks, Sorrento, Italy (pp. 521\u2013524). Springer-Verlag.","key":"21_CR4","DOI":"10.1007\/978-1-4471-2097-1_121"},{"unstructured":"Beiu, V., Peperstraete, J.A., Vandewalle, J., & Lauwereins, R., (1994c). Optimal Parallel Addition Means Constant Fan-In Threshold Gates. In Proc. Intl. Conf. on Technical Informatics, Timisoara (vol. 5, pp. 166\u2013177). Timisoara: Technical University of Timisoara Press.","key":"21_CR5"},{"unstructured":"Beiu, V. (1996). Constant Fan-In Discrete Neural Networks Are VLSI-Optimal. In S. W. Ellacott, J.C. Mason, & I.J. Anderson (eds.): Mathematics of Neural Networks\u2014Models, Algorithms and Applications (pp. 89\u201394). Kluwer Academic.","key":"21_CR6"},{"issue":"7","key":"21_CR7","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1016\/0893-6080(96)00130-X","volume":"9","author":"V. Beiu","year":"1996","unstructured":"Beiu, V., & Taylor, J.G. (1996). On the circuit complexity of sigmoid feed-forward neural networks. Neural Networks, 9(7), 1155\u20131171.","journal-title":"Neural Networks"},{"issue":"1","key":"21_CR8","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0925-2312(97)00099-4","volume":"19","author":"V. Beiu","year":"1998","unstructured":"Beiu, V. (1998). On the Circuit and VLSI Complexity of Threshold Gate Comparison. Neurocomputing, 19(1), 77\u201398.","journal-title":"Neurocomputing"},{"issue":"3","key":"21_CR9","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1109\/TC.1982.1675982","volume":"31","author":"R.P. Brent","year":"1982","unstructured":"Brent, R.P., & Kung, H.T. (1982). A Regular Layout for Parallel Adders. IEEE Trans. on Comp., 31(3), 260\u2013264.","journal-title":"IEEE Trans. on Comp."},{"issue":"1","key":"21_CR10","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1162\/neco.1995.7.1.173","volume":"7","author":"S.A. Cannas","year":"1995","unstructured":"Cannas, S.A. (1995). Arithmetic Perceptrons. Neural Computation, 7(1), 173\u2013181.","journal-title":"Neural Computation"},{"issue":"2","key":"21_CR11","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1137\/0213028","volume":"13","author":"A.K. Chandra","year":"1984","unstructured":"Chandra, A.K., Stockmeyer, L.J., & Vishkin, U. (1984). Constant Depth Reducibility. SIAM J. Comput., 13(2), 423\u2013539.","journal-title":"SIAM J. Comput."},{"issue":"8","key":"21_CR12","doi-asserted-by":"publisher","first-page":"920","DOI":"10.1109\/12.156534","volume":"41","author":"P.K. Chang","year":"1992","unstructured":"Chang, P.K., Schlag, M.D.F., Thomborson, C.D., & Oklobdzija, V.G. (1992). Delay Optimization of Carry-Skip Adders and Block Carry-Lookahead Adders Using Multidimensional Programming. IEEE Trans. on Comp., 41(8), 920\u2013930.","journal-title":"IEEE Trans. on Comp."},{"unstructured":"Cotofana, S., & Vassiliadis, S. (1997). Low Weight and Fan-In Neural Networks for Basic Arithmetic Operations. In Proc. IMACS World Congress on Sci. Comput., Modelling and Appl. Maths. (vol. 4, pp. 227\u2013232).","key":"21_CR13"},{"issue":"9","key":"21_CR14","doi-asserted-by":"publisher","first-page":"1110","DOI":"10.1109\/12.2261","volume":"37","author":"R.W. Doran","year":"1988","unstructured":"Doran, R.W. (1988). Variants of an Improved Carry Look-Ahead Adder. IEEE Trans. on Comp., 37(9), 1110\u20131113.","journal-title":"IEEE Trans. on Comp."},{"unstructured":"Han, T., Carlson, D.A., & Levitan, S.P. (1987). VLSI Design of High-Speed, Low-Area Addition Circuitry. In Proc. Intl. Conf. on Circuit Design (pp. 418\u2013422). IEEE Press.","key":"21_CR15"},{"key":"21_CR16","doi-asserted-by":"crossref","DOI":"10.1525\/9780520329560","volume-title":"Threshold Logic","author":"S. Hu","year":"1965","unstructured":"Hu, S. (1965). Threshold Logic. Berkeley, Los Angeles: University of California Press."},{"key":"21_CR17","volume-title":"Computer Arithmetic: Principles, Architecture and Design.","author":"K. Hwang","year":"1979","unstructured":"Hwang, K. (1979). Computer Arithmetic: Principles, Architecture and Design. New York: John Wiley & Sons."},{"issue":"9","key":"21_CR18","doi-asserted-by":"publisher","first-page":"1181","DOI":"10.1109\/12.165399","volume":"41","author":"T.P. Kelliher","year":"1992","unstructured":"Kelliher, T.P., Owens, R.M., Irwin, M.J., & Hwang, T.-T. (1992). ELM A Fast Addition Algorithm Discovered by a Program. IEEE Trans. on Comp., 41(9), 1181\u20131184.","journal-title":"IEEE Trans. on Comp."},{"key":"21_CR19","first-page":"107","volume":"19","author":"V.M. Khrapchenko","year":"1967","unstructured":"Khrapchenko, V.M. (1967). Asymptotic Estimation of Addition Time of a Parallel Adder. Problemy Kibernetiki, 19, 107\u2013122 (in Russian); English translation (1970) in System Theory Research 19, 105\u2013122.","journal-title":"Problemy Kibernetiki"},{"issue":"8","key":"21_CR20","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1109\/TC.1973.5009159","volume":"22","author":"P.M. Kogge","year":"1973","unstructured":"Kogge, P.M., & Stone, H.S. (1973). A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations. IEEE Trans. on Comp., 22(8), 783\u2013791.","journal-title":"IEEE Trans. on Comp."},{"issue":"4","key":"21_CR21","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1145\/322217.322232","volume":"27","author":"R.E. Ladner","year":"1980","unstructured":"Ladner, R.E., & Fischer, M.J. (1980). Parallel Prefix Computations. J. ACM, 27(4), 831\u2013838.","journal-title":"J. ACM"},{"issue":"2&3","key":"21_CR22","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1147\/rd.252.0156","volume":"25","author":"H. Ling","year":"1981","unstructured":"Ling, H. (1981). High Speed Binary Adder. IBM J. Res. Develop., 25(2&3), 156\u2013166.","journal-title":"IBM J. Res. Develop."},{"issue":"8","key":"21_CR23","doi-asserted-by":"publisher","first-page":"931","DOI":"10.1109\/12.156535","volume":"41","author":"T. Lynch","year":"1992","unstructured":"Lynch, T., & Swartzlander, E.E., Jr. (1992). A Spanning Tree Carry Lookahead Adder. IEEE Trans. on Comp., 41(8), 931\u2013939.","journal-title":"IEEE Trans. on Comp."},{"doi-asserted-by":"crossref","unstructured":"Montoye, R.K. (1981). Area-Time Efficient Addition in Charge Based Technology. Proc. Intl. Design Automation Conf. (pp. 862\u2013872). IEEE Press.","key":"21_CR24","DOI":"10.1109\/DAC.1981.1585456"},{"doi-asserted-by":"crossref","unstructured":"Ngai, T.F., & Irwin, M.J. (1985). Regular Area-Efficient Carry-Lookahead Adders. Proc. Intl. Symp. on Comp. Arithmetic (pp. 9\u201315). ACM Press.","key":"21_CR25","DOI":"10.1109\/ARITH.1985.6158967"},{"doi-asserted-by":"crossref","unstructured":"Ong, S., & Atkins, D.E. (1983). A Comparison of ALU Structures for VLSI Technology. Proc. Intl. Symp. on Comp. Arithmetic (pp. 10\u201316). ACM Press.","key":"21_CR26","DOI":"10.1109\/ARITH.1983.6158093"},{"key":"21_CR27","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1836.001.0001","volume-title":"Circuit Complexity and Neural Networks","author":"I. Parberry","year":"1994","unstructured":"Parberry, I. (1994). Circuit Complexity and Neural Networks. Cambridge, MA: MIT Press."},{"issue":"12","key":"21_CR28","doi-asserted-by":"publisher","first-page":"1612","DOI":"10.1109\/12.214671","volume":"41","author":"N.T. Quach","year":"1992","unstructured":"Quach, N.T., & Flynn, M.J. (1992). High-Speed Addition in CMOS. IEEE Trans. on Comp., 41(12), 1612\u20131615.","journal-title":"IEEE Trans. on Comp."},{"issue":"4","key":"21_CR29","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1109\/TC.1984.1676445","volume":"33","author":"T. Rhyne","year":"1984","unstructured":"Rhyne, T. (1984). Limitations on Carry Lookahead Networks. IEEE Trans. on Comp., 33(4), 373\u2013374.","journal-title":"IEEE Trans. on Comp."},{"unstructured":"Siu, K.-Y., Roychowdhury, V., & Kailath, T. (1990). Computing with Almost Optimal Size Threshold Circuits. (Technical Report, Info. Sys. Lab., Stanford University).","key":"21_CR30"},{"issue":"10","key":"21_CR31","doi-asserted-by":"publisher","first-page":"1669","DOI":"10.1109\/5.58350","volume":"78","author":"K.-Y. Siu","year":"1990","unstructured":"Siu, K.-Y., & Bruck, J. (1990). Neural Computation of Arithmetic Functions. Proc. IEEE, 78(10), 1669\u20131675.","journal-title":"Proc. IEEE"},{"issue":"3","key":"21_CR32","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1137\/0404038","volume":"4","author":"K.-Y. Siu","year":"1991","unstructured":"Siu, K.-Y., & Bruck, J. (1991). On the Power of Threshold Circuits with Small Weights. SIAM J. Disc. Maths., 4(3), 423\u2013435.","journal-title":"SIAM J. Disc. Maths."},{"issue":"12","key":"21_CR33","doi-asserted-by":"publisher","first-page":"1402","DOI":"10.1109\/12.106225","volume":"40","author":"K.-Y. Siu","year":"1991","unstructured":"Siu, K.-Y., Roychowdhury, V.P., & Kailath, T. (1991). Depth-Size Tradeoffs for Neural Computations. IEEE Trans. on Comp., 40(12), 1402\u20131412.","journal-title":"IEEE Trans. on Comp."},{"unstructured":"Sugla, B. (1985). Parallel Computation with Limited Resources. PhD Dissertation, Dept. ECE. Univ. of Massachusetts, Amherst, MA.","key":"21_CR34"},{"issue":"9","key":"21_CR35","doi-asserted-by":"publisher","first-page":"1062","DOI":"10.1109\/12.537130","volume":"45","author":"S. Vassiliadis","year":"1996","unstructured":"Vassiliadis, S., Cotofana, S., & Berteles, K. (1996). 2-1 Addition and Related Arithmetic Operations with Threshold Logic. IEEE Trans. on Comp., 45(9), 1062\u20131068.","journal-title":"IEEE Trans. on Comp."},{"unstructured":"Waser, S., & Flynn, M.J. (1982). Introduction to Arithmetic of Digital Systems. Holt, Rinehart and Winston.","key":"21_CR36"},{"key":"21_CR37","volume-title":"The Complexity of Boolean Functions","author":"I. Wegener","year":"1987","unstructured":"Wegener, I. (1987). The Complexity of Boolean Functions. Chichester: Wiley-Teubner."},{"unstructured":"Wegener, I. (1996). Unbounded Fan-In Circuits. In L.L. Keener (ed.): Advances in the Theory of Computation and Computational Mathematics, 123\u2013153. Ablex.","key":"21_CR38"},{"key":"21_CR39","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0020-0190(93)90202-K","volume":"46","author":"I. Wegener","year":"1993","unstructured":"Wegener, I. (1993). Optimal Lower Bounds on the Depth of Polynomial Size Threshold Circuits for Some Arithmetic Functions. Information Proc.Lett., 46, 85\u201387.","journal-title":"Information Proc.Lett."},{"issue":"5","key":"21_CR40","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1109\/12.53579","volume":"39","author":"B.W.Y. Wei","year":"1990","unstructured":"Wei, B.W.Y., & Thompson, C.D. (1990). Area-Time Optimal Adder Design. IEEE Trans. on Comp., 39(5), 666\u2013675.","journal-title":"IEEE Trans. on Comp."}],"container-title":["Lecture Notes in Computer Science","Engineering Applications of Bio-Inspired Artificial Neural Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0100486","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,5]],"date-time":"2021-08-05T12:01:40Z","timestamp":1628164900000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0100486"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540660682","9783540487722"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/bfb0100486","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]}}}