Share Email Print

Proceedings Paper

Low complexity 1D IDCT for 16-bit parallel architectures
Author(s): Lazar Bivolarski
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

This paper shows that using the Loeffler, Ligtenberg, and Moschytz factorization of 8-point IDCT [2] one-dimensional (1-D) algorithm as a fast approximation of the Discrete Cosine Transform (DCT) and using only 16 bit numbers, it is possible to create in an IEEE 1180-1990 compliant and multiplierless algorithm with low computational complexity. This algorithm as characterized by its structure is efficiently implemented on parallel high performance architectures as well as due to its low complexity is sufficient for wide range of other architectures. Additional constraint on this work was the requirement of compliance with the existing MPEG standards. The hardware implementation complexity and low resources where also part of the design criteria for this algorithm. This implementation is also compliant with the precision requirements described in MPEG IDCT precision specification ISO/IEC 23002-1. Complexity analysis is performed as an extension to the simple measure of shifts and adds for the multiplierless algorithm as additional operations are included in the complexity measure to better describe the actual transform implementation complexity.

Paper Details

Date Published: 8 October 2007
PDF: 8 pages
Proc. SPIE 6696, Applications of Digital Image Processing XXX, 669619 (8 October 2007); doi: 10.1117/12.740235
Show Author Affiliations
Lazar Bivolarski, BrightScale Inc. (United States)

Published in SPIE Proceedings Vol. 6696:
Applications of Digital Image Processing XXX
Andrew G. Tescher, Editor(s)

© SPIE. Terms of Use
Back to Top