TY - JFULL
AU - V.K.Ananthashayana and Geetha.K.S
PY - 2009/9/
TI - A Novel Recursive Multiplierless Algorithm for 2-D DCT
T2 - International Journal of Mathematical and Computational Sciences
SP - 585
EP - 590
VL - 3
SN - 1307-6892
UR - https://publications.waset.org/pdf/2219
PU - World Academy of Science, Engineering and Technology
NX - Open Science Index 32, 2009
N2 - In this paper, a recursive algorithm for the
computation of 2-D DCT using Ramanujan Numbers is proposed.
With this algorithm, the floating-point 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 N-N+
additions and
N N
2 log
2 shifts which is
very much less complex when compared to other recent multiplierless
algorithms.
ER -