Fast algorithm for computing the forward and inverse MDCT in MPEG audio coding

Improved radix-3 decimation-in-frequency algorithm for the fast computation of forward and inverse MDCT

“…The comparison of the advantages and disadvantages of these MDCT-based algorithms with the DCT-based algorithms [5][6][7][8][9][10][11][12][13][14], we refer the readers to [15] and [16].…”

“…To solve this problem, Britanak [8][9][10][11], Lee [12], Cheng [13], and Truong [14] proposed various approaches based on the computation of lower order discrete cosine transform (DCT). Recently, Shu et al [15] developed a fast radix-3 decimation-in-Frequency (DIF) algorithm for computing the MDCT of a sequence with length N = 2u3m and the IMDCT of a sequence with length N = 4u3m.…”

A fast algorithm for the computation of 2-D forward and inverse MDCT

“…For the row-column method, we combine Lee's algorithm [4] algorithm [37]. For the row-column method, we still use the algorithm presented in [4] or [5] and Bi's algorithm [20] (1,4) x (1,5) x (1,6) x (1,7) x (2,0) x (2,1) x (2,2) x (2,3) x (2,4) x (2,5) x (2,6) x (2,7) x (3,0) x (3,1) x (3,2) x (3,3) x (3,4) x (3,5) x (3,6) x (3,7) x (4,0) x (4,1) x (4,2) x (4,…”

“…Recently, Truong et al [6] developed a fast algorithm for computing the M-point MDCT and IMDCT through M/2-point DCT. Among these approaches, the algorithms reported in [4], [5] and [6] are probably the most efficient for computing the MDCT in terms of the arithmetic complexity.…”

“…Recently, Truong et al [6] developed a fast algorithm for computing the M-point MDCT and IMDCT through M/2-point DCT. Among these approaches, the algorithms reported in [4], [5] and [6] are probably the most efficient for computing the MDCT in terms of the arithmetic complexity. However, the algorithm presented by Cho et al in [7], which does not contain recursive structure, seems to achieve a good balance between the arithmetic complexity and computational structure.…”