论文信息 - New Scaling Algorithms For The Chinese Remainder Theorem

New Scaling Algorithms For The Chinese Remainder Theorem

Two scaled-CRT algorithms have been proposed in this paper that are based on the D/A CRT described by Soderstrand[6]. The first algorithm, the L-CRT, is a generalization of the D/A CRT except that it returns an integer. The second - and the most efficient - algorithm, the 2/sup 2n-1/-CRT, is an approximation of the 3-moduli, {2/sup n/ - 1, 2/sup n/, 2/sup n/ + 1), RNS - Two Theorems, quantifying the error bounds, are presented and then verified through extensive experimental analysis. The most important consequence of the proposed scaled CRT algorithms is the reduction in hardware complexity due to the embedded scaling.

F. Taylor | M. Griffin | M. Sousa

[1] W. Kenneth Jenkins,et al. The use of residue number systems in the design of finite impulse response digital filters , 1977 .

[2] W. Kenneth Jenkins,et al. Techniques for residue-to-analog conversion for residue-encoded digital filters , 1978 .

[3] W K Jenkins. Recent advances in residue number techniques for recursive digital filtering , 1979 .

[4] F. Taylor,et al. Large moduli multipliers for signal processing , 1981 .

[5] Fred J. Taylor,et al. An Autoscale Residue Multiplier , 1982, IEEE Transactions on Computers.

[6] M. Soderstrand,et al. An improved residue number system digital-to-analog converter , 1983 .

[7] Thu V. Vu. Efficient Implementations of the Chinese Remainder Theorem for Sign Detection and Residue Decoding , 1985, IEEE Trans. Computers.