1. IEEE Signal Processing Magazine
2. Signal Processing Digital Library*
3. Inside Signal Processing Newsletter
4. SPS Resource Center
5. Career advancement & recognition
6. Discounts on conferences and publications
7. Professional networking
8. Communities for students, young professionals, and women
9. Volunteer opportunities
10. Coming soon! PDH/CEU credits
Click here to learn more.
10 years of news and resources for members of the IEEE Signal Processing Society
The Fast S-Transform (FST) is a new algorithm for solving the S-Transform with significantly reduced time and complexity. Software packages implementing the FST are now available for download at Sourceforge. The FST is currently available for both C and Python.
Developed by Drs. Robb Brown, Richard Frayne, and Louis Lauzon of the University of Calgary, the FST software calculates the S-Transform with O(NlogN) complexity and requires only O(N) storage space. It will transform in less than a second data sets that previously would have required over 3 days. The FST was originally published in the paper “A General Description of Linear Time-Frequency Transforms and Formulation of a Fast, Invertible Transform the Samples the Continuous S-Transform Spectrum Nonredundantly”, IEEE Transactions on Signal Processing, vol. 58, pp. 281-290, Jan 2010.
|Call for Nominations: IEEE Technical Field Awards||15 January 2021|
|Call for Officer Nominations: President-Elect and Vice President-Technical Directions||19 February 2021|
|Nominate an IEEE Fellow today!||1 March 2021|
|Call for Nominations for Editor-in-Chief||5 April 2021|
|Call for Nominations: Chief Editor, SigPort and Chief Editor, Resource Center||5 April 2021|
© Copyright 2021 IEEE – All rights reserved. Use of this website signifies your agreement to the IEEE Terms and Conditions.
A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.