2D-DCT on FPGA by polynomial transformation in two-dimensions
Arturo Méndez-Pátiño, M.M. Peiro, F. Ballester, Guillermo Payá · 2004
A 2D discrete cosine transform implementation on FPGA, using polynomial transformation algorithm on two dimensions is presented. The precision and area results are reported to be compared with the classical row-column implementation. Advantages and drawbacks are commented. Since one dimension DCT is a basic block for the implementation of two dimensions, we first show two 1D-DCT implementations to be selected for use on 2D. A modification to the polynomial transform is also shown in order to get a normalized 2D-DCT. All the designs are synthesized and implemented on Xilinx Virtex FPGAs.