On "slant-like" fast orthogonal transforms of arbitrary order

S. Minasyan1, D. Guevorkian2, S. Agaian3, H. Sarukhanyan1
1Institute for Problems of Informatics and Automation, National Academy of Sciences of Armenia, Armenia
2Nokia Research Center, Tampere, Finland
3The City University of New York and University of Texas at San Antonio, USA

Tóm tắt

A concept for the construction of fast orthogonal transforms with matrices containing one or more predefined rows is proposed. In particular, two new families of "slant-like" transforms with matrices of arbitrary orders, including a constant row and a slant row of arbitrary slanting angle, are introduced. Transforms from these families may be computed with fast regular algorithms suitable for parallel implementation with a unified VLSI architecture that may be tuned to every representative of the family. An example of a new slant-like transform of order seven is also presented.

Từ khóa

#Discrete transforms #Sparse matrices #Discrete Fourier transforms #Fourier transforms #Very large scale integration #Image coding #Informatics #Automation #Concurrent computing #Computer architecture

Tài liệu tham khảo

10.1109/78.757218 10.1109/21.279002 minasyan, 2001, On parameterized fast Haar-and Hadamard-like transforms of arbitrary order, Proc of 3rdInt Conf On Computer Science and Information Technologies (CSIT-2001), 294 agaian, 1992, Synthesis of a class of orthogonal transforms. Parallel SIMD-algorithms and specialized processors, Pattern Recognition and Image Analysis, 2, 394 10.1109/TC.1970.5008895 ahmed, 1975, Transforms for Digital signal Processing, Orthogonal