{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T04:58:51Z","timestamp":1744261131303},"reference-count":16,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/arith.2003.1207680","type":"proceedings-article","created":{"date-parts":[[2004,3,22]],"date-time":"2004-03-22T09:34:28Z","timestamp":1079948068000},"page":"204-211","source":"Crossref","is-referenced-by-count":7,"title":["High-radix iterative algorithm for powering computation"],"prefix":"10.1109","author":[{"given":"J.-A.","family":"Pineiro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.D.","family":"Ercegovac","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.D.","family":"Bruguera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.1999.762835"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2002.1146704"},{"key":"ref12","first-page":"40","article-title":"Faithful Powering Computation using Table Look-up and Fused Accumulation Tree","author":"pi\u00f1eiro","year":"2001","journal-title":"Proc 15th IntI Symposium on Computer Arithmetic (ARITHI5)"},{"key":"ref13","first-page":"101","article-title":"High-Radix Logarithm with Selection by Rounding","author":"pi\u00f1eiro","year":"2002","journal-title":"Proc of IEEE ASAP Conference"},{"key":"ref14","article-title":"On-Line High-Radix Exponential with Selection by Rounding","author":"pi\u00f1eiro","year":"2003","journal-title":"IEEE conference ISCAS 2003"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/12.795125"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/12.736432"},{"article-title":"Division and Square Root: Digit Recurrence Algorithms and Implementations","year":"1994","author":"ercegovac","key":"ref4"},{"key":"ref3","article-title":"Fast Multiplication Without Carry Propagate Addition","author":"ercegovac","year":"1987","journal-title":"UCLA Comp Sci Dept tech rep"},{"article-title":"Computer Approximations","year":"1968","author":"hart","key":"ref6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/12.863031"},{"key":"ref8","first-page":"110","author":"kogbetlianz","year":"1957","journal-title":"Computation of eN for -? < n < +? Using an Electronic Computer IBM Journal Res and Develop"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2001.987763"},{"year":"1980","author":"cody","key":"ref2"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.1999.762846"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2646-6"}],"event":{"name":"16th IEEE Symposium on Computer Arithmetic","acronym":"ARITH-03","location":"Santiago de Compostela, Spain"},"container-title":["16th IEEE Symposium on Computer Arithmetic, 2003. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8582\/27181\/01207680.pdf?arnumber=1207680","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,13]],"date-time":"2017-03-13T13:52:18Z","timestamp":1489413138000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1207680\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/arith.2003.1207680","relation":{},"subject":[]}}