论文信息 - The discrete triangle transform

The discrete triangle transform

We introduce the discrete triangle transform (DTT), a non-separable transform for signal processing on a two-dimensional equispaced triangular grid. The DTT is, in a strict mathematical sense, a generalization of the DCT, type III, to two dimensions, since the DTT is built from Chebyshev polynomials in two variables in the same way as the DCT, type III, is built from Chebyshev polynomials in one variable. We provide boundary conditions, signal extension, and diagonalization properties for the DTT. Finally, we give evidence that the DTT has Cooley-Tukey FFT like algorithms that enable its efficient computation.

Martin Rötteler | Markus Püschel

[1] M. Puschel,et al. The discrete trigonometric transforms and their fast algorithms: an algebraic symmetry perspective , 2002, Proceedings of 2002 IEEE 10th Digital Signal Processing Workshop, 2002 and the 2nd Signal Processing Education Workshop..

[2] Tom H. Koornwinder,et al. Orthogonal polynomials in two variables which are eigenfunctions of two algebraically independent partial differential operators. III , 1974 .

[3] Markus Püschel,et al. Cooley-Tukey FFT like algorithms for the DCT , 2003, ICASSP.

[4] T. Chihara,et al. An Introduction to Orthogonal Polynomials , 1979 .

[5] José M. F. Moura,et al. The Algebraic Approach to the Discrete Cosine and Sine Transforms and Their Fast Algorithms , 2003, SIAM J. Comput..