DocumentCode
2885052
Title
Polynomial transform computation of the 2-D DCT
Author
Duhamel, P. ; Guillemot, C.
Author_Institution
CNET/PAB/RPE, Issy-les-Moulineaux, France
fYear
1990
fDate
3-6 Apr 1990
Firstpage
1515
Abstract
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
Keywords
digital arithmetic; polynomials; transforms; 2-D DCT; additions; butterfly-based structure; discrete cosine transform; flowgraphs; multiplications; polynomial transform; Algorithm design and analysis; Arithmetic; Data compression; Discrete cosine transforms; Discrete transforms; Equations; Image coding; Image processing; Polynomials; Very large scale integration;
fLanguage
English
Publisher
ieee
Conference_Titel
Acoustics, Speech, and Signal Processing, 1990. ICASSP-90., 1990 International Conference on
Conference_Location
Albuquerque, NM
ISSN
1520-6149
Type
conf
DOI
10.1109/ICASSP.1990.115696
Filename
115696
Link To Document