级联叠式变换的低内存实现

Low Memory Implementation of Hierarchical Lapped Transforms

本文提出了级联叠式变换(Hierarchical Lapped Transform,HLT)的一种低内存的实现算法。该算法的正、逆变换均具有低内存需求且该内存需求仅与所采用的HLT相关,而与待处理的信号长度无关。该算法产生的子带系数与HLT的全局变换方法产生的子带系数完全相同。实验表明,本文提出的HLT实现算法具有内存消耗低、扩展性良好的优点。

We propose a low-memory implementation technique of Hierarchical Lapped Transforms. This approach has the advantages of low memory requirement independent of the input signal length, and most of all, producing exactly the same subband coefficients as the conventional global transform that buffers the whole signal. The experiments show that the proposed algorithm has the advantages of low memory requirement and good scalability.