Results 1 to 10 of about 4,524 (286)
Approximate computing is commonly employed in applications where accuracy is not crucial and aims to enhance circuit performance when inaccurate results are not challenging. The multipliers are power-hungry, and their approximation has been the target of
Elham Esmaeili, Nabiollah Shiri
doaj +1 more source
Exploring Posit Multiplication: A Comprehensive Review of Booth and Logarithmic Mantissa Methods
The posit number system represents a significant advancement aimed at replacing the current IEEE floating-point standard in a seamless manner. With its notable dynamic range and gradually tapering precision, a smaller posit can closely match the ...
Thalla Narasimha Swetha +2 more
doaj +1 more source
Multiplication is a necessary arithmetic operation in signal processing and machine learning algorithms. This paper proposes a novel method called Approximate Multiplier with Configurable Accuracy Levels (AMCAL) to obtain energy and area savings.
Reza Zendegani, Saeed Safari
doaj +1 more source
Applications of the theory of generalized Fourier transforms to Tikhonov problems
We define and study multiplier operators associated with the Sturm-Liouville operator involving a nonnegative function satisfying certain conditions.
Fethi Soltani, Akram Nemri
doaj +1 more source
This paper presents a novel power efficient Hybrid floating point multiplier (HFPM) with approximate hybrid radix-4/radix-8 booth encoder. This approach efficiently increases the speed of operation and optimises hardware.
Pranose J. Edavoor +2 more
doaj +1 more source
Carbon Nanotube Field-Effect Transistors (CNTFETs) have emerged as a strong alternative to conventional CMOS technology due to their superior electrical properties, including high carrier mobility, ballistic transport, and scalability at nanoscale ...
Arun Kolukulapally +2 more
doaj +1 more source
AMPEREISH: Approximate Multipliers for Power Efficiency in FPGA Designs Using Internal-Self-Healing
Approximate Computing has emerged as a viable solution to resource constraints in computing for error-resilient applications by relaxing accuracy for significant gains in terms of power, performance, and area. Among existing approximation techniques, the
Y. Rasheed +6 more
doaj +1 more source
Approximate Full-Adders: A Comprehensive Analysis
Approximate computing is a technique that sacrifices the accuracy of the result for an advantage in terms of power, area, and speed. It is useful for error-tolerant applications such as image and video processing. Many approximate arithmetic circuits can
Ettore Napoli +3 more
doaj +1 more source
Strong Gaussian Approximations with Random Multipliers
One reason why standard formulations of the central limit theorems are not applicable in high-dimensional and non-stationary regimes is the lack of a suitable limit object. Instead, suitable distributional approximations can be used, where the approximating object is not constant, but a sequence as well. We extend Gaussian approximation results for the
openaire +2 more sources
Weak approximate identities and multipliers [PDF]
Johnson, David L., Lahr, Charles D.
openaire +1 more source

