Please use this identifier to cite or link to this item:
Title: Efficient realisation of discrete Fourier transforms using the recursive discrete Hartley transform
Authors: Siu, WC 
Wong, KL
Issue Date: 1989
Source: IEE proceedings. E, Computers and digital techniques, 1989, v. 136, no. 4, p. 254-261 How to cite?
Journal: IEE proceedings. E, Computers and digital techniques 
Abstract: We present the results of our study using a recursive discrete Hartley transform technique to compute discrete Fourier transforms. We introduce an improved in-place and in-order prime-factor mapping to 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 smaller than that of the WFTA. This approach is suitable for cases where there are restrictions on program lengths.
ISSN: 0143-7062
Appears in Collections:Journal/Magazine Article

View full-text via PolyU eLinks SFX Query
Show full item record


Citations as of Oct 18, 2017

Page view(s)

Last Week
Last month
Checked on Oct 15, 2017

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.