• Corpus ID: 234470106

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

  title={On the Approximation of Accuracy-configurable Sequential Multipliers via Segmented Carry Chains},
  author={Jorge Echavarria and Stefan Wildermann and Oliver Keszocze and Faramarz Khosravi and Andreas Becher and J{\"u}rgen Teich},
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… 

Figures and Tables from this paper



FAU: Fast and error-optimized approximate adder units on LUT-Based FPGAs

A novel stochastic error calculus that is able to take into account also non-uniform input distributions is presented and a detailed comparison of approximate adder structures proposed in literature with the novel LUT-Based approximate arithmetic structure is presented.

A low latency generic accuracy configurable adder

A low-latency generic accuracy configurable adder to support variable approximation modes that provides a higher number of potential configurations compared to state-of-the-art, thus enabling a high degree of design flexibility and trade-off between performance and output quality.

LeAp: Leading-one Detection-based Softcore Approximate Multipliers with Tunable Accuracy

Experimental results obtained from Vivado, Artificial Neural Network (ANN) and image processing applications indicate superiority of proposed multiplier over accurate and state-of-the-art approximate counterparts, and in particular, LeAp outperforms the 32x32 accurate multiplier.

Small-Area and Low-Power FPGA-Based Multipliers using Approximate Elementary Modules

  • Yi GuoHeming SunS. Kimura
  • Computer Science, Mathematics
    2020 25th Asia and South Pacific Design Automation Conference (ASP-DAC)
  • 2020
This paper presents a novel methodology for designing approximate multipliers by employing the FPGA-based fabrics and has a better accuracy-hardware tradeoff than other designs with com-parable accuracy.

FPGA-Based Multi-Level Approximate Multipliers for High-Performance Error-Resilient Applications

This paper presents approximate multipliers which are efficiently deployed on Field Programmable Gate Arrays (FPGAs) by using newly proposed approximate logic compressors at different levels of accuracy and are expected to be appropriate with high-performance and low-power error-resilient applications.

Design and Analysis of Majority Logic-Based Approximate Adders and Multipliers

As a new paradigm for nanoscale technologies, approximate computing deals with error tolerance in the computational process to improve performance and reduce power consumption. Majority logic (ML) is

Efficient Arithmetic Error Rate Calculus for Visibility Reduced Approximate Adders

A novel methodology to calculate the arithmetic error rate (AER) for deterministic approximate adder architectures, where the calculation of each output bit is restricted to a subset of the input bits, denoted as visibilities.

Design and Evaluation of Approximate Logarithmic Multipliers for Low Power Error-Tolerant Applications

The designs of both non-iterative and iterative approximate logarithmic multipliers (ALMs) are studied to further reduce power consumption and improve performance and it is found that the proposed approximate LMs with an appropriate number of inexact bits achieve higher accuracy and lower power consumption than conventional LMs using exact units.

Design and Analysis of Approximate Redundant Binary Multipliers

The proposed approximate RB multiplier designs are compared with previous approximate Booth multipliers; the results show that the approximate RB multipliers are better than approximate NB Boothmultipliers especially when the word size is large.

The complexity of error metrics