Fast algorithms for PTFTs

The polynomial time frequency transforms have become a useful tool to analyze polynomial-phase signals for their time-varying characteristics. To minimize the required computational complexity to deal with high order polynomial-phase signals, efficient fast algorithms are extremely important for any practical applications. Based on radix-3 decomposition techniques, this paper presents fast algorithms for any order of the polynomial-phase signals. It shows that the proposed algorithms are simple in concept and achieve significant savings on computational complexity compared to other reported algorithms.