Results 231 to 240 of about 71,036 (260)

Approximation of Matrices by Gabor Multipliers

IEEE Signal Processing Letters, 2004
We present a fast Fourier transform based algorithm which allows to obtain the best approximation of a given time-variant linear system by approximating its matrix (in the Hilbert-Schmidt sense) by a Gabor multiplier, using a given tight Gabor frame. We illustrate the approach by approximating the inverse of a slowly time variant filter. Π2004 IEEE.
Feichtinger, Hans Georg, Hampejs, Mario, Kracher, Guenther   +2 more
openaire   +1 more source

Improved High Speed Approximate Multiplier

2020 4th International Conference on Electronics, Materials Engineering & Nano-Technology (IEMENTech), 2020
Digital multiplication generally produces large complicated results due to its large inputs. As the applications of digital multipliers are inherently error tolerable, approximate multipliers are designed. The aim of using approximate multipliers is to reduce the size and complexity of the operation while still retaining its meaning. Compressors have a
T. Roshini, R.Sai Krishna, P.Kaushik Reddy, M. Vinodhini   +3 more
openaire   +1 more source

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

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, Hyuk Jae Lee, Seok-Bum Ko   +2 more
openaire   +1 more source

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, Jiahua Xu, Danye Wang, Fabrizio Lombardi   +3 more
openaire   +1 more source

Memristor-based approximate matrix multiplier

Analog Integrated Circuits and Signal Processing, 2017
The parallel structure of matrix multipliers makes them fascinating candidates to benefit from memristors' high density architecture. This paper first explains a memristor-based analog vector---matrix multiplier suitable for approximate computing.
Mohsen Nourazar, Vahid Rashtchi, Ali Azarpeyvand, Farshad Merrikh-Bayat   +3 more
openaire   +1 more source

Probabilistic Error Analysis of Approximate Recursive Multipliers

IEEE Transactions on Computers, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mazahir, Sana, Hasan, Osman, Hafiz, Rehan, Shafique, Muhammad   +3 more
openaire   +1 more source

Dual subgradient methods using approximate multipliers

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2015
We consider the subgradient method for the dual problem in convex optimisation with approximate multipliers, i.e., the subgradient used in the update of the dual variables is obtained using an approximation of the true Lagrange multipliers. This problem is interesting for optimisation problems where the exact Lagrange multipliers might not be readily ...
Victor Valls, Douglas J. Leith
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, Pathallapalli Hareesha, Thamballa Dheeraj, Sruthi Eate, Katikala Haveela Evangeline, Gundugonti Kishore Kumar   +5 more
openaire   +1 more source