An improvement in the computation of discrete Fourier transform using Fermat number transform

Wan-Chi Siu · 1st IASTED International Symposium on Signal Processing and its Applications · 1987

This paper describes a redaction on the number of shift-adds for the computation of prime length Discrete Fourier Transforms(DFT) using Fermat Number Transforms(FNT). This gives an overall improvement on the figures of merit for the computation of long sequences using FNT.

Read the paper · More papers on PaperTik