{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:51:24Z","timestamp":1725663084425},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540167662"},{"type":"electronic","value":"9783540387466"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1007\/3-540-16766-8_1","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:53:23Z","timestamp":1330196003000},"page":"1-11","source":"Crossref","is-referenced-by-count":1,"title":["Digital filtering in VLSI"],"prefix":"10.1007","author":[{"given":"G.","family":"Bilardi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F. P.","family":"Preparata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"issue":"3","key":"1_CR1","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1145\/322261.322269","volume":"28","author":"R. P. Brent","year":"1981","unstructured":"R. P. Brent and H.T. Kung, \"The chip complexity of binary arithmetic,\" Journal of the ACM, vol. 28, n. 3, pp. 521\u2013534; July 1981.","journal-title":"Journal of the ACM"},{"issue":"3","key":"1_CR2","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1109\/TC.1982.1675982","volume":"C-31","author":"R. P. Brent","year":"1982","unstructured":"R. P. Brent and H.T. Kung, \"A regular layout for parallel adders,\" IEEE Trans. Comput. vol. C-31, n. 3, pp. 260\u2013264; March 1982.","journal-title":"IEEE Trans. Comput."},{"issue":"7","key":"1_CR3","doi-asserted-by":"crossref","first-page":"684","DOI":"10.1109\/TC.1983.1676300","volume":"C-32","author":"G. M. Baudet","year":"1983","unstructured":"G. M. Baudet, F. P. Preparata and J.E. Vuillemin, \"Area-time optimal VLSI circuits for convolution,\" IEEE Trans. Comp., vol. C-32, no. 7, pp. 684\u2013688; July 1983.","journal-title":"IEEE Trans. Comp."},{"key":"1_CR4","first-page":"53","volume-title":"The influence of key length on the area-time complexity of sorting","author":"G. Bilardi","year":"1985","unstructured":"G. Bilardi and F. P. Preparata \"The influence of key length on the area-time complexity of sorting,\" Proc. I.C.A.L.P., Nafplion, Greece (Springer-Verlag) pp. 53\u201362; July 1985."},{"key":"1_CR5","unstructured":"G. Bilardi and M. Sarrafzadeh, \"Optimal discrete Fourier transform in VLSI,\" International Workshop on Parallel Computing and VLSI, Amalfi, Italy; May 1984."},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"F.E. Fitch, \"New bounds for parallel prefix circuits,\" Proc. 15th Annual ACM Symposium on Theory of Computing, Boston, MA pp. 100\u2013109; April 1983.","DOI":"10.1145\/800061.808738"},{"key":"1_CR7","volume-title":"Linear Systems","author":"T. Kailath","year":"1980","unstructured":"T. Kailath, Linear Systems, Prentice-Hall, Englewood Cliffs, NJ; 1980."},{"issue":"4","key":"1_CR8","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","volume":"27","author":"R. E. Ladner","year":"1980","unstructured":"R. E. Ladner and M. J. Fisher, \"Parallel prefix computation,\" Journal of the ACM, vol. 27, n. 4, pp. 831\u2013838; October 1980.","journal-title":"Journal of the ACM"},{"key":"1_CR9","volume-title":"Digital Signal Processing","author":"A.V. Oppenheim","year":"1975","unstructured":"A.V. Oppenheim and R.W. Schafer, Digital Signal Processing, Prentice-Hall, Englewood Cliffs, NJ; 1975."},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"F. P. Preparata and J. Vuillemin, \"Area-time optimal VLSI networks for ocmputing interger multiplication and discrete Fourier transform,\" Proc. of I.C.A.L.P., Haifa, Israel, pp. 29\u201340; July 1981.","DOI":"10.1007\/3-540-10843-2_3"},{"key":"1_CR11","unstructured":"C. D. Thompson, \"A complexity theory for VLSI,\" Ph.D. Thesis, Department of Computer Science, Carnegie-Mellon University; August 1980."},{"issue":"11","key":"1_CR12","doi-asserted-by":"crossref","first-page":"1047","DOI":"10.1109\/TC.1983.1676155","volume":"C-32","author":"C.D. Thompson","year":"1983","unstructured":"C.D. Thompson, \"Fourier transforms in VLSI,\" IEEE Trans. Comput., vol. C-32, n. 11, pp. 1047\u20131057; November 1983.","journal-title":"IEEE Trans. Comput."}],"container-title":["Lecture Notes in Computer Science","VLSI Algorithms and Architectures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-16766-8_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:11:04Z","timestamp":1605643864000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16766-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540167662","9783540387466"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-16766-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1986]]}}}