New Fast Algorithm for Modulated Complex Lapped Transform with Arbitrary Windowing Function
一种任意窗函数的复数调制重叠变换的快速算法

A new algorithm for efficient computation of the Modulated Complex Lapped Transform (MCLT) with arbitrary windowing function is presented. For the MCLT of length-2M input data sequence, the proposed method is based on computing a length-2M type-II generalized discrete Hartley transform. Comparison with existing algorithms shows that the proposed method achieves the minimal number of arithmetic operations.