Fast computation of discrete SLTF transform
O.A. Ahmed · 2002
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 log/sub 2/ M-1/2) multiplications and K (4 log/sub 2/ M-3/2) additions for calculating the biorthogonal function and K (log/sub 2/ K-1/2 log/sub 2/ N) multiplications and K (2 log/sub 2/ K-log/sub 2/ 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.