Results 201 to 210 of about 3,564 (253)
Chaotic dynamics analysis and digital hardware design of the Izhikevich neuron model. [PDF]
Andabili MN, Nazari S, Moosazadeh T.
europepmc +1 more source
Joint explainable and fair AI in healthcare. [PDF]
Shahbazian R +2 more
europepmc +1 more source
Analytical SA-HCISCF Nuclear Gradients from Spin-Adapted Heat-Bath Configuration Interaction. [PDF]
Ugandi M, Roemelt M.
europepmc +1 more source
Selection for folding stability predicts observed covariation between protein positions in the PDB
Saebi F, Minning J, Bastolla U.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Probabilistic Error Analysis of Approximate Recursive Multipliers
IEEE Transactions on Computers, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Muhammad Shafique +2 more
exaly +2 more sources
Carry Disregard Approximate Multipliers
IEEE Transactions on Circuits and Systems I: Regular Papers, 2023Nima Taherinejad +2 more
exaly +2 more sources
Comparative Review of Approximate Multipliers
2020 30th International Conference Radioelektronika (RADIOELEKTRONIKA), 2020In the digital signal processing (DSP) system, multiplier is a significant arithmetic module. It contributes mainly in the power consumption and speed, and efficient multipliers are the need of the hour. Approximate computing has added a unique dimension in the area of digital design by reducing area, power and delay.
Sushree Sila P. Goswami +3 more
openaire +1 more source
Configurable DSI partitioned approximate multiplier
Future Generation Computer Systems, 2021Abstract Approximate computing has been considered for error-tolerant applications that can tolerate some loss of accuracy. It improves metrics such as dynamic power, delay, and area. Multipliers are key elements in arithmetic logic units and used in many applications such as Digital Signal Processing (DSP).
Fahimeh Hajizadeh +4 more
openaire +1 more source
Approximation of Matrices by Gabor Multipliers
IEEE Signal Processing Letters, 2004We 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 +2 more
openaire +1 more source

