PROJECT TITLE :

Approximate Quaternary Addition with the Fast Carry Chains of FPGAs - 2018

ABSTRACT:

A heuristic is presented to efficiently synthesize approximate adder trees on Altera and Xilinx FPGAs using their carry chains. The mapper constructs approximate adder trees using an approximate quaternary adder as the fundamental building block. The approximate adder trees are smaller than exact adder trees, allowing a lot of operators to suit into a fixed-area device, trading off arithmetic accuracy for higher throughput.


Did you like this research project?

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


PROJECT TITLE : High-Performance Accurate and Approximate Multipliers for FPGA-based Hardware Accelerators ABSTRACT: In a wide variety of applications, including image and video processing and machine learning, multiplication
PROJECT TITLE : Local Kernels That Approximate Bayesian Regularization and Proximal Operators ABSTRACT: Kernel-based filtering, such as the bilateral filter and non-local means (as well as many others), is linked to broader variational
PROJECT TITLE :Low-power Implementation of Mitchell's Approximate Logarithmic Multiplication for Convolutional Neural Networks - 2018ABSTRACT:This paper proposes an occasional-power implementation of the approximate logarithmic
PROJECT TITLE :Low-Power Approximate Multipliers Using Encoded Partial Products and Approximate Compressors - 2018ABSTRACT:Approximate computing has been thought of to boost the accuracy-performance tradeoff in error-tolerant
PROJECT TITLE :Systematic Design of an Approximate Adder: The Optimized Lower Part Constant-OR Adder - 2018ABSTRACT:Exploiting the tradeoff between accuracy and hardware cost incorporates a tremendous potential to boost the efficiency

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

Project Enquiry