 |
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.
Cited literature [13 references]
https://www.hal.inserm.fr/inserm-00535839
Contributor : Lotfi Senhadji Connect in order to contact the contributor
Submitted on : Monday, November 15, 2010 - 5:22:42 PM
Last modification on : Wednesday, March 9, 2022 - 9:16:03 AM
Long-term archiving on: : Wednesday, February 16, 2011 - 2:38:08 AM
Contributor : Lotfi Senhadji Connect in order to contact the contributor
Submitted on : Monday, November 15, 2010 - 5:22:42 PM
Last modification on : Wednesday, March 9, 2022 - 9:16:03 AM
Long-term archiving on: : Wednesday, February 16, 2011 - 2:38:08 AM
File
ICALIP_268_.pdf
Files produced by the author(s)