A new fast algorithm for the type-II two-dimensional (2-D) discrete cosine transform (DCT) is pre... more A new fast algorithm for the type-II two-dimensional (2-D) discrete cosine transform (DCT) is presented. It shows that the 2-D DCT can be decomposed into cosine-cosine, cosine-sine, sine-cosine, and sine-sine sequences that can be further decomposed into a number of similar sequences. Compared with other reported algorithms, the proposed one achieves savings on the number of arithmetic operations and has a recursive computational structure that leads to a simplification of the input/output indexing process. Furthermore, the new algorithm supports transform sizes (1 2) (2 2), where 1 and 2 are arbitrarily odd integers, which provides a wider range of choices on transform sizes for various applications.
Fast recursive algorithms for 2-D discrete cosine transform
Signal Processing, 2000
A new algorithm for computation of two-dimensional (2-D) type-III discrete cosine transform is pr... more A new algorithm for computation of two-dimensional (2-D) type-III discrete cosine transform is presented. The algorithm is particularly suited to block size (p1∗2m) by (p2∗2n), where p1 and p2 are odd integers, and m and n are non-negative integers. It shows that the 2-D type-III DCT can be decomposed into cosine–cosine, cosine–sine, sine–cosine, sine–sine sequences, which can be further decomposed
A new fast algorithm for the type-II two-dimensional (2-D) discrete cosine transform (DCT) is pre... more A new fast algorithm for the type-II two-dimensional (2-D) discrete cosine transform (DCT) is presented. It shows that the 2-D DCT can be decomposed into cosine-cosine, cosine-sine, sine-cosine, and sine-sine sequences that can be further decomposed into a number of similar sequences. Compared with other reported algorithms, the proposed one achieves savings on the number of arithmetic operations and has a recursive computational structure that leads to a simplification of the input/output indexing process. Furthermore, the new algorithm supports transform sizes (1 2) (2 2), where 1 and 2 are arbitrarily odd integers, which provides a wider range of choices on transform sizes for various applications.
Fast recursive algorithms for 2-D discrete cosine transform
Signal Processing, 2000
A new algorithm for computation of two-dimensional (2-D) type-III discrete cosine transform is pr... more A new algorithm for computation of two-dimensional (2-D) type-III discrete cosine transform is presented. The algorithm is particularly suited to block size (p1∗2m) by (p2∗2n), where p1 and p2 are odd integers, and m and n are non-negative integers. It shows that the 2-D type-III DCT can be decomposed into cosine–cosine, cosine–sine, sine–cosine, sine–sine sequences, which can be further decomposed
Uploads
Papers by Teng Chork Tan