Fast DCT -2 Transform via Hadamard Transform

Authors

  • Armen Petrosyan Institute for Informatics and Automation Problems of NAS RA
  • Hakob Sarukhanyan Institute for Informatics and Automation Problems of NAS RA

Abstract

n this paper we present Walsh-Hadamard transform (WHT) based on the fast discrete cosine transform (DCT-2) algorithm. The basic idea of this algorithm is the following: at first we compute the WHT coefficients, then using so called conversion matrix we convert these coe±cients to the transform domain coefficients.

References

Agaian S.S. Hadamard Matrices and Their Applications. Lecture Notesin Mathematics, vol. 1168, 1985.

Ryszard Stasinski, Janusz Konrad. A New Class of Fast Shape-Adaptive Orthogonal Transforms and Their Application to Region-Based Image Compression. IEEE Trans. On Circuits and systems for Video Technology, vol. 9, No. 1,1999, p. 16-34.

M. Barazande-Pour, Jon W. Mark. Adaptive MHDCT. IEEE, 1994, p. 90-94.

G.R. Reddy, P. Satyanarayana. Interpolation Algorithm Using Walsh-Hadamard and Discrete Fourier/Hartley Transforms. IEEE, 1990, p. 545-547.

Cheung-Fat Chan. Efficient Implementation of a Class of Isotropic Quadratic Filters by Using Walsh-Hadamard Transform.IEEE Int. Symposium on Circuits and Systems, June 9-12, Hong Kong, 1997, p. 2601-2604.

Brian K. Harms, Jin Bae Park, Stephan A. Dyer. Optimal Measurement Techniques Utilizing Hadamard Transforms. IEEE Trans. on Instrumentation and Measurement, vol. 43, No. 3, June 1994, p. 397-402.

Chen Anshi, LiDi, Zhou Renzhong. A Research on Fast Hadamard Transform (FHT) Digital Systems. IEEE TENCON 93/Beijing, 1993, p. 541-546.

Sarukhanyan H.G. Hadamard matrices: Construction methods and applications. In Prec. Of The Workshop on Transforms and Filter Banks, Feb. 21-27, Tampere, Finland, 1998, 35 p.

Ahmed, Rao. Orthogonal Transforms for Digital Signal Processing. Springer-Verlag, New York, 1975.

Agaian S.S., Sarukhanyan H.G. Hadamard matrices representation by (-1,+1) – vectors. Proc. Of Int. Conf. dedicated to Hadamard problem's centenary, Australia, 1993, 1 p.

Sarukhanyan H.G. Decomposition of the Hadamard matrices and fast Hadamard transform. Computer Analysis of Images and Patterns, Lecture Notes in Computer Science, vol.1296, 1997, p.

Yarlagadda Rao R.K., HersheyE.J. Hadamard Matrix Analysis and Synthesis with Applications and Signal/Image Processing, 1997.

Seberry J., Yamada M. Hadamard Matrices, Sequences and Block Designs. Surveys in Contemporary Design Theory, Wiley-Interscience Series in Discrete Mathematics. Jhon Wiley, New York, 1992.

Samadi S., Suzukake Y., Iwakura H. On Automatic Derivation of Fast Hadamard Transform Using Generic Programming. Proc. 1998 IEEE Asia-Pacific Conference on Circuit and Systems, Thailand, 1998, p. 327-330.

Ja-Ling Wu. Block diagonal structure in discrete transforms. IEE Proceedings, vol. 136, No. 4, 1989.

Downloads

Published

2021-12-10

How to Cite

Petrosyan, A. ., & Sarukhanyan, H. . (2021). Fast DCT -2 Transform via Hadamard Transform. Mathematical Problems of Computer Science, 28, 7–17. Retrieved from http://mpcs.sci.am/index.php/mpcs/article/view/492