Scaling in residue number systems
Copyright policy )Scaling in residue number systems
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. The complexity in time and hardware of a parallel pipelined implementation is discussed. \{On the left hand side of equations (9), for \(I_ k(A)\) read \(\hat I_ k(A)\).\}.
Complexity and performance of numerical algorithms, parallel processing, modular arithmetic, division, residue number systems, Parallel numerical computation, complexity, Radix representation; digital problems, parallel pipelined implementation
Complexity and performance of numerical algorithms, parallel processing, modular arithmetic, division, residue number systems, Parallel numerical computation, complexity, Radix representation; digital problems, parallel pipelined implementation
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).1 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!