3rd IEEE Signal Processing Education Workshop. 2004 IEEE 11th Digital Signal Processing Workshop, 2004.
The discrete triangle transform (DTT) was recently introduced  as an example of a non-separable transform for signal processing on a two-dimensional triangular grid. 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 show that, as a consequence, the DTT has, as the DCT, type III, a Cooley-Tukey FFT type fast algorithm. We derive this algorithm and an upper bound for the number of complexdoi:10.1109/dspws.2004.1437933 fatcat:ljfsuouwvzcmljifvz6z6mfgly