V.K.Ananthashayana and Geetha.K.S
A Novel Recursive Multiplierless Algorithm for 2D DCT
586 - 590
2009
3
8
International Journal of Mathematical and Computational Sciences
https://publications.waset.org/pdf/2219
https://publications.waset.org/vol/32
World Academy of Science, Engineering and Technology
In this paper, a recursive algorithm for the
computation of 2D DCT using Ramanujan Numbers is proposed.
With this algorithm, the floatingpoint multiplication is completely
eliminated and hence the multiplierless algorithm can be
implemented using shifts and additions only. The orthogonality of
the recursive kernel is well maintained through matrix factorization
to reduce the computational complexity. The inherent parallel
structure yields simpler programming and hardware implementation
and provides
log 1
2
3
2 N NN
additions and
N N
2 log
2 shifts which is
very much less complex when compared to other recent multiplierless
algorithms.
Open Science Index 32, 2009