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.