Proceedings 14th IEEE Symposium on Computer Arithmetic (Cat. No.99CB36336)
DOI: 10.1109/arith.1999.762842
|Get access via publisher |Cite
|
Sign up to set email alerts

A reverse converter for the 4-moduli superset {2/sup n/-1, 2/sup n/, 2/sup n/+1, 2/sup n+1/+1}

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
39
0

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 46 publications
(39 citation statements)
references
References 14 publications
0
39
0
Order By: Relevance
“…The best-known three-moduli sets are: {2 n − 1, 2 n , 2 n + 1} -for which reverse converters have been proposed, for example in [10,22,32] -and its generalisation {2 n − 1, 2 k , 2 n + 1} with flexible even modulus 2 k , for which the reverse converter for n ≤ k ≤ 2n was proposed in [7]. The four-moduli sets include those with a single parameter n: {2 n − 1, 2 n , 2 n−1 − 1, 2 n−1 + 1} (n odd) [28], {2 n − 1, 2 n , 2 n + 1, 2 n+1 − 1} (n even) [2,3,5,28,30], {2 n , 2 n − 1, 2 n + 1, 2 n−1 − 1} (n even) [5], {2 n −1, 2 n , 2 n +1, 2 n+1 +1} (n odd) [2,29], and {2 n +1, 2 n −1, 2 n , 2 n−1 +1} (n odd) [20], as well as some of their recently proposed generalisations with a flexible even modulus 2 k : {2 k , 2 n − 1, 2 n + 1, 2 n+1 − 1} (n even and arbitrary k such that n ≤ k ≤ 2n) [6], {2 n−1 − 1, 2 n+1 − 1, 2 k , 2 n − 1} (n even and k > 2) [33] and {2 k , 2 n −1, 2 n +1, 2 n+1 −1, 2 n±1 −1} [19] (n even and k > 2). Further reduction of the widths of residue channels for a given dynamic range allow for two special five-moduli sets composed only of low-cost moduli: {2 n −1, 2 n , 2 n +1, 2 n+1 −1, 2 n−1 −1} (n even) [4] and {2 n − 1, 2 n , 2 n + 1, 2 n+1 + 1, 2 n−1 + 1} (n odd) [18].…”
Section: Introductionmentioning
confidence: 99%
“…The best-known three-moduli sets are: {2 n − 1, 2 n , 2 n + 1} -for which reverse converters have been proposed, for example in [10,22,32] -and its generalisation {2 n − 1, 2 k , 2 n + 1} with flexible even modulus 2 k , for which the reverse converter for n ≤ k ≤ 2n was proposed in [7]. The four-moduli sets include those with a single parameter n: {2 n − 1, 2 n , 2 n−1 − 1, 2 n−1 + 1} (n odd) [28], {2 n − 1, 2 n , 2 n + 1, 2 n+1 − 1} (n even) [2,3,5,28,30], {2 n , 2 n − 1, 2 n + 1, 2 n−1 − 1} (n even) [5], {2 n −1, 2 n , 2 n +1, 2 n+1 +1} (n odd) [2,29], and {2 n +1, 2 n −1, 2 n , 2 n−1 +1} (n odd) [20], as well as some of their recently proposed generalisations with a flexible even modulus 2 k : {2 k , 2 n − 1, 2 n + 1, 2 n+1 − 1} (n even and arbitrary k such that n ≤ k ≤ 2n) [6], {2 n−1 − 1, 2 n+1 − 1, 2 k , 2 n − 1} (n even and k > 2) [33] and {2 k , 2 n −1, 2 n +1, 2 n+1 −1, 2 n±1 −1} [19] (n even and k > 2). Further reduction of the widths of residue channels for a given dynamic range allow for two special five-moduli sets composed only of low-cost moduli: {2 n −1, 2 n , 2 n +1, 2 n+1 −1, 2 n−1 −1} (n even) [4] and {2 n − 1, 2 n , 2 n + 1, 2 n+1 + 1, 2 n−1 + 1} (n odd) [18].…”
Section: Introductionmentioning
confidence: 99%
“…These inherent properties make RNS very suitable to achieve a fast digital signal processing (DSP) systems including intensive computations like digital filtering, convolutions, correlations, Discrete Fourier Transform (DFT) computations, Fast Fourier Transform (FFT) computations and Direct Digital Frequency (DDF) synthesis [2]. However, RNS has not found a widespread usage in general purpose computing due to some difficult operations including overflow detection, magnitude comparison, sign detection, moduli selection, and conversion from decimal/binary to RNS and most especially the vice visa, [3], [4], [5]. Of many of these numerous RNS difficult operations, Data conversion is very critical.…”
Section: Introductionmentioning
confidence: 99%
“…The DR provided by these moduli sets is not sufficient for applications which require larger dynamic range. Hence, 4n-bit DR four-moduli sets such as {2 n −1, 2 n , 2 n +1, 2 n+1 +1} [19], [20], {2 n −1, 2 n , 2 n +1, 2 n+1 − 1} [20]- [22] and {2 n − 3, 2 n + 1, 2 n − 1, 2 n + 3} [23] have been introduced. These four-moduli sets include balanced moduli, but some of their multiplicative inverses have inelegant forms which resulted in increasing the cost and the delay of the residue to binary converter.…”
Section: Introductionmentioning
confidence: 99%