Fast 2D-DCT implementations for VLIW processors
Oliver P. Sohm, David Bull, C.N. Canagarajah · 1999
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.