The fast computation of dct in JPEG algorithm

dc.creator	Popović, M.
dc.creator	Stojić, Tomislav
dc.date.accessioned	2022-09-19T15:21:52Z
dc.date.available	2022-09-19T15:21:52Z
dc.date.issued	1998
dc.identifier.issn	2219-5491
dc.identifier.uri	https://machinery.mas.bg.ac.rs/handle/123456789/160
dc.description.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.	en
dc.publisher	European Signal Processing Conference, EUSIPCO
dc.rights	restrictedAccess
dc.source	European Signal Processing Conference
dc.title	The fast computation of dct in JPEG algorithm	en
dc.type	conferenceObject
dc.rights.license	ARR
dc.citation.other	1998-January: -
dc.citation.rank	M33
dc.citation.volume	1998-January
dc.identifier.rcub	https://hdl.handle.net/21.15107/rcub_machinery_160
dc.identifier.scopus	2-s2.0-85019634859
dc.type.version	publishedVersion

Dokumenti

Datoteke	Veličina	Format	Pregled
Uz ovaj zapis nema datoteka.