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

01/18/2019
by   Bastian Seifert, et al.
0

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-Jordan 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 several variables. As a set of application examples a general scheme for the derivation of fast transforms of weight lattices based on multivariate Chebyshev polynomials is derived. A special case of such transforms is considered, where one can apply the Gauss-Jordan procedure.

READ FULL TEXT
research
07/19/2019

Sparse Recovery for Orthogonal Polynomial Transforms

In this paper we consider the following sparse recovery problem. We have...
research
01/14/2021

A General Method for Generating Discrete Orthogonal Matrices

Discrete orthogonal matrices have several applications, such as in codin...
research
02/10/2022

A Stieltjes algorithm for generating multivariate orthogonal polynomials

Orthogonal polynomials of several variables have a vector-valued three-t...
research
11/09/2018

The discrete cosine transform on triangles

The discrete cosine transform is a valuable tool in analysis of data on ...
research
07/26/2018

Fast cosine transform for FCC lattices

Voxel representation and processing is an important issue in a broad spe...
research
04/17/2023

Orthogonal AMP for Problems with Multiple Measurement Vectors and/or Multiple Transforms

Approximate message passing (AMP) algorithms break a (high-dimensional) ...

Please sign up or login with your details

Forgot password? Click here to reset