On a set of matrix algebras related to discrete Hartley-type transforms
نویسندگان
چکیده
A set of fast real transforms including the well known Hartley transform is fully investigated. Mixed radix splitting properties of Hartley-type transforms are examined in detail. The matrix algebras diagonalized by the Hartley-type matrices are expressed in terms of circulant and (−1)-circulant matrices. © 2002 Elsevier Science Inc. All rights reserved.
منابع مشابه
Fast and Numerically Stable Algorithms for Discrete Hartley Transforms and Applications to Preconditioning
The discrete Hartley transforms (DHT) of types I – IV and the related matrix algebras are discussed. We prove that any of these DHTs of length N = 2 can be factorized by means of a divide–and–conquer strategy into a product of sparse, orthogonal matrices where in this context sparse means at most two nonzero entries per row and column. The sparsity joint with orthogonality of the matrix factors...
متن کاملMatrix Algebras and Displacement Decompositions
A class ξ of algebras of symmetric n × n matrices, related to Toeplitz-plus-Hankel structures and including the well-known algebra H diagonalized by the Hartley transform, is investigated. The algebras of ξ are then exploited in a general displacement decomposition of an arbitrary n× n matrix A. Any algebra of ξ is a 1-space, i.e., it is spanned by n matrices having as first rows the vectors of...
متن کاملOn Block Matrices Associated with Discrete Trigonometric Transforms and Their Use in the Theory of Wave Propagation
Block matrices associated with discrete Trigonometric transforms (DTT’s) arise in the mathematical modelling of several applications of wave propagation theory including discretizations of scatterers and radiators with the Method of Moments, the Boundary Element Method, and the Method of Auxiliary Sources. The DTT’s are represented by the Fourier, Hartley, Cosine, and Sine matrices, which are u...
متن کاملBasefield transforms derived from character tables
We show that it is possible to de ne Hartley-like transforms for (generalized) character tables of nite groups. This large class of transforms include Hartley transforms for discrete Fourier transforms over abelian groups and Hartley-like transforms for the discrete cosine transform of type I.
متن کاملAlgebraic Signal Processing Theory: Cooley-Tukey Type Algorithms for Real DFTs
In this paper we systematically derive a large class of fast general-radix algorithms for various types of real discrete Fourier transforms (real DFTs) including the discrete Hartley transform (DHT) based on the algebraic signal processing theory. This means that instead of manipulating the transform definition, we derive algorithms by manipulating the polynomial algebras underlying the transfo...
متن کامل