Your browser does not support JavaScript!

New number theoretic transform

New number theoretic transform

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

A new number theoretic transform is introduced. This transform is defined modulo the Mersenne primes, has long transform length which is a power of two, a fast algorithm, and the inverse transform has within a factor of (1/N) the same form as the forward transform. Thus, it is well suited for the calculation of error free convolutions and correlations.


    1. 1)
      • C.M. Rader . Discrete convolution via Mersenne transforms. IEEE Trans. , 1269 - 1273
    2. 2)
      • I.S. Reed , T.K. Truong . The use of finite fields to compute convolutions. IEEE Trans. , 2
    3. 3)
      • R.C. Agarwal , C.S. Burrus . Fast convolution using Fermat number transforms with applications to digital filtering. IEEE Trans. , 87 - 97
    4. 4)
      • Rader, C.M.: `The number theoretic DFT and exact discrete convolution', IEEE Arden House Workshop on digital signal processing, 11 January 1972, Harriman, .

Related content

This is a required field
Please enter a valid email address