The fast computation of dct in JPEG algorithm
Апстракт
In this paper two new parallel algorithms are proposed for the computation of discrete cosine transform (DCT) in JPEG algorithm on 32-bit computers. These algorithms are twice as fast as the fastest known DCT algorithm published to date. This is possible because 16-bit wordlength is sufficient for the computation of DCT, so the arithmetic unit is used to perform simultaneously two 16-bit operations. All operations in the DCT algorithm, that are not suitable for parallel processing, are substituted by equivalent operations.
Извор:
European Signal Processing Conference, 1998, 1998-JanuaryИздавач:
- European Signal Processing Conference, EUSIPCO
Колекције
Институција/група
Mašinski fakultetTY - CONF AU - Popović, M. AU - Stojić, Tomislav PY - 1998 UR - https://machinery.mas.bg.ac.rs/handle/123456789/160 AB - In this paper two new parallel algorithms are proposed for the computation of discrete cosine transform (DCT) in JPEG algorithm on 32-bit computers. These algorithms are twice as fast as the fastest known DCT algorithm published to date. This is possible because 16-bit wordlength is sufficient for the computation of DCT, so the arithmetic unit is used to perform simultaneously two 16-bit operations. All operations in the DCT algorithm, that are not suitable for parallel processing, are substituted by equivalent operations. PB - European Signal Processing Conference, EUSIPCO C3 - European Signal Processing Conference T1 - The fast computation of dct in JPEG algorithm VL - 1998-January UR - https://hdl.handle.net/21.15107/rcub_machinery_160 ER -
@conference{ author = "Popović, M. and Stojić, Tomislav", year = "1998", abstract = "In this paper two new parallel algorithms are proposed for the computation of discrete cosine transform (DCT) in JPEG algorithm on 32-bit computers. These algorithms are twice as fast as the fastest known DCT algorithm published to date. This is possible because 16-bit wordlength is sufficient for the computation of DCT, so the arithmetic unit is used to perform simultaneously two 16-bit operations. All operations in the DCT algorithm, that are not suitable for parallel processing, are substituted by equivalent operations.", publisher = "European Signal Processing Conference, EUSIPCO", journal = "European Signal Processing Conference", title = "The fast computation of dct in JPEG algorithm", volume = "1998-January", url = "https://hdl.handle.net/21.15107/rcub_machinery_160" }
Popović, M.,& Stojić, T.. (1998). The fast computation of dct in JPEG algorithm. in European Signal Processing Conference European Signal Processing Conference, EUSIPCO., 1998-January. https://hdl.handle.net/21.15107/rcub_machinery_160
Popović M, Stojić T. The fast computation of dct in JPEG algorithm. in European Signal Processing Conference. 1998;1998-January. https://hdl.handle.net/21.15107/rcub_machinery_160 .
Popović, M., Stojić, Tomislav, "The fast computation of dct in JPEG algorithm" in European Signal Processing Conference, 1998-January (1998), https://hdl.handle.net/21.15107/rcub_machinery_160 .