Fast computation of DCT by statistic adapted look-up tables
Proceedings. IEEE International Conference on Multimedia and Expo - Tập 1 - Trang 781-784 vol.1
Tóm tắt
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.
Từ khóa
#Discrete cosine transforms #Statistics #Video compression #Table lookup #Hardware #Mobile communication #Communications technology #Very large scale integration #Cellular phones #Compression algorithmsTài liệu tham khảo
arai, 1988, A fast dct-sq scheme for images, Trans of the IEEE, e71, 1095
10.1016/0923-5965(92)90025-B
10.1109/MWSCAS.1990.140896
10.1109/76.388068
10.1049/ip-vis:19952008
10.1109/30.273656
10.1109/78.150010
10.1049/ip-vis:19952092
10.1109/82.127302
griiger, 1995, MPEG-1 low-cost encoder solution, SPIE, 2451, 41
10.1016/0923-5965(94)00047-6