Title :
Fast computation of discrete SLTF transform
Author_Institution :
Comput. Res. Res. Inst., KFUPM, Saudi Arabia
fDate :
6/23/1905 12:00:00 AM
Abstract :
A fast algorithm for SLTF analysis and SLTF synthesis computations is presented. The proposed algorithm exploits the special structure of the SLTF transformation matrix. The algorithm requires K (2 log2 M-1/2) multiplications and K (4 log2 M-3/2) additions for calculating the biorthogonal function and K (log2 K-1/2 log2 N) multiplications and K (2 log2 K-log2 N-3) additions for both the analysis and the synthesis transform computations where K is the signal length and M and N are arbitrary numbers such that MN=K
Keywords :
computational complexity; discrete transforms; matrix algebra; signal sampling; time-frequency analysis; SLTF analysis; SLTF synthesis; SLTF transformation matrix; analysis samples; biorthogonal function; computational complexity; discrete SLTF transform; fast computation; finite extent discrete signal; signal length; time-frequency transforms; Algorithm design and analysis; Discrete transforms; Equations; Filtering; Iterative methods; Minerals; Signal analysis; Signal synthesis; Stability; Time frequency analysis;
Conference_Titel :
Statistical Signal Processing, 2001. Proceedings of the 11th IEEE Signal Processing Workshop on
Print_ISBN :
0-7803-7011-2
DOI :
10.1109/SSP.2001.955286
