On the computation of discrete fourier transform using fermat number transform
作者:
Wan-ChiSiu,
A.G.Constantinides,
期刊:
IEE Proceedings F (Communications, Radar and Signal Processing)
(IET Available online 1984)
卷期:
Volume 131,
issue 1
页码: 7-14
年代: 1984
DOI:10.1049/ip-f-1.1984.0003
出版商: IEE
数据来源: IET
摘要:
In the paper the results of a study using Fermat number transforms (FNTs) to compute discrete Fourier transforms (DFTs) are presented. Eight basic FNT modules are suggested and used as the basic sequence lengths to compute long DFTs. The number of multiplications per point is for most cases not more than one, whereas the number of shift-adds is approximately equal to the number of additions in the Winograd-Fourier-transform algorithm and the polynomial transform. Thus the present technique is very effective in computing discrete Fourier transforms.
点击下载:
PDF
(966KB)
返 回