BKM:一种新的复杂初等函数的硬件算法

Proceedings of IEEE 11th Symposium on Computer Arithmetic Pub Date : 1993-06-29 DOI:10.1109/ARITH.1993.378098

J. Bajard, Sylvanus Kla, J. Muller

{"title":"BKM:一种新的复杂初等函数的硬件算法","authors":"J. Bajard, Sylvanus Kla, J. Muller","doi":"10.1109/ARITH.1993.378098","DOIUrl":null,"url":null,"abstract":"An algorithm for computing complex logarithms and exponentials is proposed. The algorithm is based on shift-and-add elementary steps, and it generalizes the Cordic algorithm. It can compute the usual real elementary functions. This algorithm is more suitable for computations in a redundant number system than Cordic, since there is no scaling factor for computation of trigonometric functions.<<ETX>>","PeriodicalId":414758,"journal":{"name":"Proceedings of IEEE 11th Symposium on Computer Arithmetic","volume":"86 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"50","resultStr":"{\"title\":\"BKM: A new hardware algorithm for complex elementary functions\",\"authors\":\"J. Bajard, Sylvanus Kla, J. Muller\",\"doi\":\"10.1109/ARITH.1993.378098\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An algorithm for computing complex logarithms and exponentials is proposed. The algorithm is based on shift-and-add elementary steps, and it generalizes the Cordic algorithm. It can compute the usual real elementary functions. This algorithm is more suitable for computations in a redundant number system than Cordic, since there is no scaling factor for computation of trigonometric functions.<<ETX>>\",\"PeriodicalId\":414758,\"journal\":{\"name\":\"Proceedings of IEEE 11th Symposium on Computer Arithmetic\",\"volume\":\"86 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-06-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"50\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of IEEE 11th Symposium on Computer Arithmetic\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ARITH.1993.378098\",\"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 IEEE 11th Symposium on Computer Arithmetic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ARITH.1993.378098","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 50

摘要

提出了一种计算复对数和复指数的算法。该算法基于移加基本步骤，对Cordic算法进行了推广。它可以计算一般的实初等函数。该算法比Cordic算法更适合于冗余数系的计算，因为它没有三角函数计算的比例因子。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

BKM: A new hardware algorithm for complex elementary functions

An algorithm for computing complex logarithms and exponentials is proposed. The algorithm is based on shift-and-add elementary steps, and it generalizes the Cordic algorithm. It can compute the usual real elementary functions. This algorithm is more suitable for computations in a redundant number system than Cordic, since there is no scaling factor for computation of trigonometric functions.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of IEEE 11th Symposium on Computer Arithmetic

自引率

0.00%

发文量

期刊最新文献

Hardware starting approximation for the square root operation A modular multiplication algorithm with triangle additions Division with speculation of quotient digits Design of a fast validated dot product operation Exact rounding of certain elementary functions