Académique Documents
Professionnel Documents
Culture Documents
N
W is an orthonormal matrix, we can get the following results by
substitute the relation
T
N N N
W W I = into the last equation:
where
N
T is the conversion matrix transferring Walsh domain vector to the
DCT-II domain. Therefore, there are two steps in this fast algorithm: first,
compute the WT of the input vector; second, convert from Walsh domain to the
DCT domain via
N
T . The signal flow graph for the DCT-II computation via WT
for N = 8 is shown in Fig.3.4(a) and (b).
Fig.3.4(a). Step1: Compute the WT of the input vector.
- 17 -
Fig.3.4(b). Step2: Convert from Walsh domain to the DCT domain via
N
T .
IV. Fast Algorithm for 2-D DCT
1 Introduction of 2-D DCT
The most common and significant use of 2-D DCT algorithm is the
application of DCT-II (typically 4 4, 8 8, 16 16 ) in compression of digital
image and video. Therefore, among eight types of DCT and their corresponding
DST, 2-D DCT-II is the only one that research efforts have been concentrated on.
And there is no exception for this tutorial that we only focus on the topic of 2-D
DCT-II fast algorithm.
The 2-D DCT-II for an N N input data matrix { }
mn
x , m, 0,1, , 1 n N = ,
is defined as follow
and the inverse 2-D DCT-II as follow
- 18 -
2 Fast algorithm for 2-D DCT-II
Generally, there are two kinds of approach of existing fast 2-D DCT-II
algorithm: indirect and direct. In the indirect approach, the 2-D DCT is computed
via other 2-D discrete orthogonal transforms like 2-D DFT of the same size. In
the direct approach, there are two methods based on the direct 2-D DCT
computation. The first one is called row-column method. It utilizes the
separability property of 2-D DCT kernel by applying any fast 1-D DCT algorithm
to the rows and columns of the input matrix sequentially. Hence, for an N N
input data matrix, where =2
n
N , the row-column method requires totally
2
2 log N N multiplication. The second method is a 2-D vector method [10]
utilizing 2-D decomposition process. Although its computation efficiency
outperforms the row-column method, in this tutorial, we only introduce the
row-column one because it combines the 1-D DCT fast algorithm we have
already learned in previous sections and will be easier to understand.
In the row-column method [11], the transform kernel of 2-D DCT-II is
derived in the form as
cos( ) cos( )=[ cos( )+cos( )] 2 o | o | o | + .
Thus, the multiplications required are reduced and only the ones for the
computation of 1-D -point N DCT-II remain. Therefore, for N N DCT-II, data
reordering and mapping before N 1-D -point N DCT-II is needed. Moreover, a
regular butterfly structure for additions after 1-D DCT-II is also included. The
corresponding signal flow graph for 4 4 DCT-II computation is shown in
- 19 -
Fig.4.1.
Fig. 4.1. Signal flow graph for 4 4 DCT-II computation.
Any 1-D DCT-II fast algorithm can be used.
V. Conclusion
In this tutorial, we first analyze the symmetric and anti-symmetric properties
of DCT and DST. After that, split-radix fast algorithm for 1-D DCT-I, DST-I,
DCT-II/DST-II is introduced. Moreover, another fast transform for DCT-II via
Walsh transform is also shown. In addition to the 1-D algorithm, we also extend
the concept of 1-D fast algorithm to 2-D algorithm utilizing the separablility
property.
VI. References
[1] V. Britanak, P. C. Yip, K. R. Rao, Discrete Cosine and Sine Transforms:
- 20 -
General Properties, Fast Algorithms and Integer Approximations, Academic
Press, 2007
[2] ,
[3] S. A. Martucci, Symmetric convolution and the discrete sine and cosine
transforms, IEEE Transactions on Signal Processing, Vol. 42, No. 5, May
1994, pp. 10381051.
[4] Z. Wang, A fast algorithm for the discrete sine transform implemented by the
fast cosine transform, IEEE Transactions on Acoustics, Speech, and Signal
Processing, Vol. ASSP-30, October 1982, pp. 814815.
[5] Z.Wang, Fast algorithms for the discreteWtransform and for the discrete
Fourier transform, IEEE Transactions on Acoustics, Speech, and Signal
Processing, Vol. ASSP-32, August 1984, pp. 803816.
[6] S. Venkataraman, V. R. Kanchan, K. R. Rao and M. Mohanty, Discrete
transforms via the WalshHadamard transform, Signal Processing, Vol. 14,
No. 4, June 1988, pp. 371382.
[7] G. Plonka and M. Tasche, Fast and numerically stable algorithms for discrete
cosine transforms, Linear Algebra and its Applications, Vol. 394, No. 1,
January 2005, pp. 309345.
[8] Split-radix FFT algorithm , Wikipedia,
http://en.wikipedia.org/wiki/Split-radix_FFT_algorithm
[9] C. W. Sun and P. Yip, Split-radix algorithms for DCT and DST,
Proceedings of the Asilomar Conference on Signals, Systems and Computers,
Pacific Grove, CA, November 1989, pp. 508512.
[10] S. C. Chan and K. L. Ho, A new two-dimensional fast cosine transform
algorithm, IEEE Transactions on Signal Processing, Vol. 39, No. 2, February
1991, pp. 481485.
[11] N. I. Cho and S. U. Lee, Fast algorithm and implementation of 2-D discrete
cosine transform, IEEE Transactions on Circuits and Systems, Vol. 38, No. 3,
March 1991, pp. 297305.