By Topic

Split-Radix Algorithms for Arbitrary Order of Polynomial Time Frequency Transforms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Guoan Bi ; Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore ; Yongmei Wei

The polynomial time frequency transform is one of important tools for estimating the coefficients of the polynomial-phase signals (PPSs) with the maximum likelihood method. The transform converts a one-dimensional (1-D) data sequence into a multidimensional output array from which the phase coefficients of the data sequence are estimated. A prohibitive computational load is generally needed for high-order polynomial-phase signals although the 1-D fast Fourier transform (FFT) algorithm can be used. Based on the split-radix concept, this paper derives a fast algorithm for arbitrary order of polynomial time frequency transforms to significantly reduce the computational complexity. Comparisons on the computational complexity needed by various algorithms are also made to show the merits of the proposed algorithm

Published in:

Signal Processing, IEEE Transactions on  (Volume:55 ,  Issue: 1 )