Polynomial transform computation of the 2-D DCT
P Duhamel, C Guillemot - International Conference on …, 1990 - ieeexplore.ieee.org
International Conference on Acoustics, Speech, and Signal Processing, 1990•ieeexplore.ieee.org
A 2-D DCT (discrete cosine transform) algorithm based on a direct polynomial approach is
presented. The resulting algorithm reduces the number of both multiplications and additions
compared to previous algorithms. It is shown that, although being mathematically involved, it
possesses a clean, butterfly-based structure. Tables comparing the number of operations
are provided, as well as flowgraphs.<>
presented. The resulting algorithm reduces the number of both multiplications and additions
compared to previous algorithms. It is shown that, although being mathematically involved, it
possesses a clean, butterfly-based structure. Tables comparing the number of operations
are provided, as well as flowgraphs.<>
A 2-D DCT (discrete cosine transform) algorithm based on a direct polynomial approach is presented. The resulting algorithm reduces the number of both multiplications and additions compared to previous algorithms. It is shown that, although being mathematically involved, it possesses a clean, butterfly-based structure. Tables comparing the number of operations are provided, as well as flowgraphs.< >
ieeexplore.ieee.org
以上显示的是最相近的搜索结果。 查看全部搜索结果