Hardware realization of a Fermat number transform

The hardware design and implementation of a Fermat number transform (FNT) is described. The arithmetic logic design is treated in detail and a new data representation for integers modulo a Fermat number is derived. In addition, the FNT is compared with the fast Fourier transform (FFT) on the basis of hardware required for a pipeline convolver.