Results 281 to 290 of about 1,104,642 (331)
Some of the next articles are maybe not open access.

Symmetric Cryptoalgorithms in the Residue Number System

Cybernetics and Systems Analysis, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kasianchuk, M. M.   +2 more
openaire   +1 more source

Error Control in Residue Number Systems

Applicable Algebra in Engineering, Communication and Computing, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Miller, David F., Rutter, Edgar A.
openaire   +2 more sources

Integer division in residue number systems

IEEE Transactions on Computers, 1995
Summary: This contribution to the ongoing discussion of division algorithms for Residue Number Systems (RNS) is based on Newton iteration for computing the reciprocal. An extended RNS with twice the number of moduli provides the range required for multiplication and scaling. Separation of the algorithm description from its RNS implementation achieves a
Hitz, Markus A., Kaltofen, Erich
openaire   +2 more sources

Scaling in residue number systems

Cybernetics, 1990
Let \(m_ 1,\dots,m_ k\) be pairwise relatively prime integers \((k \geq 2)\), with \(m_ 1m_ 2\dots m_ k = M\). It is desired to approximate \(A/S\) by modular arithmetic, where \(S\) is a positive rational number and \(A\) is an integer such that \(2| A| \leq M\). A method is given for doing this in a form suitable for parallel processing.
Vasilevich, L. N., Kolyada, A. A.
openaire   +2 more sources

The Residue Number System

IEEE Transactions on Electronic Computers, 1959
A novel number system called the residue number system is developed from the linear congruence viewpoint. The residue number system is of particular interest because the arithmetic operations of addition, subtraction and multiplication may be executed in the same period of time without the need for carry.
openaire   +1 more source

Residue Number Systems

2014
Residue Number Systems have probed their potential for computation-intensive applications, especially those related to signal processing. Their main advantage is the absence of carry propagation between channels in addition, subtraction and multiplication.
Antonio Lloris Ruiz   +3 more
openaire   +1 more source

Single Residue Error Correction in Residue Number Systems

IEEE Transactions on Computers, 1983
Summary: We present a new method to correct single errors in an \(n\)-residue number system through the use of \(r\) redundant moduli. The method requires \(\lceil 2n/r\rceil + 2\) recombinations of \(n\) residues in the worst case. This is of lower complexity than any other known method.
openaire   +2 more sources

Residue number system reconfigurable datapath

2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353), 2003
In this paper we describe a possible approach to implement a reconfigurable datapath for digital signal processing. The datapath should be programmable in terms of dynamic range, type and sequence of operations. We chose to implement it in the Residue Number System (RNS), because the RNS offers high speed and low power dissipation.
G.C. Cardarilli   +3 more
openaire   +1 more source

Residue Number Systems

Advanced Computing and Communications, 2017
Residue Number systems have been extensively studied in past four decades in view of their advantages in some applications in Digital Signal Processing and Cryptography. In this tutorial paper, we introduce the basic concepts highlighting the advantages and disadvantages over other number systems.
openaire   +1 more source

Residue number system scaling schemes

SPIE Proceedings, 2005
Although multiplication and addition can be very efficiently implemented in a Residue Number System (RNS), scaling (division by a constant) is much more computationally complex. This limitation has prevented wider adoption of RNS. In this paper, different RNS scaling schemes are surveyed and compared.
Yinan Kong, Braden Phillips
openaire   +1 more source

Home - About - Disclaimer - Privacy