期刊文献+

一种新的基于矩的改进离散余弦变换及其反变换快速算法

Novel approach for fast computation of MDCT and IMDCT based on moments
下载PDF
导出
摘要 为了提高离散余弦变换(MDCT)及其反变换(IMDCT)的计算效率,提出一种新的基于一维离散矩的快速算法.首先把MDCT和IMDCT的核函数映射到另外一个集合进行合并化简,再用三角函数泰勒级数展开的方法,将MDCT和IMDCT的计算用有限项的一维离散矩的线性加权和近似.一维离散矩的快速计算可以采用p+1维的矢量加法结构进行,用加法运算代替乘法运算,有效地减少了乘法的运算量.该算法的乘法计算量仅为O(Nlog2N/log2log2N),少于通常快速算法所需的O(Nlog2N),可以有效地降低运算时间.理论分析和实验结果都表明:用一维矩近似的方法计算MDCT和IMDCT的结果精度很高,运行速度比较快,能够很好地满足实际计算的要求. For fast computation of the modified discrete cosine transform (MDCT) and its inverse MDCT (IMDCT), a novel approach based on one-dimensional discrete moments is proposed. By using the Taylor expansion of trigonometric function, both MDCT and IMDCT are approximated by a linear sum of a finite sequence of one-dimensional discrete moments after the kernel modular mapping and simplification. Then one-dimensional discrete moments can be calculated by an addition map of p + 1 dimensional vector, which replaces most multiplication with simple additions. The number of multiplicative operations in the method is only O(Nlog2N/log2log2N) that is superior to O(Nlog2N) needed in the existing fast algorithms, and thus the operation can be speeded up. Theoretical analyses and experimental results show that the proposed method ensures high accuracy and fast computation, and it can satisfy the accuracy requirements of most applications.
出处 《东南大学学报(自然科学版)》 EI CAS CSCD 北大核心 2009年第4期747-752,共6页 Journal of Southeast University:Natural Science Edition
基金 国家自然科学基金资助项目(60873048) 江苏省自然科学基金资助项目(BK2008279)
关键词 MDCT IMDCT 快速算法 moments modified discrete cosine transform (MDCT) inverse modified discrete cosine transform (IMDCT) fast algorithm
  • 相关文献

参考文献11

  • 1Princen J P, Bradley A B. Analysis/synthesis filter bank design based on time domain aliasing cancellation [ J ]. IEEE Trans Acoust, Speech, Signal Process, 1986,34 ( 5 ) : 1153 - 1161.
  • 2Princen J P, Johnson A W, Bradley A B. Subband/transform coding using filter bank designs based on time domain aliasing cancellation [ C ]//Proc IEEE ICASSP. Dallas, TX, USA, 1987 : 2161 - 2164.
  • 3Shu H Z, Bao X D, Luo L. Radix-3 algorithm for the fast computation of forward and inverse MDCT [J].IEEE Signal Process Lett,2007,14 (2) : 93 - 96.
  • 4Britanak V. A new fast algorithm for the unified forward and inverse MDCT/MDST computation [ J ]. Signal Process, 2002,82 ( 3 ) : 433 - 459.
  • 5Britanak V. An efficient computing of oddly stacked MDCT/MDST via evenly stacked MDCT/MDST and vice versa[J].Signal Process,2005,85( 7 ) : 1353 - 1374.
  • 6Lee S W. Improved algorithm for efficient computation of the forward and backward MDCT in MPEG audio coder [ J ]. IEEE Trans Circuits Syst- Ⅱ: Analog Digital Signal Processing,2001,48 ( 10 ) : 990 -994.
  • 7Wu J S, Shu H, Senhadji L, et al. Mixed-radix algorithm for the computation of forward and inverse MDCTs[J].IEEE Trans Circuits Syst-Ⅰ: Regular Papers,2009,56(4) :784-794.
  • 8Chan F H Y, Lam F K, Liu J G. An all adder systolic structure for fast computation of moments [ J ]. J VLSI Signal Process,1996,12(2) : 159 - 175.
  • 9Liu J G,Liu Y Z,Wang G Y. Fast discrete W transform via computation of moments[J].IEEE Trans Signal Processing, 2005,53(4) : 654 - 659.
  • 10Liu J G,Li H F,Chan F H,et al. Fast discrete cosine transform via computation of moments[J]. J VLSI Signal Process, 1998,19(3): 257-268.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部