Académique Documents
Professionnel Documents
Culture Documents
International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering Vol:3, No:8, 2009
International Science Index, Mathematical and Computational Sciences Vol:3, No:8, 2009 waset.org/Publication/2219
N log2 N N +1
log 2 N
and provides 2
additions and 2
shifts which is
very much less complex when compared to other recent multiplierless
algorithms.
KeywordsDCT, Multilplerless,
Recursive.
Ramanujan
Number,
I. INTRODUCTION
log
III
As per our interaction with Bruce Berndt & N.Bhatnagar, it is known
that Bhatnagar presented Ramanujan Number of order-1 & order-2.
586
scholar.waset.org/1999.7/2219
TABLE I
RAMANUJAN NUMBER OF ORDER-2
(l, m)
(l, m)
0,2
1,2
4,5
5
8
67
3.125
3.0
3.140
2
a
(a) =
where l1 ( a ) = 2
l1 ( a )
(1)
NUMBER
[]
International Science Index, Mathematical and Computational Sciences Vol:3, No:8, 2009 waset.org/Publication/2219
We
1 (2) = 22 ,
and 1 (2) = [11001.001000.......] = 11001 . i.e., 1 (2)
is equal to 25. Likewise 1 (4) =101. Thus the right shifts of
(2)
2
2 ( l , m ) =
2 i ( l , m )
for i = 1, 2
(3)
21 ( l , m ) = 2 l + 2 m for m > l 0
(4)
22 ( l , m ) = 2l 2 m for (m 1) > l 0
(5)
21 ( 3,5) = 40 21 (1,3) = 10
4.872 10-6
5.42 10-4
6.89 10-6
1
= 1 ( a ) ( a ) = (1+ )
2
Upper bound of
Error
(6)
approximate
as
x = 2 N . We can then
2
4
approximate cn s by zn ( ) , where = x 2 x 4! . If N
= 2l + 2 m .
Thus,
t0 ( ) = 1
t1 (1) = 1 ,
(7)
tn +1 ( ) = 2 (1 ) tn ( ) tn 1 ( )
It can be observed the above recursive equation are closely
related to Chebyshev polynomials of the first kind and
thus cn s are computed using just shift and addition
operations.
Q N 0
[Q N ] = [A][. B ]. 2
0 QN
. D]
.[C ][
(8)
where [A], [B], [C] & [D] are permutation matrices, integer
matrix used for decomposing the DCT kernel.
By applying the transforms of inverse and transposition to
both sides of equation (1) we get
[QN ]
1T
QN 1T 0
1T
1T
= [ A] .[ B] . 2
1T
0 QN
1T
1T
.[C] .[ D]
(9)
587
scholar.waset.org/1999.7/2219
[QN ]
1T
= [ A]
1T
.[ B]
1T
QN 0
1T
1T
. 2
.[C] .[ D]
0 QN
(10)
International Science Index, Mathematical and Computational Sciences Vol:3, No:8, 2009 waset.org/Publication/2219
2
C (k ) = k
N
( 2n + 1)
x(n) cos k
2N
n =0
(11)
[T ] = diag cos ( m ) , m =
2 ( 2 m + 1) 2
2
N
m = 0,1,....M 1
N being a Ramanujan Number, the matrix [T] could then be
represented as
[T ] = diag ( 2l
m1
+ 2lm 2 )
where
for k = 0
otherwise
PL(log N1)
1 1 1 1
b c -c -b
A4 =
a -a -a a
c -b b -c
Where a = 1
x = [ x1 ,, x2 ,....xN 1 , xN ] .
N 1
for k=0,1,2,N-1
1
k = 2
1
and
(12)
(P
L(log2 N1)
( PL1)4
...
N 2N 0
( PL1)4
where
1 0 0 0
0 1 0 0
0 0 0
0 0 0 1
PL (log 2 N 1) =
N
0 0 0 0
0 0 0 1
0 0 0
0 1 0 0
AN = [ PL ] .[CN ]
(13)
0
0
0 0 0
0 0 0
0 0 0
2 0 0
0 0
0 0 2 N
0 0
0 0
0
0
1
0
0
0
and
C N
[C N ] = [ P1 ]. 2
0
Where
0
I
.
C N 0
0
. [ P2 ]
T
for ex.
(14)
[ PL ]4 = [ PL1 ]4
1 0
0 1
=
0 0
0 1
x = x 1 , x N , x 2 , x N , ... x N , x N
+1
+2
2
2
2
588
scholar.waset.org/1999.7/2219
0 0
0 0
1 0
0 2
(15)
1
0
0
[ PL ]8 =[ PL2 ]8 [ PL1]8 =
0
0
0
0
1
0
0
0
0
0
1
0
0
1
0
0
0
1
0
0
0
0
1
0
1
0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
2
0
0
0
0
0
0
0
0
2
0
0 1
0 0
0 0
0 0
.
0 0
0 0
0 0
2 0
0
1
0
0
0
0
0
1
0
0
1
0
0
0
1
0
0
0
0
1
0
1
0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
2
0
0
0
0
0
0
0
0
2
0
0
0
0
0
0
0
0
induction,
we
have A = N log N N + 1 .
2N
2
So,
AN = A1 N + A2 N =
3N
log 2 N N + 1 .
2
VI. SIMULATION RESULTS
'
TABLE II
International Science Index, Mathematical and Computational Sciences Vol:3, No:8, 2009 waset.org/Publication/2219
A. Computational Complexity
Operations
(i) Multiplications
The Multiplication operations for the new DCT algorithm
could be derived from two sections: the recursive kernel and
the transformation matrix T.
The transformation matrix involves computation of cosine
values, which require floating-point multiplications. Use of
Ramanujan Numbers eliminates this requirement and computes
the cosine values through shift and additions only. Thus, for
an N length sequence, we need N/2 shifts.
For the N-length sequence, let the number of multiplicative
operation with the recursive kernel be represented as MN. The
basic 2X2 kernel involves 2 shift operations. Thus, from
C N
2
equation (13) the number of shifts for
0
2M
N
2
is
CN
Multiplications
Additions
Lifting steps
[ ]N be A 2 N
the PL
VII. CONCLUSION
This paper discusses the novel technique of computing 2-D
DCT in the recursive structure using the Ramanujan Numbers.
If N, which represents the Block size, is a Ramanujan Number,
then the proposed algorithm computes DCT Coefficients using
N/2log2N shifts and (3N/2log2N)-N+1 additions which is less
than the multiplierless integer transform used in H.264/AVC
standard. Thus, the proposed fast algorithm can achieve the
higher speed in real-time H.264/AVC video signal processing.
[1]
is
[2]
A14 = 8 .By
A1N = N log 2 N .
A2 N
Proposed
Ramanujan
DCT
N/2 l og2 N
(shifts)
(3N/2log2N)N+1
Nil
From
N/2 l og2 N
(floating-point)
(3N/2log2N)N+1
Nil
Integer DCT
[14]
N
(integer)
(2Nlog2N)2N+2
(3N/2log2N)3N+3
(ii) Additions:
The additive operations could also be grouped into two parts:
with
mathematical
induction
number
of
we
REFERENCES
have,
additions
is
[3]
[4]
A24 = 1 . By mathematical
589
scholar.waset.org/1999.7/2219
[5]
[6]
[7]
[8]
[9]
[10]
International Science Index, Mathematical and Computational Sciences Vol:3, No:8, 2009 waset.org/Publication/2219
[11]
[12]
[13]
[14]
[15]
[16]
590
scholar.waset.org/1999.7/2219