# Orthogonal Transforms for Digital Signal and Image Processing

## Abstract

In this report there are presented some primary results obtained in Digital Signal and Image Processing laboratory of the Institute for Informatics and Automation Problems of NAS RA.

## References

N. Ahmed and K. R. Rao, Orthogonal Transforms for Digital Signal Processing. Springer-Verlag, New York (1975).

R. Yavne, “An economical method for calculating the discrete Fourier transform,” Proc. AFIPS Fall Joint Computer Conf., vol. 33, 1968, pp. 115–125.

M. Frigo and S. G. Johnson, “A modified split-radix FFT with fewer arithmetic operations,” IEEE Transactions on Signal Processing, vol. 55, pp. 111-119, 2007.

H. Sarukhanyan. Decomposition of the Hadamard Matrices and Fast Hadamard Transform. Computer Analysis of Images and Patterns, Lecture Notes in Computer Science, vol. 1296, 1997, pp. 575-581

S. Agaian, H. Sarukhanyan. Recurrence Formulae Construction of Williamson’s Type Matrices. Math. Notes, vol. 30, No.3- 4, 1981, pp. 796-804.

J. Seberry and M. Yamada, “Hadamard matrices, sequences, and block designs,” in Contemporary Design Theory: A Collection of Surveys, J. H. Dinitz and D. R. Stinson, Eds. New York: Wiley, 1992.

See-May Phoong, Yuan-Pei Lin. Lapped Hadamard Transforms and Filter Banks, IEEE, ICASSP 2003, vol. 6, 2003, pp. 509-512.

See-May Phoong, Kai-Yen Chang. Antipodal Paraunitary Matrices and Their Application to OFDM Systems, IEEE Trans. on Signal Processing, vol. 53, No. 4, 2005, pp. 1374-1386.

## Downloads

## Published

## How to Cite

*Mathematical Problems of Computer Science*,

*34*, 10–12. Retrieved from http://mpcs.sci.am/index.php/mpcs/article/view/299

## Issue

## Section

## License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.