{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:51:32Z","timestamp":1725663092326},"publisher-location":"Berlin, Heidelberg","reference-count":24,"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_19","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:54:04Z","timestamp":1330196044000},"page":"217-225","source":"Crossref","is-referenced-by-count":1,"title":["AT2-optimal galois field multiplier for VLSI"],"prefix":"10.1007","author":[{"given":"Martin","family":"F\u00fcrer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kurt","family":"Mehlhorn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"issue":"1","key":"19_CR1","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1145\/358808.358814","volume":"23","author":"H. Abelson","year":"1980","unstructured":"Abelson, H. and Andreae, P. (1980), Information transfer and area-time tradeoffs for VLSI multiplication, Comm. ACM 23, No. 1, 20\u201322.","journal-title":"Comm. ACM"},{"key":"19_CR2","volume-title":"The Design and Analysis of Computer Algorithms","author":"A.V. Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E. and Ullman, J.D. (1974), \"The Design and Analysis of Computer Algorithms\", Addison-Wesley, Reading, Mass."},{"key":"19_CR3","unstructured":"Beame, P.W., Cook, S.A. and Hoover, H.J. (1984), Log Depth Circuits for Division and Related Problems, 25th FOCS, (IEEE Symp.), 1\u20136."},{"key":"19_CR4","volume-title":"Algebraic Coding Theory","author":"E.R. Berlekamp","year":"1968","unstructured":"Berlekamp, E.R. (1968), \"Algebraic Coding Theory\", McGraw-Hill, New York."},{"key":"19_CR5","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1145\/322261.322269","volume":"28","author":"R.P. Brent","year":"1981","unstructured":"Brent, R.P. and Kung, H.T. (1981), The chip complexity of binary arithmetic, J. Assoc. Comput. Mach. 28, 521\u2013534.","journal-title":"J. Assoc. Comput. Mach."},{"key":"19_CR6","unstructured":"F\u00fcrer, M. (1985), in preparation."},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Kannan, R., Miller, R. and Rudolph, L. (1984), Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers, 25th FOCS, 7\u201311.","DOI":"10.1109\/SFCS.1984.715895"},{"key":"19_CR8","first-page":"293","volume":"145","author":"A. Karazuba","year":"1962","unstructured":"Karazuba, A. and Ofman, Y. (1962), Multiplication of multidigit numbers on automata, Dokl. Akad. Nauk SSSR 145, 293\u2013294.","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"19_CR9","unstructured":"Knuth, D.E. (1981), \"The Art of Computer Programming\", Vol. 2: Semi-numerical Algoriths, Addison-Wesley, Reading, Mass., 2nd ed."},{"key":"19_CR10","volume-title":"The International Professorship in Computer Science: Algorithmics for VLSI","author":"T. Lengnauer","year":"1983","unstructured":"Lengnauer, T. and Mehlhorn, K. (1983), VLSI complexity theory, efficient VLSI algorithms and the HILL design system, in \"The International Professorship in Computer Science: Algorithmics for VLSI\" (Trullemans, Ed.), Academic Press, New York, in press."},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"van Lint, J.H. (1971), \"Coding Theory\", Springer LN in Math. 201, Berlin.","DOI":"10.1007\/978-3-662-20712-3"},{"key":"19_CR12","unstructured":"Luk, W.K. and Vuillemin, J.E. (1983), \"Recursive Implementation of Optimal Time VLSI Integer Multipliers\", VLSI 83, Trondheim, Norway September."},{"key":"19_CR13","volume-title":"The Theory of Error-Correcting Codes","author":"F.J. MacWilliams","year":"1978","unstructured":"MacWilliams, F.J. and Sloane, N.J.A. (1978), \"The Theory of Error-Correcting Codes\", North-Holland, Amsterdam."},{"key":"19_CR14","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0167-9260(84)90020-8","volume":"2","author":"K. Mehlhorn","year":"1984","unstructured":"Mehlhorn, K. (1984), AT2-optimal VLSI Integer Division and Integer Square Rooting, Integration 2, 163\u2013167.","journal-title":"Integration"},{"key":"19_CR15","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/S0019-9958(83)80061-8","volume":"58","author":"K. Mehlhorn","year":"1983","unstructured":"Mehlhorn, K. and Preparata, F.P. (1983), Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time, Information and Control 58, 137\u2013156.","journal-title":"Information and Control"},{"key":"19_CR16","unstructured":"Mehlhorn, K. and Preparata, F.P. (1985), Area-Time Optimal Division for T=\u03a9(log n)1+\u025b), TR 05\/1985, Sonderforschungsbericht, Univ. of Saarbr\u00fccken."},{"issue":"2","key":"19_CR17","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1109\/TC.1983.1676203","volume":"C-32","author":"F.P. Preparata","year":"1983","unstructured":"Preparata, F.P. (1983), An Area-Time Optimal Mesh-Connected Multiplier of Large Integers, IEEE. Trans. Comput. C-32, No. 2, 194\u2013198.","journal-title":"IEEE. Trans. Comput."},{"issue":"5","key":"19_CR18","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1145\/358645.358660","volume":"24","author":"F.P. Preparata","year":"1981","unstructured":"Preparata, F.P. and Vuillemin, J. (1981a), The Cube-Connected-Cycles: A Versatile Network for Parallel Computation, Comm. ACM 24, No. 5, 300\u2013309.","journal-title":"Comm. ACM"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Preparata, F.P. and Vuillemin, J. (1981b), Area-Time Optimal VLSI Networks for Computing Integer Multiplication and Discrete Fourier Transform, in \"Proceedings, I.C.A.L.P., Haifa, Israel\", 29\u201340.","DOI":"10.1007\/3-540-10843-2_3"},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Reif, J. (1983), Logarithmic Depth Circuits for Algebraic Functions, 24th FOCS, 138\u2013143.","DOI":"10.1109\/SFCS.1983.29"},{"key":"19_CR21","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/BF00289470","volume":"7","author":"A. Sch\u00f6nhage","year":"1976","unstructured":"Sch\u00f6nhage, A. (1976), Schnelle Multiplikation von Polynomen \u00fcber K\u00f6rpern der Charakteristik 2, Acta Informatica 7, 395\u2013398.","journal-title":"Acta Informatica"},{"key":"19_CR22","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF02242355","volume":"7","author":"A. Sch\u00f6nhage","year":"1971","unstructured":"Sch\u00f6nhage, A. and Strassen V., (1971), Schnelle Multiplikation grosser Zahlen, Computing 7, 281\u2013292.","journal-title":"Computing"},{"key":"19_CR23","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1109\/TC.1985.1676616","volume":"C-34","author":"C.C. Wang","year":"1985","unstructured":"Wang, C.C., Truong, T.K., Shao, H.M., Deutsch, L.J., Omura, J.K. and Reed, I.S. (1985), VLSI Architectures for Computing Multiplications and Inverses in GF(2m), IEEE Transaction on Computers, C-34, 709\u2013717.","journal-title":"IEEE Transaction on Computers"},{"key":"19_CR24","doi-asserted-by":"crossref","unstructured":"Yao, A.C. (1981), The Entropic Limitations on VLSI Computations, 13th STOC (ACM Symposium), 308\u2013311.","DOI":"10.1145\/800076.802483"}],"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_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:11:06Z","timestamp":1605643866000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16766-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540167662","9783540387466"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-16766-8_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1986]]}}}