A fast 4*4 DCT algorithm for the recursive 2-D DCT

A Parallel Algorithm for 4×4 DCT

“…Similar work has been done in this direction [9] which can actually be included as one specific example in the proposed approach. Hence, the algorithm presented generalizes all the possible schemes in designing a fast algorithm of 2D DCT via 1D conversion.…”

“…[9]. The work described can actually be included as one specific example in the proposed algorithm, since all the various input grouping will end up with only four independent groups and the partition has the periodic feature as shown in Fig.…”

“…Section 4 develops the detailed design of a complete parallel algorithm for computing the 2D DCT. Conclusions and comparisons with other existing fast algorithms [9] are provided in Section 5.…”

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

“…Among them, by using a polynomial transform (PT), Duhamel and Guillemot [24] [27][28][29][30][31], matrix factorization or recursive computation [32][33][34][35][36][37], constant geometry algorithm [38,39], and Chebyshev polynomial [40]. Among them, Britanak and Rao [36] developed an efficient recursive 2-D DCT algorithm for a rectangular 2 m ×2 n block sizes.…”

A Fast 8 × 8 Pruned DCT Algorithm

“…The direct method works directly on lated from each one-dimensional DCT depends on the althe two-dimensional data sets and requires fewer lowed amount of pruning. The proposed algorithm does not multiplications and additions [2]. It was also shown require any bit reversal operations.…”