A Novel Data Format for Approximate Arithmetic Computing - 2017


Approximate computing has become one in all the foremost popular computing paradigms in the era of the Internet of things and big knowledge. It takes benefits of the error-tolerable feature of the many applications, like Machine Learning and image/Signal Processing, to reduce the resource needed to deliver bound level of computation quality. In this paper, we have a tendency to propose an approximate integer format (AIF) and its associated arithmetic operations for energy minimization with controllable computation accuracy. In AIF, operands are segmented at run time such that the computation is performed solely on half of operands by computing units (like adders and multipliers) of smaller bit-width. The proposed AIF can be used for any arithmetic operation and will be extended to fastened point numbers. It will conjointly be incorporated into higher level design like architectural and programming language to grant user the control of approximate computing. Experimental results show that our AIF based approximation computing approach will achieve high accuracy, incurs very little extra overhead, and save considerable energy.

Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here

PROJECT TITLE : Novel Secure Outsourcing of Modular Inversion for Arbitrary and Variable Modulus ABSTRACT: In the fields of cryptography and algorithmic number theory, modular inversion is regarded as one of the operations that
PROJECT TITLE : A Novel Blockchain Based Secured and QoS Aware IoT Vehicular Network in Edge Cloud Computing ABSTRACT: An IoT (Internet of Things)-based vehicular ad-hoc network and a software-defined network are the two components
PROJECT TITLE : Progressive Self-Supervised Clustering With Novel Category Discovery ABSTRACT: Clustering is one of the most classical methods used to analyze data structures in machine learning and pattern recognition at the
PROJECT TITLE : Large-Scale Affine Matrix Rank Minimization With a Novel Nonconvex Regularizer ABSTRACT: The goal of low-rank minimization is to recover a matrix with the lowest possible rank while still satisfying the constraints
PROJECT TITLE : A Novel Discriminative Dictionary Pair Learning Constrained by Ordinal Locality for Mixed Frequency Data Classification ABSTRACT: One of the challenges that classification must overcome is the fact that the data

Ready to Complete Your Academic MTech Project Work In Affordable Price ?

Project Enquiry