Architectural-space exploration of approximate multipliers

@article{Rehman2016ArchitecturalspaceEO,
  title={Architectural-space exploration of approximate multipliers},
  author={Semeen Rehman and Walaa El-Harouni and Muhammad Akmal Shafique and Akash Kumar and J{\"o}rg Henkel},
  journal={2016 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)},
  year={2016},
  pages={1-8}
}
This paper presents an architectural-space exploration methodology for designing approximate multipliers. Unlike state-of-the-art, our methodology generates various design points by adapting three key parameters: (1) different types of elementary approximate multiply modules, (2) different types of elementary adder modules for summing the partial products, and (3) selection of bits for approximation in a wide-bit multiplier design. Generation and exploration of such a design space enables a… 

Tables from this paper

A Hybrid Synthesis Methodology for Approximate Circuits

This paper presents a hybrid synthesis methodology that applies a low-cost analytical method followed by parallel stochastic search-based optimization to address the DSE challenge through efficient pruning of the design space and skipping unnecessary expensive testing and/or verification steps.

DeMAS: An efficient design methodology for building approximate adders for FPGA-based systems

This paper presents a novel generic design methodology to synthesize and implement approximate adders for any FPGA-based system by considering the underlying resources and architectural differences, and designs eight different multi-bit adder architectures.

Comparative Study of Approximate Multipliers

Three decisions for design and evaluation of approximate multiplier circuits are identified: the type of approximate full adder used to construct the multiplier, the architecture of the multiplier and the placement of sub-modules of approximate and exact multipliers in the target multiplier module.

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

Area-Optimized Accurate and Approximate Softcore Signed Multiplier Architectures

This work proposes a novel implementation technique for designing resource-efficient and low-power accurate and approximate multipliers which are optimized for FPGA-based systems.

Design Methodology to Explore Hybrid Approximate Adders for Energy-Efficient Image and Video Processing Accelerators

This paper proposes a new design methodology to explore the state-of-the-art approximate adders for accelerator architectures conceived in the realm of multiplier-less multiple constant

Area-Optimized Low-Latency Approximate Multipliers for FPGA-based Hardware Accelerators

This paper presents a novel approximate multiplier architecture customized towards the FPGA-based fabrics, an efficient design methodology, and an open-source library that provides higher area, latency and energy gains along with better output accuracy than those offered by the state-of-the-art ASIC-based approximate multipliers.

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.

autoAx: An Automatic Design Space Exploration and Circuit Building Methodology utilizing Libraries of Approximate Components

A novel methodology for searching, selecting and combining the most suitable approximate circuits from a set of available libraries to generate an approximate accelerator for a given application is proposed.

An Automated Approximation Methodology for Arithmetic Circuits

An automated approximation methodology for arithmetic circuits that approximates the gate level standard cell library and uses these approximate standard cells to modify the netlist of the original circuit to speed-up the design process.
...

References

SHOWING 1-10 OF 31 REFERENCES

Invited: Cross-layer approximate computing: From logic to architectures

This paper provides a systematical understanding of how to generate and explore the design space of approximate components, which enables a wide-range of power/energy, performance, area and output quality tradeoffs, and a high degree of design flexibility to facilitate their design.

IMPACT: IMPrecise adders for low-power approximate computing

This paper proposes logic complexity reduction as an alternative approach to take advantage of the relaxation of numerical accuracy, and demonstrates this concept by proposing various imprecise or approximate Full Adder cells with reduced complexity at the transistor level, and utilizing them to design approximate multi-bit adders.

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.

Power- and area-efficient Approximate Wallace Tree Multiplier for error-resilient systems

A new power and area-efficient Approximate Wallace Tree Multiplier (AWTM) for error-tolerant applications is presented and a bit-width aware approximate multiplication algorithm for optimal design of the authors' multiplier is proposed.

On reconfiguration-oriented approximate adder design and its application

A reconfiguration-oriented design methodology for approximate circuits is presented, and a reconfigurable approximate adder design that degrades computation quality gracefully is proposed that enables better quality-effort tradeoff when compared to existing techniques.

Low-Power Digital Signal Processing Using Approximate Adders

This paper proposes logic complexity reduction at the transistor level as an alternative approach to take advantage of the relaxation of numerical accuracy, and demonstrates the utility of these approximate adders in two digital signal processing architectures with specific quality constraints.

Accuracy-configurable adder for approximate arithmetic designs

This paper proposes an accuracy-configurable approximate adder for which the accuracy of results is configurable during runtime, and can be used in accuracy- configurable applications, and improves the achievable tradeoff between performance/power and quality.

Architecture support for disciplined approximate programming

An ISA extension that provides approximate operations and storage is described that gives the hardware freedom to save energy at the cost of accuracy and Truffle, a microarchitecture design that efficiently supports the ISA extensions is proposed.

Trading Accuracy for Power with an Underdesigned Multiplier Architecture

A novel multiplier architecture with tunable error characteristics, that leverages a modified inaccurate 2x2 building block, that can achieve 2X - 8X better Signal-Noise-Ratio (SNR) for the same power savings when compared to recent voltage over-scaling based power-error tradeoff methods is proposed.

iACT: A Software-Hardware Framework for Understanding the Scope of Approximate Computing

An open source toolkit, called iACT (Intel’s Approximate Computing Toolkit) is discussed, which consists of a compiler, runtime and a simulated hardware test bed to analyze and study the scope of approximations in applications.