Algebraic signal processing theory: Cooley-Tukey type algorithms on the 2-D hexagonal spatial lattice

Applicable Algebra in Engineering, Communications and Computing

Volumn 19, Issue 3, 2008, Pages 259-292

  Püschel, Markus ^a   Rtteler, Martin ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b NEC LABORATORIES AMERICA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; DISCRETE FOURIER TRANSFORMS; SIGNAL PROCESSING; TWO DIMENSIONAL;

2-D HEXAGONAL SPATIAL LATTICE; DISCRETE TRIANGLE TRANSFORM (DTT); HEXAGONAL DISCRETE FOURIER TRANSFORMS; POLYNOMIAL ALGEBRA;

POLYNOMIALS;

EID: 44449116516     PISSN: 09381279     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00200-008-0077-x     Document Type: Article

References (39)

1. Püschel M. and Rötteler M. (2007). Algebraic signal processing theory: 2-D hexagonal spatial lattice. IEEE Trans. Image Process. 16(6): 1506-1521
2. Püschel, M., Moura, J.M.F.: Algebraic signal processing theory: foundation and 1-D time. Part of [3]; IEEE Trans. Signal Process. (2008, to appear)
3. Püschel, M., Moura, J.M.F.: Algebraic signal processing theory. Available at http://arxiv.org/abs/cs.IT/0612077, parts of this manuscript are submitted as [2,4]
4. Püschel, M., Moura, J.M.F.: Algebraic signal processing theory: 1-D space. Part of [3]; IEEE Trans. Signal Process. (2008, to appear)
5. Rivlin T.J. (1974). The Chebyshev Polynomials. Wiley Interscience, New York
6. Koornwinder T. (1974). Orthogonal polynomials in two variables which are eigenfunctions of two algebraically independent partial differential operators (part III). Indag. Math. 36: 357-369
7. Püschel, M., Moura, J.M.F.: Algebraic signal processing theory: Cooley-Tukey type algorithms for DCTs and DSTs. IEEE Trans. Signal Process. (2008, to appear); a longer version is available at http://arxiv.org/abs/cs.IT/ 0702025
8. Püschel M. and Moura J.M.F. (2003). The algebraic approach to the discrete cosine and sine transforms and their fast algorithms. SIAM J. Comput. 32(5): 1280-1316
9. Püschel, M., Rötteler, M.: Cooley-Tukey FFT like algorithm for the discrete triangle transform. In: Proceedings of the 11th IEEE DSP Workshop, pp. 158-162 (2004)
10. Mersereau R.M. (1979). The processing of hexagonally sampled two-dimensional signals. Proc. IEEE 67(6): 930-949
11. Dudgeon D.E. and Mersereau R.M. (1984). Multidimensional Digital Signal Processing. Prentice-Hall, Englewood Cliffs
12. Middleton L. and Sivaswamy J. (2005). Hexagonal Image Processing. Springer, Heidelberg
13. Grigoryan A.M. (2002). Hexagonal discrete cosine transform for image coding. IEEE Trans. Signal Process. 50(6): 1438-1448
14. Nussbaumer H.J. (1982). Fast Fourier Transformation and Convolution Algorithms, 2nd edn. Springer, Heidelberg
15. Steidl G. and Tasche M. (1991). A polynomial approach to fast algorithms for discrete Fourier-cosine and Fourier-sine transforms. Math. Comput. 56(193): 281-296
16. Driscoll J.R., Healy D.M. Jr. and Rockmore D. (1997). Fast discrete polynomial transforms with applications to data analysis for distance transitive graphs. SIAM J. Comput. 26: 1066-1099
17. Potts D., Steidl G. and Tasche M. (1998). Fast algorithms for discrete polynomial transforms. Math. Comput. 67(224): 1577-1590
18. Curtis W.C. and Reiner I. (1962). Representation Theory of Finite Groups. Interscience, New York
19. Beth, Th.: Verfahren der Schnellen Fouriertransformation [Fast Fourier Transform Methods]. Teubner (1984)
20. Clausen, M.: Beiträge zum Entwurf schneller Spektraltransformationen (Habilitationsschrift), University of Karlsruhe (1988)
21. Clausen M. (1989). Fast generalized Fourier transforms. Theor. Comput. Sci. 67: 55-63
22. Clausen, M., Baum, U.: Fast Fourier Transforms. BI-Wiss.-Verl. (1993)
23. Maslen, D., Rockmore, D.: Generalized FFTs-a survey of some recent results. In: Proceedings of IMACS Workshop in Groups and Computation, vol. 28, pp. 182-238 (1995)
24. Rockmore D. (1990). Fast Fourier analysis for abelian group extensions. Adv. Appl. Math. 11: 164-204
25. Maslen, D., Rockmore, D.: Double coset decompositions and computational harmonic analysis on groups. J. Fourier Anal. Appl. 6(4), (2000)
26. Jacobson, N.: Basic Algebra I. W.H. Freeman and Co., San Francisco (1974)
27. Cox D., Little J. and O'Shea D. (1997). Ideals, Varieties, and Algorithms. Springer, Heidelberg
28. Becker Th. and Weispfenning V. (1993). Gröbner Bases. Springer, Heidelberg
29. Fuhrman P.A. (1996). A Polynomial Approach to Linear Algebra. Springer, New York
30. Ahmed N., Natarajan T. and Rao K.R. (1974). Discrete cosine transform. IEEE Trans. Comput. C-23: 90-93
31. Püschel, M., Rötteler, M.: The discrete triangle transform. Proc. Int. Conf. Acoust. Speech Process., vol. 3, pp. 45-48 (2004)
32. Voronenko, Y., Püschel, M.: Algebraic derivation of general radix Cooley-Tukey algorithms for the real discrete Fourier transform. Proc. Int. Conf. Acoust. Speech Signal Process., vol. 3, pp. 876-879 (2006)
33. Auslander L., Feig E. and Winograd S. (1984). Abelian semi-simple algebras and algorithms for the discrete Fourier transform. Adv. Appl. Math. 5: 31-55
34. Püschel M. (2002). Decomposing monomial representations of solvable groups. J. Symbolic Comput. 34(6): 561-596
35. Egner S. and Püschel M. (2001). Automatic generation of fast discrete signal transforms. IEEE Trans. Signal Process. 49(9): 1992-2002
36. Egner S. and Püschel M. (2004). Symmetry-based matrix factorization. J. Symbolic Comput. 37(2): 157-186
37. Chihara T.S. (1978). An Introduction to Orthogonal Polynomials. Gordon and Breach, New York
38. Eier R. and Lidl R. (1982). A class of orthogonal polynomials in k variables. Math. Ann. 260: 93-99
39. Ricci P.E. (1986). An iterative property of Chebyshev polynomials of the first kind in several variables. Rendiconti di Matematica e delle sue Applicazioni 6(4): 555-563