.png){kind=icon}
返回
(M, p, k)-Friendly Points: A Table-Based Method to Evaluate Trigonometric Function
.png){kind=icon}
OA
AI
DOI：10.1109/TCSII.2014.2331094.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Linear (order-1) function evaluation schemes, such as bipartite and multipartite tables, are usually effective for low-precision approximations. For high-output precision, the lookup table size is often too large for practical use. This brief investigates the so-called (M, p, k) scheme that reduces the range of an input argument to a very small interval so that trigonometric functions can be approximated with very small lookup tables and a few additions/subtractions. An optimized hardware architecture is presented and implemented in both a field-programmable gate array device and standard-cell-based technology. Experimental results show that the proposed scheme achieves more than a 50% reduction in total chip area compared with the best linear approach for a 24-bit evaluation.
Keyword:
Bipartite table
field-programmable gate array (FPGA)
trigonometric function evaluation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
4.9
论文数:
8.8K
被引数:
2.5W
机构
引用论文
Biomimetic-Based Design of Tandem Catalysts for Efficient Nitrate to Ammonia Conversion基于仿生的串联催化剂设计，用于高效将硝酸盐转化为氨
.png){kind=icon}
PREAI
分享收藏A Memory-Efficient Tables-and-Additions Method for Accurate Computation of Elementary Functions
PREAI
分享收藏Hardware implementation trade-offs of polynomial approximations and interpolations多项式逼近和插值的硬件实现权衡
OAAI
OAAI分享收藏
查看更多内容