Finite precision bit-width allocation using SAT-modulo theory

Authors:
Adam B. Kinsman;Nicola Nicolici
Affiliations:
McMaster University, Hamilton, ON, Canada;McMaster University, Hamilton, ON, Canada
Venue:
Proceedings of the Conference on Design, Automation and Test in Europe
Year:
2009

Citing 10
Cited 10

Numerical analysis: 4th ed

Numerical analysis: 4th ed
Convex Optimization

Convex Optimization
Fast, Accurate Static Analysis for Fixed-Point Finite-Precision Effects in DSP Designs

Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
Automated Floating-Point to Fixed-Point Conversion with the Fixify Environment

RSP '05 Proceedings of the 16th IEEE International Workshop on Rapid System Prototyping
HySAT: An efficient proof engine for bounded model checking of hybrid systems

Formal Methods in System Design
Systolic Architecture for Computational Fluid Dynamics on FPGAs

FCCM '07 Proceedings of the 15th Annual IEEE Symposium on Field-Programmable Custom Computing Machines
Accelerating Molecular Dynamics Simulations with Reconfigurable Computers

IEEE Transactions on Parallel and Distributed Systems
Accuracy-Guaranteed Bit-Width Optimization

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Low-Power Optimization by Smart Bit-Width Allocation in a SystemC-Based ASIC Design Environment

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Improved Interval-Based Characterization of Fixed-Point LTI Systems With Feedback Loops

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

Computational bit-width allocation for operations in vector calculus

ICCD'09 Proceedings of the 2009 IEEE international conference on Computer design
Bit-width allocation for hardware accelerators for scientific computing using SAT-modulo theory

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Robust design methods for hardware accelerators for iterative algorithms in scientific computing

Proceedings of the 47th Design Automation Conference
Optimization of imprecise circuits represented by Taylor series and real-valued polynomials

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Tradeoff between Approximation Accuracy and Complexity for Range Analysis using Affine Arithmetic

Journal of Signal Processing Systems
An efficient hybrid engine to perform range analysis and allocate integer bit-widths for arithmetic circuits

Proceedings of the 16th Asia and South Pacific Design Automation Conference
Trustworthy numerical computation in Scala

Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications
Optimising performance of quadrature methods with reduced precision

ARC'12 Proceedings of the 8th international conference on Reconfigurable Computing: architectures, tools and applications
A bit too precise? bounded verification of quantized digital filters

TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Efficient search for inputs causing high floating-point errors

Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper explores the use of SAT-Modulo Theory in determination of bit-widths for finite precision implementation of numerical calculations, specifically in the context of scientific computing where division frequently occurs. Employing SAT-Modulo Theory leads to more accurate bounds estimation than those provided by other analytical methods, in turn yielding smaller bit-widths.