Results 31 to 40 of about 4,524 (286)
Approximate Recursive Multipliers Using Carry Truncation and Error Compensation
Approximate computing is a fast-emerging paradigm promising higher circuit performances in error tolerant applications. Binary multipliers are a common target for approximate computing due to their complexity and the multitude of their applications.
Zacharelos, Efstratios +4 more
core +2 more sources
Quasi delay insensitive implementation of approximate multiplication
Asynchronous quasi delay insensitive (QDI) implementation of approximate multiplication is described in this article. We consider the array multiplier architecture for a QDI implementation.
Padmanabhan Balasubramanian +1 more
doaj +1 more source
Comparative Study of Approximate Multipliers [PDF]
Approximate multipliers are widely being advocated for energy-efficient computing in applications that exhibit an inherent tolerance to inaccuracy. However, the inclusion of accuracy as a key design parameter, besides the performance, area and power, makes the identification of the most suitable approximate multiplier quite challenging.
Mahmoud Masadeh +2 more
openaire +2 more sources
A design methodology for approximate multipliers in convolutional neural networks: A case of MNIST [PDF]
In this paper, we present a case study on approximate multipliers for MNIST Convolutional Neural Network (CNN). We apply approximate multipliers with different bit-width to the convolution layer in MNIST CNN, evaluate the accuracy of MNIST classification,
Shirane, Kenta +5 more
core +1 more source
Designing energy efficient approximate multipliers for neural acceleration [PDF]
\u3cp\u3eMany error resilient applications can be approximated using multi-layer perceptrons (MLPs) with insignificant degradation in output quality. Faster and energy efficient execution of such an application is achieved using a neural accelerator (NA).
Corporaal, H Henk +8 more
core +2 more sources
Approximate θ-multipliers on Banach algebras [PDF]
We show that each approximate θ-multiplier T: A ⟶ A on without order Banach algebra A is an exact θ-multiplier, and for every approximate θ-multiplier T there corresponds a unique θ-multiplier near to T. Moreover, each mapping S: A ⟶ A which is near to θ-
Abbas Zivari-Kazempour
doaj
An Accuracy Reconfigurable Vector Accelerator based on Approximate Logarithmic Multipliers for Energy-Efficient Computing [PDF]
The approximate logarithmic multiplier proposed by Mitchell provides an efficient alternative for processing dense multiplication or multiply-accumulate operations in applications such as image processing and real-time robotics.
MASUDA, Yutaka +2 more
core +1 more source
On the Design of Logarithmic Multiplier Using Radix-4 Booth Encoding
This paper proposes an energy-efficient approximate multiplier which combines radix-4 Booth encoding and logarithmic product approximation. Additionally, a datapath pruning technique is proposed and studied to reduce the hardware complexity of the ...
Ratko Pilipovic, Patricio Bulic
doaj +1 more source
IoT uses wireless sensor networks (WSN) to deploy many sensors to track environmental and physical parameters. The WSN measurements are frequently contaminated and altered by noise.
Charles Rajesh Kumar J. +2 more
doaj +1 more source
Design and Analysis of Multiplier Using Approximate 15-4 Compressor
This paper presents the design of approximate 15-4 compressor using 5-3 compressors as basic module. Four different types of approximate 5-3 compressors are used in a 15-4 compressor for less power consumption and high pass rate.
R. Marimuthu +2 more
doaj +1 more source

