Approximation of discrete cosine transform (DCT) is useful for reducing its computational
complexity without significant impact on its coding performance. Most of the existing
algorithms for approximation of the DCT target only the DCT of small transform lengths, and
some of them are non-orthogonal. This paper presents a generalized recursive algorithm to
obtain orthogonal approximation of DCT where an approximate DCT of length N could be
derived from a pair of DCTs of length (N/2) at the cost of N additions for input preprocessing …

This proposed paper presents architecture of generalized recursive function to generate
approximation of orthogonal function DCT with an approximate length N could be derived
from a pair of DCTs of length (N/2) at the cost of N additions for input preprocessing.
Approximation of DCT is useful for reducing its computational complexity without impact on
its coding performance. Most of the existing design for approximation of the DCT target only
the small transform lengths DCT, and some of them are non-orthogonal. Proposed method is …