Share Email Print
cover

Proceedings Paper

Number Theoretic Transform Modular Residue Processors
Author(s): G. Eichmann; J. Keybl; R. Mammone
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Finite digital convolution (FDC) appears in the implementation of finite impulse response digital filtering, in auto-aid cross-correlation, polynominal multiplication and the multiplication of very large numbers. While there are several methods to implement FDC, when the lengths of the sequences to be convolved is a highly composite number, the discrete fast Fourier transform (FFT) approach is used. This approach requires generating, storing and truncating a large number of complex exponentials. Recent interest has centered on finding real basis numbers that preserve the properties of the FFT. By working in a finite field of integers with arithmetic modulo an integer M, a large class of new transforms, called number theoretic transforms, can be generated. These transforms are useful in applications where integer arithmetic is already being considered, such as spread-spectrum encoding, digital error-correction and data encryption, or where the data is digitally encoded in a finite number of bits. In this paper, residue arithmetic based number theoretic transforms will be considered.

Paper Details

Date Published: 29 February 1980
PDF: 8 pages
Proc. SPIE 0209, Optical Signal Processing for C3I, (29 February 1980); doi: 10.1117/12.958294
Show Author Affiliations
G. Eichmann, The City College of the City University of New York (United States)
J. Keybl, The City College of the City University of New York (United States)
R. Mammone, The City College of the City University of New York (United States)


Published in SPIE Proceedings Vol. 0209:
Optical Signal Processing for C3I
William J. Miceli, Editor(s)

© SPIE. Terms of Use
Back to Top