Polynomial datapath optimization using constraint solving and formal modelling

Authors:
Finn Haedicke;Bijan Alizadeh;Görschwin Fey;Masahiro Fujita;Rolf Drechsler
Affiliations:
University of Bremen, Bremen, Germany;University of Tokyo and CREST, Tokyo, Japan;University of Bremen, Bremen, Germany;University of Tokyo and CREST, Tokyo, Japan;University of Bremen, Bremen, Germany
Venue:
Proceedings of the International Conference on Computer-Aided Design
Year:
2010

Citing 12
Cited 1

Code Generation for Expressions with Common Subexpressions

Journal of the ACM (JACM)
Generation of optimal code for expressions via factorization

Communications of the ACM
Factoring and eliminating common subexpressions in polynomial expressions

Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design
Optimization of polynomial datapaths using finite ring algebra

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Finding linear building-blocks for RTL synthesis of polynomial datapaths with fixed-size bit-vectors

Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
Approximate factorization of multivariate polynomials using singular value decomposition

Journal of Symbolic Computation
Boolector: An Efficient SMT Solver for Bit-Vectors and Arrays

TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
Polynomial datapath optimization using partitioning and compensation heuristics

Proceedings of the 46th Annual Design Automation Conference
Improved heuristics for finite word-length polynomial datapath optimization

Proceedings of the 2009 International Conference on Computer-Aided Design
Algebraic techniques to enhance common sub-expression elimination for polynomial system synthesis

Proceedings of the Conference on Design, Automation and Test in Europe
Application of symbolic computer algebra in high-level data-flow synthesis

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Optimizing Polynomial Expressions by Algebraic Factorization and Common Subexpression Elimination

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Formal equivalence verification and debugging techniques with auto-correction mechanism for RTL designs

Microprocessors & Microsystems

Quantified Score

Hi-index	0.00

Visualization

Abstract

For a variety of signal processing applications polynomials are implemented in circuits. Recent work on polynomial datapath optimization achieved significant reductions of hardware cost as well as delay compared to previous approaches like Horner form or Common Sub-expression Elimination (CSE). This work 1) proposes a formal model for single- and multi-polynomial factorization and 2) handles optimization as a constraint solving problem using an explicit cost function. By this, optimal datapath implementations with respect to the cost function are determined. Compared to recent state-of-the-art heuristics an average reduction of area and critical path delay is achieved.