Fast 2D-DCT implementations for VLIW processors


This paper analyzes various fast 2D-DCT algorithms regarding their suitability for VLIW processors. Operations for truncation or rounding which a re usually neglected in proposals for fast algorithms have also been taken into consideration. Loeffler's algorithm with parallel multiplications [l] was found to be most suitable due t o its parallel structure. 
DOI: 10.1109/MMSP.1999.793940


3 Figures and Tables