Results 241 to 250 of about 1,104,347 (288)

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

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, Encarnación Castillo Morales, Luis Parrilla Roure, Antonio García Ríos   +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, A. Del Re, A. Nannarelli, M. Re   +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

Nanophotonics Based Residue Number System

OSA Advanced Photonics Congress (AP) 2019 (IPR, Networks, NOMA, SPPCom, PVLED), 2019
Here we design a nanophotonic RNS arithmetic by spatially shifting the input waveguides relative to the routers’ outputs, where the moduli are represented by the number of waveguides under 10’s ps computational execution time, which can be used for functional analysis of convolutional neural networks.
Shuai Sun, Jiaxin Peng, Tarek El-Ghazawi, Volker J. Sorger   +3 more
openaire   +1 more source

Error correction in redundant residue number systems

1972 IEEE 2nd Symposium on Computer Arithmetic (ARITH), 1972
In this paper, two error-correcting algorithms for redundant residue number systems are presented, one for single residue-error correction and the other for burst residue-error correction. Neither algorithm requires table look-up and hence their implementations need a memory space which is much smaller than that required by existing methods ...
Yau, Stephen Sik-Sang, Liu, Yu-Cheng
openaire   +1 more source