International Conference on Acoustics, Speech, and Signal Processing
DOI: 10.1109/icassp.1989.266618
|View full text |Cite
|
Sign up to set email alerts
|

Efficient scaling in the residue number system

Abstract: In this note a unified Residue Number System scaling technique is presented which allows the designer a great deal of flexibility in choosing the scale factor. The technique is based on the L(E + 6)-CRT , a generalization of the work descibed in [7], [9], and [l-41. By embedding the scaling process in the Chinese Remainder Theorem, the L(e + 6)-CRT can also be used to simplify the residue-te analog conversion problem. The flexibility in choosing the scale factor and new reduced system modulus comes at the cost… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
24
0

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 37 publications
(24 citation statements)
references
References 8 publications
0
24
0
Order By: Relevance
“…A sample of these are listed in the Residue Number Systems section of the Bibliography, Refs. [15][16][17][18][19][20][21][22][23][24][25][26][27][28][29].…”
Section: Rns Arithmeticmentioning
confidence: 99%
“…A sample of these are listed in the Residue Number Systems section of the Bibliography, Refs. [15][16][17][18][19][20][21][22][23][24][25][26][27][28][29].…”
Section: Rns Arithmeticmentioning
confidence: 99%
“…In other words, their design provided more accurate scaled residues at the cost of more clock cycles. Two scaling algorithms for the moduli set (2 n -1, 2 n , 2 n + 1) using CRT were proposed in 1989 [15]. The first algorithm was based on the L-CRT algorithm for L-tuple RNS.…”
Section: Related Workmentioning
confidence: 99%
“…It was suitable for small-word-length applications and performed scaling directly on the residue digits rather than relying on residue-tobinary conversion. From the implementation point of view, scaling algorithms are implemented either in LUT (look up table) based approaches [7], [15], [16], [17], [21], [22], [23], or adder-based approaches [5]. Generally, all the LUT-based designs in the literature are subject to poor pipeline-ability and high hardware complexity when the number of moduli increases.…”
Section: Related Workmentioning
confidence: 99%
“…Thus, this FIR filter includes 2C-to-index conversion and eight index-based Galois field parallel RNS channels, including index-to-RNS conversion tables. Efficient block decomposition 2C-to-RNS [19] and £-CRT-based [15] RNS-to-2C conversions are used to optimize area and performance of both filters.…”
Section: Design Examplesmentioning
confidence: 99%