High-order Taylor series approximation for efficient computation of elementary functions

被引:10
|
作者
Chen, Chichyang [1 ]
机构
[1] Feng Chia Univ, Dept Comp Sci & Informat Engn, Taichung 40724, Taiwan
来源
IET COMPUTERS AND DIGITAL TECHNIQUES | 2015年 / 9卷 / 06期
关键词
polynomial approximation; error analysis; table lookup; high-order Taylor series approximation; elementary functions computation; piecewise polynomial method; error analysis method; POLYNOMIAL APPROXIMATIONS; SQUARE-ROOT;
D O I
10.1049/iet-cdt.2014.0158
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
A new piecewise polynomial method is proposed to compute elementary functions by using high-order Taylor approximation. The high-order power terms of the series are proposed to be approximated by using simple and fast table lookup. Furthermore, the similarity and regularity among the Taylor coefficients can make possible the sharing of the lookup tables. The authors have developed an error analysis method to estimate the maximum error of the proposed approximation approach, and formulated the procedure for determining the hardware parameters in the approximation unit. Finally, the authors have designed a single-precision approximation unit for computing six common elementary functions. The coefficient sharing approach can result in at least 30.5% reduction in the coefficient lookup tables. Compared with a previous work by Pineiro et al., the authors can save 27.91% of the lookup tables with some extra cost in computation hardware. Compared with the work by Alimohammad et al., 34.85% of the lookup tables can be saved with the same computation hardware cost. The authors conclude that the proposed approaches can effectively reduce the lookup tables required in the piecewise polynomial approximation for efficient elementary function computation.
引用
收藏
页码:328 / 335
页数:8
相关论文
共 50 条
  • [1] On the efficient computation of high-order derivatives for implicitly defined functions
    Wagner, Mathias
    Walther, Andrea
    Schaefer, Bernd-Jochen
    COMPUTER PHYSICS COMMUNICATIONS, 2010, 181 (04) : 756 - 764
  • [2] Validating an A priori enclosure using high-order Taylor series
    Corliss, GF
    Rihm, R
    SCIENTIFIC COMPUTING AND VALIDATED NUMERICS, 1996, 90 : 228 - 238
  • [3] High-Order Approximation of Set-Valued Functions
    Nira Dyn
    Elza Farkhi
    Alona Mokhov
    Constructive Approximation, 2023, 57 : 521 - 546
  • [4] High-Order Approximation of Set-Valued Functions
    Dyn, Nira
    Farkhi, Elza
    Mokhov, Alona
    CONSTRUCTIVE APPROXIMATION, 2023, 57 (02) : 521 - 546
  • [6] Efficient Evaluation of PGF Based on High-Order Taylor Expansions
    Zhu, Chunhui
    Yang, Zhangqi
    Liu, Lijun
    Ye, Longfang
    Liu, Qing Huo
    IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION, 2023, 71 (11) : 8799 - 8805
  • [7] Package queries: efficient and scalable computation of high-order constraints
    Brucato, Matteo
    Abouzied, Azza
    Meliou, Alexandra
    VLDB JOURNAL, 2018, 27 (05): : 693 - 718
  • [8] Package queries: efficient and scalable computation of high-order constraints
    Matteo Brucato
    Azza Abouzied
    Alexandra Meliou
    The VLDB Journal, 2018, 27 : 693 - 718
  • [9] High-Order Accuracy Computation of Coupling Functions for Strongly Coupled Oscillators
    Park, Youngmin
    Wilson, Dan D.
    SIAM JOURNAL ON APPLIED DYNAMICAL SYSTEMS, 2021, 20 (03): : 1464 - 1484
  • [10] A novel high-order associative memory system via discret Taylor series
    Xu, NS
    Bai, YF
    Zhang, L
    IEEE TRANSACTIONS ON NEURAL NETWORKS, 2003, 14 (04): : 734 - 747