{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:30:42Z","timestamp":1757626242774,"version":"3.44.0"},"reference-count":36,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,3,1]],"date-time":"1991-03-01T00:00:00Z","timestamp":667785600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1991,3,1]],"date-time":"1991-03-01T00:00:00Z","timestamp":667785600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Integration"],"published-print":{"date-parts":[[1991,3]]},"DOI":"10.1016\/0167-9260(91)90008-9","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T14:37:33Z","timestamp":1047652653000},"page":"85-100","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":34,"title":["A new addition scheme and fast scaling factor compensation methods for CORDIC algorithms"],"prefix":"10.1016","volume":"11","author":[{"given":"D.","family":"Timmermann","sequence":"first","affiliation":[]},{"given":"H.","family":"Hahn","sequence":"additional","affiliation":[]},{"given":"B.J.","family":"Hosticka","sequence":"additional","affiliation":[]},{"given":"B.","family":"Rix","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/0167-9260(91)90008-9_BIB1","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1109\/TEC.1959.5222693","article-title":"The CORDIC trigonometric computing technique","volume":"EC-8","author":"Volder","year":"1959","journal-title":"IRE Trans. Electron. Comput."},{"key":"10.1016\/0167-9260(91)90008-9_BIB2","series-title":"Spring Joint Computer Conference (SJCC)","first-page":"379","article-title":"A unified algorithm for elementary functions","author":"Walther","year":"1971"},{"key":"10.1016\/0167-9260(91)90008-9_BIB3","first-page":"464","article-title":"Parallel addition in digital computers; a new fast carry circuit","volume":"106 B","author":"Kilburn","year":"1959"},{"issue":"3","key":"10.1016\/0167-9260(91)90008-9_BIB4","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1147\/rd.252.0156","article-title":"High-speed binary adder","volume":"25","author":"Ling","year":"1981","journal-title":"IBM J. Res. Develop."},{"issue":"10","key":"10.1016\/0167-9260(91)90008-9_BIB5","doi-asserted-by":"crossref","first-page":"1144","DOI":"10.1109\/TC.1987.1676855","article-title":"A way to build efficient carry-skip adders","volume":"C-36","author":"Guyot","year":"1987","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-9260(91)90008-9_BIB6","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1109\/IRETELC.1962.5407919","article-title":"Carry-select adder","volume":"EC-11","author":"Bedrij","year":"1962","journal-title":"IRE Trans. Electron. Comput."},{"issue":"9","key":"10.1016\/0167-9260(91)90008-9_BIB7","doi-asserted-by":"crossref","first-page":"866","DOI":"10.1109\/TC.1985.1676646","article-title":"Fast constant division routines","volume":"C-34","author":"Li","year":"1985","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"10.1016\/0167-9260(91)90008-9_BIB8","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1109\/TEC.1960.5219822","article-title":"Conditional-sum addition logic","volume":"EC-9","author":"Sklansky","year":"1960","journal-title":"IRE Trans. Electron. Comput."},{"issue":"2","key":"10.1016\/0167-9260(91)90008-9_BIB9","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1145\/321264.321279","article-title":"On the time required to perform addition","volume":"12","author":"Winograd","year":"1965","journal-title":"J. ACM"},{"key":"10.1016\/0167-9260(91)90008-9_BIB10","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1109\/TEC.1960.5219886","article-title":"Fast high-accuracy binary parallel addition","volume":"EC-9","author":"Hendrickson","year":"1960","journal-title":"IRE Trans. Electron. Comput."},{"key":"10.1016\/0167-9260(91)90008-9_BIB11","first-page":"241","article-title":"A single chip public key encryption sub-system","author":"Ivey","year":"1988","journal-title":"Digest of Technical Papers ESSCIRC"},{"key":"10.1016\/0167-9260(91)90008-9_BIB12","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1109\/TEC.1961.5219227","article-title":"Signed-digit number representations for fast parallel arithmetic","volume":"EC-10","author":"Avizienis","year":"1961","journal-title":"IRE Trans. Electron. Comput."},{"key":"10.1016\/0167-9260(91)90008-9_BIB13","series-title":"Proc. ICASSP","first-page":"1702","article-title":"DSP system architecture using signed-digit number representation","author":"Ramamoorthy","year":"1988"},{"key":"10.1016\/0167-9260(91)90008-9_BIB14_1","first-page":"152","article-title":"A 33 MFLOPS floating point processor using redundant binary representation","author":"Edamatsu","year":"1988","journal-title":"Digest of Technical Papers ISSCC 88"},{"key":"10.1016\/0167-9260(91)90008-9_BIB14_2","first-page":"342","article-title":"A 33 MFLOPS floating point processor using redundant binary representation","author":"Edamatsu","year":"1988","journal-title":"Digest of Technical Papers ISSCC 88"},{"key":"10.1016\/0167-9260(91)90008-9_BIB15","series-title":"Proc. ICASSP 1989","first-page":"2385","article-title":"A VLSI array CORDIC architecture","author":"Ahmed","year":"1989"},{"key":"10.1016\/0167-9260(91)90008-9_BIB16","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1109\/T-C.1973.223680","article-title":"An augmented iterative array for high-speed binary division","volume":"C-22","author":"Cappa","year":"1973","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"10.1016\/0167-9260(91)90008-9_BIB17","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1109\/4.266","article-title":"An elastic pipeline mechanism by self-timed circuits","volume":"23","author":"Komori","year":"1988","journal-title":"IEEE J. Solid-State Cir."},{"key":"10.1016\/0167-9260(91)90008-9_BIB18","series-title":"1988 Symposium on VLSI Circuits","article-title":"VLSI implementation of the variable length pipeline scheme for data-driven processors","author":"Yamasaki","year":"1988"},{"issue":"10","key":"10.1016\/0167-9260(91)90008-9_BIB19","doi-asserted-by":"crossref","first-page":"993","DOI":"10.1109\/T-C.1974.223800","article-title":"Fourier transform computers using CORDIC iterations","volume":"C-23","author":"Despain","year":"1974","journal-title":"IEEE Trans. Comput."},{"article-title":"Signal Processing Algorithms and Architectures","year":"1982","author":"Ahmed","key":"10.1016\/0167-9260(91)90008-9_BIB20"},{"key":"10.1016\/0167-9260(91)90008-9_BIB21","series-title":"Proc. ICASSP'90","first-page":"1783","article-title":"Architecture and performance of a new arithmetic unit for the computation of elementary functions","author":"Meyer","year":"1990"},{"issue":"2","key":"10.1016\/0167-9260(91)90008-9_BIB22","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/TC.1980.1675529","article-title":"A CORDIC arithmetic processor chip","volume":"C-29","author":"Haviland","year":"1980","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-9260(91)90008-9_BIB23","unstructured":"B\u00f6hme, J.F., private communication, Jan. 1989"},{"article-title":"CORDIC Algorithmen, Architekturen und monolithische Realisierungen mit Anwendungen in der Bildverarbeitung","year":"1990","author":"Timmermann","key":"10.1016\/0167-9260(91)90008-9_BIB24"},{"key":"10.1016\/0167-9260(91)90008-9_BIB25","first-page":"232","article-title":"Binary arithmetic","volume":"Vol. I","author":"Reitwiesner","year":"1960"},{"key":"10.1016\/0167-9260(91)90008-9_BIB26","series-title":"Proc. ICASSP 1984","first-page":"41 A.6.1","article-title":"Pipelined CORDIC architectures for fast VLSI filtering and array processing","author":"Deprettere","year":"1984"},{"key":"10.1016\/0167-9260(91)90008-9_BIB27","series-title":"Proc. EUSIPCO'86","first-page":"1219","article-title":"Parameter optimization of the CORDIC-algorithm and implementation in a CMOS-chip","author":"Schmidt","year":"1986"},{"key":"10.1016\/0167-9260(91)90008-9_BIB28","series-title":"Proc. EUSIPCO'88","first-page":"1557","article-title":"Design of 16-bit fixed-point recursive CORDIC processors and evaluation tools","author":"Schmidt","year":"1988"},{"issue":"15","key":"10.1016\/0167-9260(91)90008-9_BIB29","doi-asserted-by":"crossref","first-page":"950","DOI":"10.1049\/el:19890636","article-title":"A modified CORDIC algorithm with reduced iterations","volume":"25","author":"Timmermann","year":"1989","journal-title":"Electron. Lett."},{"key":"10.1016\/0167-9260(91)90008-9_BIB30","unstructured":"Timmermann, D., H. Hahn, B. Hosticka, A programmable CORDIC chip for digital signal processingt applications, submitted for publication"},{"year":"1987","series-title":"Studies on hardware algorithms for arithmetic operations with a redundant binary representation","author":"Takagi","key":"10.1016\/0167-9260(91)90008-9_BIB31"},{"key":"10.1016\/0167-9260(91)90008-9_BIB32","series-title":"Proc. ISCAS'90","first-page":"982","article-title":"Carry-save arithmetic for high-speed digital signal processing","author":"Noll","year":"1990"},{"issue":"10","key":"10.1016\/0167-9260(91)90008-9_BIB33","doi-asserted-by":"crossref","first-page":"925","DOI":"10.1109\/TC.1968.226439","article-title":"Higher-radix division using estimates of the divisor and partial remainders","volume":"C-17","author":"Atkins","year":"1968","journal-title":"IEEE Trans. Comput."},{"issue":"6","key":"10.1016\/0167-9260(91)90008-9_BIB34","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1109\/12.53594","article-title":"Redundant and on-line CORDIC: Application to matrix triangularization and SVD","volume":"39","author":"Ercegovac","year":"1990","journal-title":"IEEE Trans. Comput."},{"year":"1979","series-title":"Computer Arithmetic: Principles, Architecture, and Design","author":"Hwang","key":"10.1016\/0167-9260(91)90008-9_BIB35"}],"container-title":["Integration"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167926091900089?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167926091900089?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T21:37:52Z","timestamp":1757453872000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167926091900089"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,3]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,3]]}},"alternative-id":["0167926091900089"],"URL":"https:\/\/doi.org\/10.1016\/0167-9260(91)90008-9","relation":{},"ISSN":["0167-9260"],"issn-type":[{"type":"print","value":"0167-9260"}],"subject":[],"published":{"date-parts":[[1991,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A new addition scheme and fast scaling factor compensation methods for CORDIC algorithms","name":"articletitle","label":"Article Title"},{"value":"Integration","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0167-9260(91)90008-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1991 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}