• Corpus ID: 58028928

FFT and orthogonal discrete transform on weight lattices of semi-simple Lie groups

  title={FFT and orthogonal discrete transform on weight lattices of semi-simple Lie groups},
  author={B. Seifert},
  • B. Seifert
  • Published 18 January 2019
  • Computer Science, Mathematics, Engineering
  • ArXiv
We give two algebro-geometric inspired approaches to fast algorithms for Fourier transforms in algebraic signal processing theory based on polynomial algebras in several variables. One is based on module induction and one is based on a decomposition property of certain polynomials. The Gauss-Jacobi procedure for the derivation of orthogonal transforms is extended to the multivariate setting. This extension relies on a multivariate Christoffel-Darboux formula for orthogonal polynomials in… 
Multivariate Chebyshev polynomials and FFT-like algorithms
This dissertation investigates the application of multivariate Chebyshev polynomials in the algebraic signal processing theory for the development of FFT-like algorithms for discrete cosine


Algebraic Theory of Finite Fourier Transforms
  • P. Nicholson
  • Computer Science, Mathematics
    J. Comput. Syst. Sci.
  • 1971
Both the Cooley-Tukey and Good algorithms are induced by a single functional congruence, the solutions to which define all algorithms of the Fast Fourier Transform type.
The Efficient Computation of Fourier Transforms on Semisimple Algebras
We present a general diagrammatic approach to the construction of efficient algorithms for computing a Fourier transform on a semisimple algebra. This extends previous work wherein we derive best
Cubature formulae for orthogonal polynomials in terms of elements of finite order of compact simple Lie groups
Gaussian cubature formulae for each simple Lie group G based on nodes (interpolation points) that arise from regular elements of finite order in G.
Algebraic Signal Processing Theory: Cooley-Tukey-Type Algorithms for Polynomial Transforms Based on Induction
Novel O(nlogn) general-radix algorithms for the discrete Fourier transform and the discrete cosine transform of type 4 are derived by decomposing the regular modules of these algebras as a stepwise induction.
On group Fourier analysis and symmetry preserving discretizations of PDEs
In this paper we review some group theoretic techniques applied to discretizations of PDEs. Inspired by the recent years active research in Lie group- and exponential-time integrators for
Discrete Transforms and Orthogonal Polynomials of (Anti)Symmetric Multivariate Cosine Functions
Four families of discretely and continuously orthogonal Chebyshev-like polynomials corresponding to the antisymmetric and symmetric generalizations of cosine functions are introduced.
Algebraic signal processing theory: Cooley–Tukey type algorithms on the 2-D hexagonal spatial lattice
A general-radix algorithm for the DTT of an n × n 2-D signal, focusing on the radix-2 × 2 case is derived, which shows that the obtained DTT algorithm is the precise equivalent of the well-known Cooley–Tukey fast Fourier transform, which motivates the title of this paper.
Discrete Fourier Analysis on Fundamental Domain and Simplex of Ad Lattice in d-Variables
A discrete Fourier analysis on the fundamental domain Ωd of the d-dimensional lattice of type Ad is studied, where Ω2 is the regular hexagon and Ω3 is the rhombic dodecahedron, and analogous results
The Algebraic Approach to the Discrete Cosine and Sine Transforms and Their Fast Algorithms
This paper presents an algebraic characterization of the important class of discrete cosine and sine transforms as decomposition matrices of certain regular modules associated with four series of Chebyshev polynomials.
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)