Algebraic signal processing theory: Cooley–Tukey type algorithms on the 2-D hexagonal spatial lattice (original) (raw)

• 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
  Article MathSciNet Google Scholar
• 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)
• 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]
• Püschel, M., Moura, J.M.F.: Algebraic signal processing theory: 1-D space. Part of [3]; IEEE Trans. Signal Process. (2008, to appear)
• Rivlin T.J. (1974). The Chebyshev Polynomials. Wiley Interscience, New York
  MATH Google Scholar
• 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
  MathSciNet Google Scholar
• 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
• 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
  Article MathSciNet MATH Google Scholar
• 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)
• Mersereau R.M. (1979). The processing of hexagonally sampled two-dimensional signals. Proc. IEEE 67(6): 930–949
  Article Google Scholar
• Dudgeon D.E. and Mersereau R.M. (1984). Multidimensional Digital Signal Processing. Prentice-Hall, Englewood Cliffs
  MATH Google Scholar
• Middleton L. and Sivaswamy J. (2005). Hexagonal Image Processing. Springer, Heidelberg
  MATH Google Scholar
• Grigoryan A.M. (2002). Hexagonal discrete cosine transform for image coding. IEEE Trans. Signal Process. 50(6): 1438–1448
  Article MathSciNet Google Scholar
• Nussbaumer H.J. (1982). Fast Fourier Transformation and Convolution Algorithms, 2nd edn. Springer, Heidelberg
  Google Scholar
• 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
  Article MathSciNet MATH Google Scholar
• 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
  Article MathSciNet MATH Google Scholar
• Potts D., Steidl G. and Tasche M. (1998). Fast algorithms for discrete polynomial transforms. Math. Comput. 67(224): 1577–1590
  Article MathSciNet MATH Google Scholar
• Curtis W.C. and Reiner I. (1962). Representation Theory of Finite Groups. Interscience, New York
  MATH Google Scholar
• Beth, Th.: Verfahren der Schnellen Fouriertransformation [Fast Fourier Transform Methods]. Teubner (1984)
• Clausen, M.: Beiträge zum Entwurf schneller Spektraltransformationen (Habilitationsschrift), University of Karlsruhe (1988)
• Clausen M. (1989). Fast generalized Fourier transforms. Theor. Comput. Sci. 67: 55–63
  Article MathSciNet MATH Google Scholar
• Clausen, M., Baum, U.: Fast Fourier Transforms. BI-Wiss.-Verl. (1993)
• 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)
• Rockmore D. (1990). Fast Fourier analysis for abelian group extensions. Adv. Appl. Math. 11: 164–204
  Article MathSciNet MATH Google Scholar
• Maslen, D., Rockmore, D.: Double coset decompositions and computational harmonic analysis on groups. J. Fourier Anal. Appl. 6(4), (2000)
• Jacobson, N.: Basic Algebra I. W.H. Freeman and Co., San Francisco (1974)
• Cox D., Little J. and O’Shea D. (1997). Ideals, Varieties, and Algorithms. Springer, Heidelberg
  Google Scholar
• Becker Th. and Weispfenning V. (1993). Gröbner Bases. Springer, Heidelberg
  MATH Google Scholar
• Fuhrman P.A. (1996). A Polynomial Approach to Linear Algebra. Springer, New York
  Google Scholar
• Ahmed N., Natarajan T. and Rao K.R. (1974). Discrete cosine transform. IEEE Trans. Comput. C-23: 90–93
  Article MathSciNet Google Scholar
• Püschel, M., Rötteler, M.: The discrete triangle transform. Proc. Int. Conf. Acoust. Speech Process., vol. 3, pp. 45–48 (2004)
• 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)
• 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
  Article MathSciNet MATH Google Scholar
• Püschel M. (2002). Decomposing monomial representations of solvable groups. J. Symbolic Comput. 34(6): 561–596
  Article MathSciNet MATH Google Scholar
• Egner S. and Püschel M. (2001). Automatic generation of fast discrete signal transforms. IEEE Trans. Signal Process. 49(9): 1992–2002
  Article MathSciNet Google Scholar
• Egner S. and Püschel M. (2004). Symmetry-based matrix factorization. J. Symbolic Comput. 37(2): 157–186
  Article MathSciNet MATH Google Scholar
• Chihara T.S. (1978). An Introduction to Orthogonal Polynomials. Gordon and Breach, New York
  MATH Google Scholar
• Eier R. and Lidl R. (1982). A class of orthogonal polynomials in k variables. Math. Ann. 260: 93–99
  Article MathSciNet MATH Google Scholar
• 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
  MathSciNet MATH Google Scholar