On the Approximation of Accuracy-configurable Sequential Multipliers via Segmented Carry Chains

by   Jorge Echavarria, et al.

In this paper, we present a multiplier based on a sequence of approximated accumulations. According to a given splitting point of the carry chains, the technique herein introduced allows varying the quality of the accumulations and, consequently, the overall product. Our approximate multiplier trades-off accuracy for a reduced latency (with respect to an accurate sequential multiplier) and exploits the inherent area savings of sequential over combinatorial approaches. We implemented multiple versions with different bit-width and accuracy configurations, targeting an FPGA and a 45nm ASIC to estimate resources, power consumption, and latency. We also present two error analyses of the proposed design based on closed-form analysis and simulations.


page 1

page 2

page 3

page 4


Low-Latency Online Multiplier with Reduced Activities and Minimized Interconnect for Inner Product Arrays

Multiplication is indispensable and is one of the core operations in man...

Ternary and Quaternary CNTFET Full Adders are less efficient than the Binary Ones for Carry-Propagate Adders

In Carry Propagate Adders, carry propagation is the critical delay. The ...

High Performance and Optimal Configuration of Accurate Heterogeneous Block-Based Approximate Adder

Approximate computing is an emerging paradigm to improve power and perfo...

Approximate Ripple Carry and Carry Lookahead Adders - A Comparative Analysis

Approximate ripple carry adders (RCAs) and carry lookahead adders (CLAs)...

HEAM: High-Efficiency Approximate Multiplier Optimization for Deep Neural Networks

We propose an optimization method for the automatic design of approximat...

Reverse Engineering Word-Level Models from Look-Up Table Netlists

Reverse engineering of FPGA designs from bitstreams to RTL models aids i...

Please sign up or login with your details

Forgot password? Click here to reset