Results 251 to 260 of about 395,811 (280)

A more efficient residue arithmetic implementation of the FFT

1985 IEEE 7th Symposium on Computer Arithmetic (ARITH), 1985
After 20 years, the FFT remains restricted in its real time capabilities. To overcome this throughput obstacle, fast residue arithmetic units are studied based on several recent innovations in the field of complex finite rings. A dedicated machine is designed which makes use of these new results and is compared to conventional FFT designs.
openaire   +2 more sources

Improved decoding algorithms for arithmetic residue codes

1978
Summary: Two classes of arithmetic codes constructed in residue number systems are considered, and decoding algorithms based on the convergents of continued fractions are presented. The advantages of the proposed algorithms over those previously known are discussed.
Barsi F., Maestrini P.
openaire   +3 more sources

Abelian groups and quadratic residues in weak arithmetic

Mathematical Logic Quarterly, 2010
AbstractWe investigate the provability of some properties of abelian groups and quadratic residues in variants of bounded arithmetic. Specifically, we show that the structure theorem for finite abelian groups is provable in S22 + iWPHP(Σ1b), and use it to derive Fermat's little theorem and Euler's criterion for the Legendre symbol in S22 + iWPHP(PV ...
openaire   +3 more sources

Residue BDD and its application to the verification of arithmetic circuits

Proceedings of the 32nd ACM/IEEE conference on Design automation conference - DAC '95, 1995
The paper describes a verification method for arithmetic circuits based on residue arithmetic. In the verification, a residue module is attached to the specification and the implementation, and these outputs are compared by constructing BDD's. For the BDD construction without node explosion, we introduce a residue BDD whose width is less than or equal ...
openaire   +2 more sources

Residue Logarithmic Coprocessor for Mass Arithmetic Computations

2018
The work is aimed at solving the urgent problems of modern high-performance computing. The purpose of the study is to increase the speed, accuracy and reliability of mass arithmetic calculations. To achieve the goal, author’s methods of performing operations and transforming data in the prospective residue logarithmic number system are used.
openaire   +1 more source

Modular Arithmetic: Calculating with Residue Classes

2001
We begin this chapter with a discussion of the principle of division with remainder. In relation to this we shall explain the significance of these remainders, their possible applications, and how one calculates with them. In order for the functions to be introduced later to be understandable, we begin with a bit of algebra.
openaire   +1 more source

Residue Arithmetic A Tutorial with Examples

Computer, 1984
openaire   +1 more source

Some Arithmetical Applications of Residuation

American Journal of Mathematics, 1937
openaire   +1 more source

Residue arithmetic systems in cryptography: a survey on modern security applications

Journal of Cryptographic Engineering, 2020
Dimitrios Schoinianakis
exaly  

Residue Arithmetic

2011
openaire   +1 more source