DocumentCode
3583676
Title
Fast computation of DCT by statistic adapted look-up tables
Author
Kutka, Robert
Author_Institution
Corporate Technol., Inf. & Commun., Siemens AG, Munich, Germany
Volume
1
fYear
2002
fDate
6/24/1905 12:00:00 AM
Firstpage
781
Abstract
A fast algorithm to compute the discrete cosine transform (DCT) for video compression is presented. We replace the multiplications, which are the most time-consuming steps, by look-up table accesses. The problem of very long and memory-consuming tables is solved by reducing the tables to significant parts. This technique can be applied to other transformations, such as FFT or wavelets. The algorithm described computes 24% faster than Wang´s (1995) DCT on a Pentium processor.
Keywords
data compression; discrete cosine transforms; statistical analysis; transform coding; video coding; DCT; FFT; Pentium processor; VLSI; data compression; discrete cosine transform; fast algorithm; statistic adapted look-up tables; video compression; wavelets; Cellular phones; Communications technology; Compression algorithms; Discrete cosine transforms; Hardware; Mobile communication; Statistics; Table lookup; Very large scale integration; Video compression;
fLanguage
English
Publisher
ieee
Conference_Titel
Multimedia and Expo, 2002. ICME '02. Proceedings. 2002 IEEE International Conference on
Print_ISBN
0-7803-7304-9
Type
conf
DOI
10.1109/ICME.2002.1035898
Filename
1035898
Link To Document