Generalized Fast Algorithms for the Polynomial Time-Frequency Transform

Abstract

This paper presents a general class of fast algorithms for computing the polynomial time-frequency transform (PTFT) of length-a<sup>p</sup>b, where a, b, and p are positive integers. The process of derivation shows some interesting properties that are effectively used for minimization of the computational complexity. By assigning values of a, b, and p… (More)
DOI: 10.1109/TSP.2007.896102

Topics

4 Figures and Tables

Cite this paper

@article{Ju2007GeneralizedFA, title={Generalized Fast Algorithms for the Polynomial Time-Frequency Transform}, author={Yingtuo Ju and Guoan Bi}, journal={IEEE Transactions on Signal Processing}, year={2007}, volume={55}, pages={4907-4915} }