Multidimensional Discrete Unitary Transforms: Representation: Partitioning, and Algorithms
This reference presents a more efficient, flexible, and manageable approach to unitary transform calculation and examines novel concepts in the design, classification, and management of fast algorithms for different transforms in one-, two-, and multidimensional cases. Illustrating methods to construct new unitary transforms for best algorithm selection and development in real-world applications, the book contains a wide range of examples to compare the efficacy of different algorithms in a variety of one-, two-, and three-dimensional cases. Multidimensional Discrete Unitary Transforms builds progressively from simple representative cases to higher levels of generalization.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Basic Concepts and Notation
Discrete Transform Tensor Representations
Discrete Transform Paired Representations
Multiple Paired Unitary Transforms
Analysis and effective computing procedures
Fast 2D Discrete Unitary Transforms
Other editions - View all
2-D DFT 2-D discrete 2ero 2r x 2r-point 8-point A.M. Grigoryan A'-point DFT algorithm for calculating algorithm for computing arbitrary basis functions coefficients complex consider construction corresponding cyclic convolution cyclic groups decomposition defined deuote DHdT DHFT dimensional directional signal-images discrete cosine transform discrete Fourier transform discrete Hartley transform domain elements equal example fast algorithms fast Fourier transform Figure formula frequency fundamental period given Haar Hadamard transform hexagonal lattice IEEE IEEE Trans image enhancement image f image processing image reconstruction image-signal integer inverse irreducible covering linear multidimensional multiplications required number of multiplications number of operations one-dimensional operations of multiplication orthogonal transforms paired algorithm paired functions paired representation paired transform partition polyuomial samples shown in Fig si2e Signal Processing splitting set subsets tensor algorithm tensor representation Theorem two-dimensional discrete two-dimensional sequence unitary transforms uot difficult values vector XN,N