Skip to Main content Skip to Navigation
Conference papers

Improved Radix-3 Decimation-in-Frequency Algorithm for the Fast Computation of Forward and Inverse MDCT

Abstract : 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.
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download

https://www.hal.inserm.fr/inserm-00535839
Contributor : Lotfi Senhadji <>
Submitted on : Monday, November 15, 2010 - 5:22:42 PM
Last modification on : Friday, July 5, 2019 - 10:16:02 AM
Long-term archiving on: : Wednesday, February 16, 2011 - 2:38:08 AM

File

ICALIP_268_.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inserm-00535839, version 1

Collections

Citation

Jiasong Wu, Lu Wang, Lotfi Senhadji, Huazhong Shu. Improved Radix-3 Decimation-in-Frequency Algorithm for the Fast Computation of Forward and Inverse MDCT. The 2nd IEEE/IET International Conference on Audio, Language and Image Processing (ICALIP), Nov 2010, Shanghai, China. pp.694-699. ⟨inserm-00535839⟩

Share

Metrics

Record views

400

Files downloads

3306