By Topic

Radix-2 DIF fast algorithms for 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

4 Author(s)
Guoan Bi ; Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ. ; Yongmei Wei ; Gang Li ; Chunru Wan

The polynomial time-frequency transform (PTFT) converts a one-dimensional polynomial-phase signal (PPS) into a multi-dimensional (MD) output array in the frequency domain from which the phase coefficients are estimated. To significantly reduce the prohibitive computational complexity to deal with high order PPSs, effective decomposition of the overall computational task is important for any practical applications. This paper derives a radix-2 decimation-in-frequency (DIF) fast algorithms for any order of the PPSs by using the periodic and symmetric properties of the PTFT. Compared with other reported fast algorithms, the proposed one is simple in concept and achieves a significant reduction of the required computational complexity

Published in:

Aerospace and Electronic Systems, IEEE Transactions on  (Volume:42 ,  Issue: 4 )