Results 251 to 260 of about 1,104,347 (288)

On Translation Algorithms in Residue Number Systems

IEEE Transactions on Computers, 1972
Summary: This paper considers translation problems in residue number systems. The conversion from a fixed-base representation to a residue representation can be done using residue adders only; we show that relatively simple combinational logic can be used to replace one level of residue addition.
Banerji, Dilip K., Brzozowski, Janusz A.
openaire   +1 more source

Multiple Constant Multiplication through Residue Number System

2009 Conference Record of the Forty-Third Asilomar Conference on Signals, Systems and Computers, 2009
Several algorithms have been developed over the years to reduce the number of additions needed for Multiple Constant Multiplication (MCM) and optimize the area. In this work, we present an approach to MCM which is based on the properties of the Residue Number System (RNS).
Shuli, I, Petricca, M, CARDARILLI, GIAN CARLO, Nannarelli, A, RE, MARCO   +4 more
openaire   +1 more source

On residue number system decoding

IEEE Transactions on Acoustics, Speech, and Signal Processing, 1986
The use of a residue number system (RNS) in digital systems and especially filter designs is facilitated by efficient algorithms for the conversion from RNS to binary numbers. The conversion is generally based on the Chinese remainder theorem or the mixed radix conversion.
openaire   +1 more source

Residue number system implementations of number theoretic transforms in complex residue rings

IEEE Transactions on Acoustics, Speech, and Signal Processing, 1980
The implementation of number theoretic transforms (NTT) defined in complex residue rings are investigated. Because of improving the dynamic range the transform is computed in parallel using the residue number system. In the first approach the operations are computed in Galois fields GF \((m^ 2_ i)\) with primes of the form \(m_ i=4k+3\).
Baraniecka, Anna Z., Jullien, G. A.
openaire   +2 more sources

Residue Number System Based Implementation

2001
Residue Number System (RNS) based implementation of DSP algorithms have been presented in the literature [29, 30, 92] as a technique for high speed realization. In a Residue Number System (RNS), an integer is represented as a set of residues with respect to a set of integers called the Moduli.
Manesh Mehendale, Sunil D. Sherlekar
openaire   +1 more source

One-Hot Residue Logarithmic Number Systems

2019 29th International Symposium on Power and Timing Modeling, Optimization and Simulation (PATMOS), 2019
Switching behavior and dynamic power consumption of arithmetic circuits are influenced by the distribution of operands as well as the number system used to encode them. Binary integer encoding may cause severe switching fluctuation; the integer Residue Number System (RNS) reduces this by breaking the integer into smaller moduli, which in turn may use ...
Mark G. Arnold, Ioannis Kouretas, Vassilis Paliouras, Austin Morgan   +3 more
openaire   +1 more source

Parallel computation of residue number system

2006 International Conference on Computing & Informatics, 2006
Chinese remainder theorem (CRT), an old and famous theorem, is widely used in many modern computer applications. The computation of CRT contains many similar operations which can be implemented concurrently. Here, a parallel algorithm implemented on the ring topology is proposed to parallelize almost all the computations in CRT and J-conditions in this
C.C. Chang, Y.T. Kuo, Y.P. Lai
openaire   +1 more source

Base conversion in residue number systems

BIT, 1975
We are concerned in this paper with the representation of an integer in a (multiple-modulus) residue number system and, in particular, with an algorithm for changing the base vector of the residue number system. Szabo and Tanaka [1, p.47] describe such an algorithm when each modulus of the second base vector is relatively prime to each modulus of the ...
Gregory, Robert Todd, Matula, David W.
openaire   +2 more sources

Integer division in residue number system

ICECS 2001. 8th IEEE International Conference on Electronics, Circuits and Systems (Cat. No.01EX483), 2002
Division, sign detection and number comparison are the more difficult operations in residue number systems (RNS). These shortcomings limited most RNS implementations to additions, subtractions and multiplications. In this paper, a high level description of a RNS division algorithm is proposed.
B. Rejeb, H. Henkelmann, W. Anheier
openaire   +1 more source

Quadratic Residue Number Systems

2002
Complex signal processing can be handled by RNS in a manner similar to standard complex number operations such as addition, subtraction, multiplication etc. However, under certain special cases of choice of moduli, the complete decoupling of computation of real and imaginary parts of the result is feasible.
openaire   +1 more source