Results 21 to 30 of about 3,233,520 (305)
Efficient programmable power‐of‐two scaler for the three‐moduli set {2
ETRI Journal, 2020 Scaling is an important operation because of the iterative nature of arithmetic processes in digital signal processors (DSPs). In residue number system (RNS)–based DSPs, scaling represents a performance bottleneck based on the complexity of inter‐modulo ...
MohammadReza Taheri +2 more
doaj +1 more source
From static ternary adders to high-performance race-free dynamic ones
The Journal of Engineering, 2015 This study explores the suitability of dynamic logic style in ternary logic. It presents high-performance dynamic ternary half and full adders, which are essential components in computer arithmetic.
Shirin Rezaie +4 more
doaj +1 more source
Some Remarks about Entropy of Digital Filtered Signals
Entropy, 2020 The finite numerical resolution of digital number representation has an impact on the properties of filters. Much effort has been done to develop efficient digital filters investigating the effects in the frequency response.
Vinícius S. Borges +3 more
doaj +1 more source
Моделирование и анализ информационных систем, 2018 The project “Platform-independent approach to formal specification and verification of standard mathematical functions” is aimed onto the development of incremental combined approach to specification and verification of standard Mathematical functions ...
Nikolay V. Shilov +4 more
doaj +1 more source
Incremental column-wise verification of arithmetic circuits using computer algebra
Formal methods in system design, 2019 Verifying arithmetic circuits and most prominently multiplier circuits is an important problem which in practice still requires substantial manual effort. The currently most effective approach uses polynomial reasoning over pseudo boolean polynomials. In
Daniela Kaufmann +2 more
semanticscholar +1 more source
About finding of prime numbers that follow after given prime number without using computer
Дифференциальная геометрия многообразий фигур, 2020 It is shown how to define one or several prime numbers following after given prime number without using computer only by calculating several arithmetic progressions. Five examples of finding such prime numbers are given.
V.S. Malakhovsky
doaj +1 more source
Issues with rounding in the GCC implementation of the ISO 18037:2008 standard fixed-point arithmetic
, 2020 We describe various issues caused by the lack of round-to-nearest mode in the \textit{gcc} compiler implementation of the fixed-point arithmetic data types and operations.
Mikaitis, Mantas
core +1 more source
Region-Based Fractional Wavelet Transform Using Post Processing Artifact Reduction [PDF]
Iraqi Journal for Electrical and Electronic Engineering, 2010 Wavelet-based algorithms are increasingly used in the source coding of remote sensing, satellite and other geospatial imagery. At the same time, wavelet-based coding applications are also increased in robust communication and network transmission of ...
Jassim M. Abdul-Jabbar +1 more
doaj
IMPLEMENTATION OF THE ARITHMETIC ADDITION OPERATION IN THE SYSTEM OF RESIDUAL CLASSES
Сучасні інформаційні системи, 2020 The subject of the article is the development of a method for implementing the arithmetic operation of addition numbers that are represented in the system of residual classes (SRC). This method is based on the use of the principle of circular shift (PCS).
Victor Krasnobayev +2 more
doaj +1 more source
Minimizing CNOT-count in quantum circuit of the extended Shor’s algorithm for ECDLP
Cybersecurity, 2023 The elliptic curve discrete logarithm problem (ECDLP) is a popular choice for cryptosystems due to its high level of security. However, with the advent of the extended Shor’s algorithm, there is concern that ECDLP may soon be vulnerable.
Xia Liu, Huan Yang, Li Yang
doaj +1 more source