Abstract
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.
Sign-in/Register to access full text options 
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 callMore From: IEEE Transactions on Aerospace and Electronic Systems
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
