Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/23789
Title: An enhanced model for software realisation of recursive prime radix discrete Fourier transform
Authors: Lun, DPK 
Siu, WC 
Issue Date: 1990
Publisher: IEEE
Source: Proceedings - IEEE International Symposium on Circuits and Systems, 1990, v. 3, p. 2369-2372 How to cite?
Abstract: An enhanced model is proposed for a software realization of the recursive prime radix algorithm used for computing the discrete Fourier transform. It is shown that a very efficient in-place, in-order prime factor mapping (PFM) addressing scheme can best be applied to the model. In this scheme, a single mapping equation is used for both data loading and data retrieval, hence no extra unscrambling process is required. The authors propose to use a form of two parallel recursive digital filters for the computation of each short-length DFT (discrete Fourier transform). A significant improvement in speed is thereby achieved. This algorithm has been realized using Fortran 77 language with the IBM PC AT. Results of the realization show that the proposed software computation model can achieve a 44% speed improvement over the radix-2 FFT (fast Fourier transform) algorithm, whereas the code length is comparable. As compared with the prime factor algorithm, it has a similar, if not better, speed performance for medium-length DFT computations. However, the code length is much shorter. This approach has the advantage of a large choice of sequence lengths, unlike the FFT algorithms.
Description: 1990 IEEE International Symposium on Circuits and Systems Part 3 (of 4), New Orleans, LA, USA, 1-3 May 1990
URI: http://hdl.handle.net/10397/23789
ISSN: 0271-4310
Appears in Collections:Conference Paper

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

SCOPUSTM   
Citations

2
Citations as of Jan 12, 2018

Page view(s)

53
Last Week
0
Last month
Citations as of Jan 21, 2018

Google ScholarTM

Check


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