Fast algorithm for the modulated complex lapped transform
Fast algorithm for the modulated complex lapped transform
复制标题
DOI：
10.1109/lsp.2002.806700
复制
发表时间：
2003-01
影响因子：
3.9
通讯作者：
Henrique S. Malvar
中科院分区：
文献类型：
--
作者：
Henrique S. Malvar
提出了一种快速计算调制复重叠变换（MCLT）的新算法。对于长度为M的MCLT，该算法基于计算长度为2M的快速傅立叶变换加上M个蝴蝶状阶段，而没有数据混洗。与以前的算法相比，这减少了计算MCLT所需的操作和存储器访问的数量。与原始的基于类型4离散余弦变换的算法相比，新算法的实现导致执行速度提高25%。
A new algorithm for fast computation of the modulated complex lapped transform (MCLT) is presented. For a length-M MCLT, the algorithm is based on computing a length-2M fast Fourier transform plus M butterfly-like stages, without data shuffling. That reduces the number of operations and memory accesses needed to compute the MCLT when compared to previous algorithms. Compared to the original type-4 discrete-cosine-transform-based algorithm, an implementation of the new algorithm leads to 25% faster execution.