A parallel architecture for FNT and modified Winograd algorithms to compute DFT
T.S. Rao, Shilpi Gupta · 2003
Fermat number transforms (FNT) are a class of transforms which operate in the integer domain. This means there will be no complex number calculations. If the base of FNT is a power of 2, then the computation of the transform does not involve any multiplications at all. A discussion is also presented of computing a discrete Fourier transform (DFT) through Winograd algorithms, wherein the cyclic convolutions are computed by using the FNT. Three cases of the Winograd algorithm are considered.>