{"title":"在线CORDIC算法","authors":"H. Lin, H. Sips","doi":"10.1109/ARITH.1989.72806","DOIUrl":null,"url":null,"abstract":"The CORDIC algorithms provide a fast way to calculate a number of basic arithmetic functions. A CORDIC calculation takes O(n) steps for a function, where n is the word length of the operands. The speed is limited by the carry propagation in the adders and the I/O throughput. Speed can be improved by introducing redundancy in the calculation circuitry and I/O throughput by doing I/O transfers while calculating. The latter is characteristic for the class of so-called online arithmetic. At the same time, the pin requirements are limited to a single digit per operand. The authors introduce a number of new algorithms that provide an online CORDIC implementation.<<ETX>>","PeriodicalId":305909,"journal":{"name":"Proceedings of 9th Symposium on Computer Arithmetic","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"62","resultStr":"{\"title\":\"On-line CORDIC algorithms\",\"authors\":\"H. Lin, H. Sips\",\"doi\":\"10.1109/ARITH.1989.72806\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The CORDIC algorithms provide a fast way to calculate a number of basic arithmetic functions. A CORDIC calculation takes O(n) steps for a function, where n is the word length of the operands. The speed is limited by the carry propagation in the adders and the I/O throughput. Speed can be improved by introducing redundancy in the calculation circuitry and I/O throughput by doing I/O transfers while calculating. The latter is characteristic for the class of so-called online arithmetic. At the same time, the pin requirements are limited to a single digit per operand. The authors introduce a number of new algorithms that provide an online CORDIC implementation.<<ETX>>\",\"PeriodicalId\":305909,\"journal\":{\"name\":\"Proceedings of 9th Symposium on Computer Arithmetic\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-09-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"62\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 9th Symposium on Computer Arithmetic\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ARITH.1989.72806\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 9th Symposium on Computer Arithmetic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ARITH.1989.72806","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The CORDIC algorithms provide a fast way to calculate a number of basic arithmetic functions. A CORDIC calculation takes O(n) steps for a function, where n is the word length of the operands. The speed is limited by the carry propagation in the adders and the I/O throughput. Speed can be improved by introducing redundancy in the calculation circuitry and I/O throughput by doing I/O transfers while calculating. The latter is characteristic for the class of so-called online arithmetic. At the same time, the pin requirements are limited to a single digit per operand. The authors introduce a number of new algorithms that provide an online CORDIC implementation.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
