{"title":"管网上用切比雪夫多项式求初等函数","authors":"K. Hwang, H. C. Wang, Z. Xu","doi":"10.1109/ARITH.1987.6158702","DOIUrl":null,"url":null,"abstract":"Fast evaluation of vector-valued elementary functions plays a vital role in many real-time applications. In this paper, we present a pipeline networking approach to designing a Chebyshev polynomial evaluator for the fast evaluation of elementary functions over a string of arguments. In particular, pipeline nets are employed to perform the preprocessing and postprocessing of various elementary functions to boost the overall system performance. Design tradeoffs are analyzed among representational accuracy, processing speed and hardware complexity.","PeriodicalId":424620,"journal":{"name":"1987 IEEE 8th Symposium on Computer Arithmetic (ARITH)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1987-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Evaluating elementary functions with Chebyshev polynomials on pipeline nets\",\"authors\":\"K. Hwang, H. C. Wang, Z. Xu\",\"doi\":\"10.1109/ARITH.1987.6158702\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Fast evaluation of vector-valued elementary functions plays a vital role in many real-time applications. In this paper, we present a pipeline networking approach to designing a Chebyshev polynomial evaluator for the fast evaluation of elementary functions over a string of arguments. In particular, pipeline nets are employed to perform the preprocessing and postprocessing of various elementary functions to boost the overall system performance. Design tradeoffs are analyzed among representational accuracy, processing speed and hardware complexity.\",\"PeriodicalId\":424620,\"journal\":{\"name\":\"1987 IEEE 8th Symposium on Computer Arithmetic (ARITH)\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1987-05-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1987 IEEE 8th Symposium on Computer Arithmetic (ARITH)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ARITH.1987.6158702\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1987 IEEE 8th Symposium on Computer Arithmetic (ARITH)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ARITH.1987.6158702","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Evaluating elementary functions with Chebyshev polynomials on pipeline nets
Fast evaluation of vector-valued elementary functions plays a vital role in many real-time applications. In this paper, we present a pipeline networking approach to designing a Chebyshev polynomial evaluator for the fast evaluation of elementary functions over a string of arguments. In particular, pipeline nets are employed to perform the preprocessing and postprocessing of various elementary functions to boost the overall system performance. Design tradeoffs are analyzed among representational accuracy, processing speed and hardware complexity.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
