Fixed-point Accuracy Analysis of Datapaths with Mixed CORDIC and Polynomial Computations

被引:0
|
作者
Sarbishei, O. [1 ]
Radecka, K. [1 ]
机构
[1] McGill Univ, Dept Elect & Comp Engn, Montreal, PQ, Canada
关键词
ALGORITHM;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Fixed-point accuracy analysis of imprecise datapaths in terms of Maximum-Mismatch (MM) [1], or Mean-Square-Error (MSE) [14], w.r.t. a reference model is a challenging task. Typically, arithmetic circuits are represented with polynomials; however, for a variety of functions, including trigonometric, hyperbolic, logarithm, exponential, square root and division, Coordinate Rotation Digital Computer (CORDIC) units can result in more efficient implementations with better accuracy. This paper presents a novel approach to robustly analyze the fixed-point accuracy of an imprecise datapath, which may consist of a combination of polynomials and CORDIC units. The approach builds a global polynomial for the error of the whole datapath by converting the CORDIC units and their errors into the lowest possible order Taylor series. The previous work for almost accurate analysis of MM [1] and MSE [14, 15] in large datapaths can only handle polynomial computations.
引用
收藏
页码:789 / 794
页数:6
相关论文
共 50 条
  • [31] Verification of Fixed-Point Datapaths with Comparator Units Using Constrained Arithmetic Transform (CAT)
    Sarbishei, O.
    Radecka, K.
    2012 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS 2012), 2012, : 592 - 595
  • [32] An interval polynomial theory approach to fixed-point bifurcation analysis in biological models
    Rigatos, Gerasimos G.
    2014 11TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION (WCICA), 2014, : 558 - 563
  • [33] FIXED-POINTS OF POLYNOMIAL MAPS .2. FIXED-POINT PORTRAITS
    GOLDBERG, LR
    MILNOR, J
    ANNALES SCIENTIFIQUES DE L ECOLE NORMALE SUPERIEURE, 1993, 26 (01): : 51 - 98
  • [34] Quantum Polynomial-Time Fixed-Point Attack for RSA
    Yahui Wang
    Huanguo Zhang
    Houzhen Wang
    中国通信, 2018, 15 (02) : 25 - 32
  • [35] FIXED-POINT ACCURACY EVALUATION IN THE CONTEXT OF CONDITIONAL STRUCTURES
    Naud, Jean-Charles
    Meunier, Quentin
    Menard, Daniel
    Sentieys, Olivier
    19TH EUROPEAN SIGNAL PROCESSING CONFERENCE (EUSIPCO-2011), 2011, : 1934 - 1938
  • [36] Accuracy Constraint Determination in Fixed-Point System Design
    Menard, D.
    Serizel, R.
    Rocher, R.
    Sentieys, O.
    EURASIP JOURNAL ON EMBEDDED SYSTEMS, 2008, (01)
  • [37] Quantum Polynomial-Time Fixed-Point Attack for RSA
    Wang, Yahui
    Zhang, Huanguo
    Wang, Houzhen
    CHINA COMMUNICATIONS, 2018, 15 (02) : 25 - 32
  • [38] Accuracy evaluation of fixed-point based LMS algorithm
    Rocher, Romuald
    Menard, Daniel
    Sentieys, Olivier
    Scalart, Pascal
    DIGITAL SIGNAL PROCESSING, 2010, 20 (03) : 640 - 652
  • [39] Fixed-Point Definability and Polynomial Time on Graphs with Excluded Minors
    Grohe, Martin
    JOURNAL OF THE ACM, 2012, 59 (05)
  • [40] Fixed-Point Definability and Polynomial Time on Graphs with Excluded Minors
    Grohe, Martin
    25TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2010), 2010, : 179 - 188