By Topic

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

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

3 Author(s)
Guoan Bi ; Nanyang Technol. Univ., Singapore ; Yingtuo Ju ; Xiumei Li

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 and real multiplications. When a=3,4, and 8, comparisons show that the computational complexities required by the proposed algorithms are less than 60% of those needed by the fast algorithms for complex-valued sequences.

Published in:

Signal Processing, IEEE Transactions on  (Volume:56 ,  Issue: 5 )