This paper analyzes various fast 2D-DCT algorithms regarding their suitability for VLIW processors. Operations for truncation or rounding which are usually neglected in proposals for fast algorithms have also been taken into consideration. Loeffler's algorithm with parallel multiplications was found to be most suitable due to its parallel structure
|Translated title of the contribution||Fast 2D-DCT implementations for VLIW processors|
|Title of host publication||IEEE Multimedia Signal Processing Workshop|
|Publisher||Institute of Electrical and Electronics Engineers (IEEE)|
|Pages||655 - 660|
|Publication status||Published - Sep 1999|
|Event||3rd IEEE Workshop on Multimedia Signal Processing - Copenhagen, Denmark|
Duration: 1 Sep 1999 → …
|Conference||3rd IEEE Workshop on Multimedia Signal Processing|
|Period||1/09/99 → …|
Bibliographical noteRose publication type: Conference contribution
This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Bristol's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to firstname.lastname@example.org.
By choosing to view this document, you agree to all provisions of the copyright laws protecting it.