Fast Algorithms for Polynomial Time-Frequency Transforms of Real-Valued Sequences

@article{Bi2008FastAF,
  title={Fast Algorithms for Polynomial Time-Frequency Transforms of Real-Valued Sequences},
  author={Guoan Bi and Yingtuo Ju and Xiumei Li},
  journal={IEEE Transactions on Signal Processing},
  year={2008},
  volume={56},
  pages={1905-1915}
}
This paper presents fast algorithms for computing the polynomial time-frequency transform that deals with a real-valued sequence of length-apb, where a, b and p are positive integers. In particular, it shows that the polynomial time-frequency transform has a conjugate symmetric property, similar to that of the discrete Fourier transform, if the input sequence is real-valued. The computational complexities needed by these proposed algorithms are analyzed in terms of the numbers of real additions… CONTINUE READING