Skip to Main Content
This work presents an efficient low-complexity method to compute a 2-D inverse transform flexibly adapted to its end-of-block (EOB) point and corner coefficients. First, the EOB point is obtained from a bitstream or derived from the other parameters. Second, the values of bottom-left and/or top-right corner coefficients before an EOB point are verified as zero or not. Third, the operational mode, based on the EOB point and corner coefficient value(s), determines the reduced dimensional sizes of 1-D inverse transforms in the row and column. Additionally, the computational order of row-after-column or column-after-row is decided to minimize computational complexity. Finally, a 2-D inverse transform at the determined operational mode is computed using simplified 1-D inverse transforms in a row-by-row and column-by-column manner. Particularly, how to implement cycle-efficient structures of inverse transforms in an embedded programmable platform is investigated. Simulation results demonstrate that the proposed method has less computational complexity than conventional methods when executing 2-D inverse transforms at MPEG-2 and H.264/AVC video streams. Notably, the proposed method can reduce computational time required by conventional methods by 14.6%-92.9% at a fairly increased code size. Therefore, the proposed method is very suitable for various applications demanding low-complexity computations of inverse transforms.