{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:09:39Z","timestamp":1725484179031},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424994"},{"type":"electronic","value":"9783540446873"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44687-7_1","type":"book-chapter","created":{"date-parts":[[2007,5,27]],"date-time":"2007-05-27T00:46:00Z","timestamp":1180226760000},"page":"1-5","source":"Crossref","is-referenced-by-count":0,"title":["Technology Trends and Adaptive Computing"],"prefix":"10.1007","author":[{"given":"Michael J.","family":"Flynn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Albert A.","family":"Liddicoat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,17]]},"reference":[{"key":"1_CR1","unstructured":"The National Technology Roadmap for Semiconductors, tech report, Semiconductor Industry Association, San Jose, CA, 1997."},{"issue":"1","key":"1_CR2","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/0743-7315(90)90064-V","volume":"8","author":"P. Dubey","year":"1990","unstructured":"Dubey, P., and Flynn, M.: \u201cOptimal Pipelining, Parallel and Distributed Computing,\u201d Vol. 8, No. 1, January 1990, pp. 10\u201319.","journal-title":"Optimal Pipelining, Parallel and Distributed Computing"},{"key":"1_CR3","unstructured":"Hung, P., and Flynn, M.: \u201cOptimum ILP for Superscalar and VLIW Processors,\u201d tech report, Stanford University, EE Dept., CSL-TR-99-737, 1999"},{"key":"1_CR4","volume-title":"Circuit, Interconnections, and Packaging for VLSI","author":"H. Bakoglu","year":"1990","unstructured":"Bakoglu, H.: Circuit, Interconnections, and Packaging for VLSI, Addision-Wesley, Reading, Mass., 1990."},{"issue":"1","key":"1_CR5","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/216585.216588","volume":"13","author":"W. Wulf","year":"1995","unstructured":"Wulf W., and McKee S.: \u201cHitting the Memory Wall: Implications of the Obvious,\u201d ACM Computer Architecture News, Vol. 13, No. 1, March 1995, pp. 20\u201324.","journal-title":"ACM Computer Architecture News"},{"key":"1_CR6","unstructured":"Schwarz, E.: High Radix Algorithms for Higher-Order Arithmetic Operations, PhD thesis, Stanford University, January 1993."},{"issue":"1","key":"1_CR7","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1109\/T-C.1972.223430","volume":"C-21","author":"R. Stefanelli","year":"1972","unstructured":"Stefanelli, R.: \u201cA Suggestion for a High-Speed Parallel Binary Divider,\u201d IEEE Trans. on Computers, C-21(1):42:55, January 1972.","journal-title":"IEEE Trans. on Computers"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Mandelbaum, D.: \u201cA Method for Calculation of the Square Root Using Combinatorial Logic,\u201d Journal of VLSI Signal Processing, December 1993, pp. 233\u2013243.","DOI":"10.1007\/BF01608536"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Mandelbaum, D.: \u201cA Fast, Efficient, Parallel-Acting Method of Generating Functions Defined by Power Series,\u201d IEEE Trans. on Parallel and Distributed Systems, January 1996, pp. 33\u201345.","DOI":"10.1109\/71.481596"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Liddicoat, A., Flynn, M.: \u201cReciprocal Approximation Theory with Table Compensation,\u201d In SPIE\u2019s 45th Annual Conference, July 2000.","DOI":"10.1117\/12.406501"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Al-Twaijry, H.: Technology Scaling Effects on Multipliers, PhD thesis, Stanford University, November 1998.","DOI":"10.1109\/12.736430"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"DasSarma, D., and Matula, D.: \u201cFaithful Bipartite ROM Reciprocal Tables,\u201d In Proc. 12th IEEE Symp. Computer Arithmetic, July 1995, pp. 17\u201328.","DOI":"10.1109\/ARITH.1995.465381"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"DasSarma, D., and Matula, D.: \u201cFaithful Interpolation in Reciprocal Tables,\u201d In Proc. 13th IEEE Symp. Computer Arithmetic, July 1997, pp. 82\u201391.","DOI":"10.1109\/ARITH.1997.614882"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Takagi, N.: \u201cGenerating a Power of an Operand by a Table Look-Up and a Multiplication,\u201d In Proc. 13th IEEE Symp. Computer Arithmetic, July 1997, pp. 126\u2013131.","DOI":"10.1109\/ARITH.1997.614887"},{"issue":"11","key":"1_CR15","doi-asserted-by":"crossref","first-page":"1216","DOI":"10.1109\/12.736432","volume":"-47","author":"N. Takagi","year":"1998","unstructured":"Takagi, N.: \u201cPowering by a Table Look-Up and a Multiplication with Operand Modification,\u201d IEEE Trans. on Computers, C-47(11):1216\u20131222, November 1998.","journal-title":"IEEE Trans. on Computers, C"}],"container-title":["Lecture Notes in Computer Science","Field-Programmable Logic and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44687-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T11:05:11Z","timestamp":1556449511000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44687-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424994","9783540446873"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-44687-7_1","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}