DocumentCode
2606201
Title
On the theoretical lower bound of the multiplicative complexity for DCT
Author
Chan, Yuk-Hee ; Siu, Wan-Chi
Author_Institution
Dept. of Electron. Eng., Hong Kong Polytech., Hong Kong
fYear
1993
fDate
3-6 May 1993
Firstpage
750
Abstract
A discussion of discrete cosine transforms (DCT) algorithms based on convolutions is presented. It is shown that these approaches can provide effective solutions to realize DCTs. They provide a theoretical lower bound on the number of multiplications required for the realization of DCTs. Some fast short-length DCT algorithms are derived from these approaches
Keywords
computational complexity; convolution; discrete cosine transforms; DCT; convolutions; discrete cosine transforms; lower bound; multiplicative complexity; short-length DCT algorithms; Convolution; Discrete cosine transforms;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1993., ISCAS '93, 1993 IEEE International Symposium on
Conference_Location
Chicago, IL
Print_ISBN
0-7803-1281-3
Type
conf
DOI
10.1109/ISCAS.1993.393830
Filename
393830
Link To Document