DocumentCode
2754390
Title
Realization of FPGA-based two dimensional discrete cosine transform
Author
Salama, A.E. ; Mashali, S.
fYear
1999
fDate
23-25 Feb 1999
Abstract
A new algorithm for the computation of a 2-D DCT is presented, the computational complexity as measured in terms of the number of multiplications and additions is kept to a minimum, the algorithm is amenable to implementation using field programmable gate arrays (FPGAs). An example of a 4×4 2-D DCT is presented, and its performance is evaluated
Keywords
computational complexity; digital arithmetic; discrete cosine transforms; field programmable gate arrays; image coding; speech coding; transform coding; FPGA-based 2D DCT; additions; algorithm; computational complexity; field programmable gate arrays; image coding; multiplications; performance evaluation; speech coding; two dimensional discrete cosine transform; Computational complexity; Convolution; Convolutional codes; Discrete cosine transforms; Discrete transforms; Field programmable gate arrays; Hardware; Karhunen-Loeve transforms; Pipeline processing; Signal processing algorithms;
fLanguage
English
Publisher
ieee
Conference_Titel
Radio Science Conference, 1999. NRSC '99. Proceedings of the Sixteenth National
Conference_Location
Cairo
Print_ISBN
977-5031-62-1
Type
conf
DOI
10.1109/NRSC.1999.760887
Filename
760887
Link To Document