Efficient realisation of discrete Fourier transforms using the recursive discrete Hartley transform
作者:
W.C.Siu,
K.L.Wong,
期刊:
IEE Proceedings E (Computers and Digital Techniques)
(IET Available online 1989)
卷期:
Volume 136,
issue 4
页码: 254-261
年代: 1989
DOI:10.1049/ip-e.1989.0035
出版商: IEE
数据来源: IET
摘要:
In the paper, we present the results of our study using a recursive discrete Hartley transform technique to compute discrete Fourier transforms. We also introduce an improved in-place and in-order prime-factor mapping to effectively realise composite-length DFTs. In using these new techniques, the speed of computation is comparable to that of the Winograd Fourier transform algorithm (WFTA), whereas the program size of the present approach is much smaller than that of the WFTA. This approach is most suitable for the cases where there are restrictions on program lengths.
点击下载:
PDF
(764KB)
返 回