10 January 1997 DCT computation with minimal average number of operations
Author Affiliations +
Abstract
The discrete cosine transform (DCT) is widely used in all transform-based image and video compression standards due to its well-known decorrelation and energy compaction properties for typical images. Many fast algorithms available for the DCT optimize various parameters such as additions and multiplications but they are input independent and thus require the same number of operations for any inputs. In this paper we study the benefits of input- dependent algorithms for the DCT which are aimed at minimizing the average computation time by taking advantage of the sparseness of the input data. Here, we concentrate on the inverse DCT (IDCT) part since typical input blocks will contain a substantial number of zeros. We show how to construct an IDCT algorithm based on the statistics of the input data, which are used to optimize the algorithm for the average case. We show how, for a given input and a correct model of the complexity of the various operations, we can achieve the fastest average performance.
© (1997) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Krisda Lengwehasatit, Krisda Lengwehasatit, Antonio Ortega, Antonio Ortega, } "DCT computation with minimal average number of operations", Proc. SPIE 3024, Visual Communications and Image Processing '97, (10 January 1997); doi: 10.1117/12.263291; https://doi.org/10.1117/12.263291
PROCEEDINGS
12 PAGES


SHARE
Back to Top