Results 211 to 220 of about 3,564 (253)
Some of the next articles are maybe not open access.

Design of Approximate Logarithmic Multipliers

Proceedings of the Great Lakes Symposium on VLSI 2017, 2017
Lower power has been a main challenge for IC design. Approximate computing provides a new approach for low power design. Logarithmic multiplier (LM) is a kind of approximate multipliers in nature. In this paper, the design of both non-iterative and iterative approximate LMs (IALM) are studied to further reduce the power consumption and improve the ...
Weiqiang Liu 0001   +3 more
openaire   +1 more source

Design of an Approximate Multiplier with Time and Power Efficient Approximation Methods

Journal of Circuits, Systems and Computers, 2023
Approximate multipliers have gradually become a focus of research due to the emergence of fault-tolerant applications. This paper deals with the approximation methods for an approximation multiplier with truncation, probability transformation and a majority gate-based compressor chain.
Ruyi Liu   +5 more
openaire   +1 more source

A note on an approximate lagrange multiplier rule

Mathematical Programming, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Joydeep Dutta   +2 more
openaire   +1 more source

Design of An Approximate FFT Processor Based on Approximate Complex Multipliers

2021 IEEE Computer Society Annual Symposium on VLSI (ISVLSI), 2021
The Fast Fourier Transform (FFT) is an efficient algorithm to calculate the Discrete Fourier Transform (DFT), which is often employed in Digital Signal Processing (DSP) and communication. In FFT, complex multiplication and addition units in the butterfly module consume most of the hardware resources.
Jinhe Du   +4 more
openaire   +1 more source

Approximations to the Multiplier Method

SIAM Journal on Numerical Analysis, 1985
The author analyzes approximations to the multiplier method for solving optimization problems. In particular, the effect of replacing the constrained problem by the unconstrained optimization of a penalized Lagrangian over a subspace instead of a Hilbert space, is considered. Some applications to nonlinear optimal control are discussed.
openaire   +2 more sources

Power Efficient Approximate Booth Multiplier

2018 IEEE International Symposium on Circuits and Systems (ISCAS), 2018
Power consumption is an important constraint in multimedia and deep learning applications. Approximate computing offers efficient approach to reduce power consumption. In this paper, novel approximation is proposed for radix-4 booth multiplication.
Suganthi Venkatachalam   +2 more
openaire   +1 more source

Approximation of adjoint of a multiplier on banach algebras

Acta Mathematica Scientia, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ghaffari, A., Javadi, S., Khodaei, H.
openaire   +1 more source

Architectural-space exploration of approximate multipliers

Proceedings of the 35th International Conference on Computer-Aided Design, 2016
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 ...
Semeen Rehman   +4 more
openaire   +2 more sources

Multipliers Based on Approximate Compressors

Micro and Nanosystems, 2021
Background: Approximate computing is an emerging trend in recent year that trades off the requirement of exact computation for the improvement of speed and power performance. Objective: Researchers are trying to improve the speed and power performance proposing different algorithm. Method: This paper proposes approximate compressors used for the
openaire   +1 more source

Hybrid Karatsuba Approximate Multiplier Utilizing a 4x4 Approximate Multiplier

2023 OITS International Conference on Information Technology (OCIT), 2023
Parisa Sai Soniya   +5 more
openaire   +1 more source

Home - About - Disclaimer - Privacy