Loading...

Polynomial datapath optimization using partitioning and compensation heuristics

Sarbishei, O ; Sharif University of Technology | 2009

475 Viewed
  1. Type of Document: Article
  2. DOI: 10.1145/1629911.1630151
  3. Publisher: 2009
  4. Abstract:
  5. Datapath designs that perform polynomial computations over Z 2n are used in many applications such as computer graphics and digital signal processing domains. As the market of such applications continues to grow, improvements in high-level synthesis and optimization techniques for multivariate polynomials have become really challenging. This paper presents an efficient algorithm for optimizing the implementation of a multivariate polynomial over Z2n in terms of the number of multipliers and adders. This approach makes use of promising heuristics to extract more complex common sub-expressions from the polynomial compared to the conventional methods. The proposed algorithm also utilizes a canonical decision diagram, Horner-Expansion Diagram (HED) [1] to reduce the polynomial's degree over Z2n. Experimental results have shown an average saving of 27% and 10% in terms of the number of logic gates and critical path delay respectively compared to existing high-level synthesis tools as well as state of the art algebraic approaches. Copyright 2009 ACM
  6. Keywords:
  7. Polynomial datapath ; Algebraic approaches ; Conventional methods ; Critical path delays ; Data path design ; Data paths ; Decision diagram ; Efficient algorithm ; High-level synthesis ; Modular HED ; Multivariate polynomial ; Optimization techniques ; State of the art ; Sub-expressions ; Algorithms ; Computer aided design ; Computer graphics ; Digital integrated circuits ; Heuristic methods ; Multivariable systems ; Optimization ; Signal processing ; Polynomials
  8. Source: Proceedings - Design Automation Conference, 26 July 2009 through 31 July 2009, San Francisco, CA ; 2009 , Pages 931-936 ; 0738100X (ISSN); 9781605584973 (ISBN)
  9. URL: https://ieeexplore.ieee.org/document/5227155