By Topic

Effective RNS scaling algorithm with the Chinese remainder theorem decomposition

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ulman, Z.D. ; Tech. Univ. of Gdansk, Poland ; Czyzak, M. ; Zurada, J.M.

A novel scaling technique in the residue number system (RNS) is proposed. In this technique, the main computational effort is made in the precomputing phase. The remainder calculations are performed by the modulo and binary adders. The scaling requires one look-up cycle and time for modulo addition of the n+2 operands. In the proposed approach there are restrictions neither on the form and the size nor on the number of moduli of the RNS. The scaling factor K can be integer or real, and it must fulfill merely a weak condition K > n, where n is the number of moduli. The absolute scaling error by using the correction scheme does not exceed 1.5

Published in:

Communications, Computers and Signal Processing, 1993., IEEE Pacific Rim Conference on  (Volume:2 )

Date of Conference:

19-21 May 1993