{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T15:18:35Z","timestamp":1742397515650,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/arith.2003.1207668","type":"proceedings-article","created":{"date-parts":[[2004,3,22]],"date-time":"2004-03-22T09:34:28Z","timestamp":1079948068000},"page":"114-121","source":"Crossref","is-referenced-by-count":13,"title":["\"Partially rounded\" small-order approximations for accurate, hardware-oriented, table-based methods"],"prefix":"10.1109","author":[{"given":"J.-M.","family":"Muller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.1995.465381"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.1997.614893"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ASAP.1997.606821"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/12.795125"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008004523235"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1109\/TEC.1959.5222693","article-title":"The CORDIC computing technique","volume":"ec 8","author":"volder","year":"1990","journal-title":"IRE Transactions on Electronic Computers"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008110704586"},{"key":"ref17","article-title":"A unified algorithm for elementary functions","volume":"1","author":"walther","year":"1990","journal-title":"Joint Computer Conference Proceedings 1971"},{"article-title":"Computer Approximations","year":"1968","author":"hart","key":"ref4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.2001.930112"},{"article-title":"Elementary Functions, Algorithms and Implementation","year":"1997","author":"muller","key":"ref6"},{"key":"ref5","article-title":"High-performance architectures for elementary function generation","author":"wei","year":"2001","journal-title":"Proc of the 15th IEEE Symposium on Computer Arithmetic (Arith-15) IEEE Computer Society Press"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ARITH.2001.930102"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009984523264"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1976.1674566"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/12.863043"},{"key":"ref9","article-title":"Sur un proc&#x00E9;d&#x00E9; convergent d'approximations successives pour d&#x00E9;terminer les polyn&#x00F4;mes d'approximation","volume":"198","author":"remez","year":"1934"}],"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\/01207668.pdf?arnumber=1207668","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T00:25:56Z","timestamp":1497572756000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1207668\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/arith.2003.1207668","relation":{},"subject":[]}}