Results 231 to 240 of about 395,811 (280)

On the complex residue arithmetic system (CRNS)

IEEE Transactions on Acoustics, Speech, and Signal Processing, 1986
Recently, a number of papers has been published on the subject of performing complex arithmetic in the residue number system. Methods have been proposed which reduce the arithmetic complexity of a complex multiply by more than 50 percent. In this correspondence it is shown that these methods achieve Winograd's lower bound, and how these efficient ...
exaly   +3 more sources

Residue Arithmetic in FPGA Matrices

2006 International Conference on Dependability of Computer Systems, 2006
In this work there is presented the methodology of designing residue generators and arithmetic units for modern FPGA matrices. The proposed algorithms take advantage of dedicated logic for high-speed arithmetic present in Xilinx Spartan-2 and Virtex FPGA families.
openaire   +2 more sources

Optical computation using residue arithmetic

Applied Optics, 1979
Using residue arithmetic it is possible to perform additions, subtractions, multiplications, and polynomial evaluation without the necessity for carry operations. Calculations can, therefore, be performed in a fully parallel manner. Several different optical methods for performing residue arithmetic operations are described.
A, Huang, Y, Tsunoda, J W, Goodman, S, Ishihara   +3 more
openaire   +2 more sources

An acceleration of quasigroup operations by residue arithmetic

Concurrency and Computation: Practice and Experience, 2017
SummaryQuasigroup operations are essential for a wide range of cryptographic procedures that includes cryptographic hash functions, electronic signatures, pseudorandom number generators, and stream and block ciphers. Quasigroup cryptography achieves high levels of security at low memory and computational costs by an iterative application of quasigroup ...
Pavel Krömer, Jan Platos, Jana Nowaková, Václav Snásel   +3 more
openaire   +2 more sources

Residue arithmetic with rational operands

1981 IEEE 5th Symposium on Computer Arithmetic (ARITH), 1981
A method is described for doing residue arithmetic when the operands are rational numbers. A rational operand a/b is mapped onto the integer |a·b−1| p and the arithmetic is performed in GF(p). A method is given for taking an integer result and finding its rational equivalent (the one which corresponds to the correct rational result).
openaire   +2 more sources

An optical residue arithmetic unit

Proceedings of the 5th annual symposium on Computer architecture - ISCA '78, 1978
The residue number system is used to partition addition, subtraction, multiplication, or integer polynomial transforms into several simpler calculations, each of which can be processed in parallel with complete independence. These segments are computationally simple such that all the arithmetic interactions can be enumerated as mathematical mappings ...
openaire   +1 more source

Residue or Modular Arithmetic

1984
Since an automatic digital computer is a finite machine, it is capable of representing, internally, only a finite set of numbers. Thus, any attempt to use an automatic digital computer to do arithmetic in the field of real numbers (ℝ, +, ·) is doomed to failure because ℝ is an infinite set and most of the elements in this set cannot be represented in a
R. T. Gregory, E. V. Krishnamurthy
openaire   +1 more source

Design of a residue arithmetic multiplier

IEE Proceedings G Circuits, Devices and Systems, 1992
The design of a pipelined residuearithmetic multiplier is presented. The design uses multiple radices coded in binary. The multiplier accepts two 8-bit unsigned binary numbers and returns a 16-bit binary product. The five radices 7, 8, 11, 13 and 15, are chosen in a manner to give redundancy to numbers represented in residue arithmetic. This redundancy
H.M. Razavi, J. Battelini
openaire   +1 more source

Fast division in residue arithmetic

[1991] IEEE Pacific Rim Conference on Communications, Computers and Signal Processing Conference Proceedings, 2002
A residue division technique is presented. The technique is based on the use of a number system termed the radix-based residue number system (RNS) and, associated with it, the homogeneous mixed-radix number system (HMRS). The quotient is obtained as the sum of the rounded partial quotients of the HMRS weights and the divisor.
Z.D. Ulman, M. Czyzak, J.M. Zurada
openaire   +1 more source

Residue Checker with Signed-Digit Arithmetic for Error Detection of Arithmetic Circuits

Journal of Circuits, Systems and Computers, 2003
This paper presents a fast residue checker for the error detection of arithmetic circuits. The residue checker consists of a number of residue arithmetic circuits such as adders, multipliers and binary-to-residue converters based on radix-two signed-digit (SD) number arithmetic.
Shugang Wei, Kensuke Shimizu
openaire   +2 more sources