By Topic

Some good fields and rings for computing number theoretic transforms

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
$33 $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

1 Author(s)
B. Rice ; Department of Defence, Washington, DC

The number of multiplications required to compute number-theoretic transforms may be reduced by auspicious choice of the field or ring in which the computation is to be done. One method is to perform the computation in a direct sum of relatively small finite fields, using table lookups in lieu of multiplications in some or all of the component fields and using the Chinese Remainder Theorem to obtain the final result. Pipelining or parallel computation may be naturally applied to such computations. Another technique is the computation of d-long transforms in fields which contain low density dth roots of unity, for then many multiplications may be replaced by bit shifts and additions. The search for such fields and primitive roots may be facilitated by results on factoring large numbers of the form 2n± 1.

Published in:

IEEE Transactions on Acoustics, Speech, and Signal Processing  (Volume:27 ,  Issue: 4 )