Improved Radix-3 Decimation-in-Frequency Algorithm for the Fast Computation of Forward and Inverse MDCT
Shu et al. recently proposed an efficient radix-3 decimation-in-Frequency (DIF) algorithm for the fast computation of forward and inverse modified discrete cosine transform (MDCT). Their algorithm decomposes the MDCT of a sequence with length N=2×3m and the IMDCT of a sequence with length N=4×3m into three N/3-point MDCTs and IMDCTs, respectively. In this paper, we present a refinement of their approach. Comparison with Shu’s algorithm shows that the number of arithmetic operations can be reduced from 17.5% to 20.5% for MDCT and from 23.1% to 27.9% for IMDCT when N is varying from 36 to 324.
Jiasong Wu Lu Wang Lotfi Senhadji Huazhong Shu
LIST, Southeast University, 2 Sipailou, 210096, Nanjing, China;INSERM, U642, Rennes, F-35000, France LIST, Southeast University, 2 Sipailou, 210096, Nanjing, China;Centre de Recherche en Information Bi INSERM, U642, Rennes, F-35000, France;LTSI, Université de Rennes 1, Campus Beaulieu, Rennes, F-35042
国际会议
上海
英文
694-699
2010-10-20(万方平台首次上网日期,不代表论文的发表时间)