Abstract
In the paper, algorithms for computing discrete Fourier transform (DFT) of 1-D real symmetric and antisymmetric sequences, using the prime-factor algorithm (PFA) and the Winograd Fourier transform algorithm (WFTA), are presented. These algorithms are obtained from different factorisations of the Fourier matrix, and it is shown that symmetry conditions exist at each stage which are used to construct efficient algorithms for computing DFTs.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call