Algebraic Signal Processing Theory: 1-D Space

In our paper titled ldquoalgebraic signal processing theory: foundation and 1-D Timerdquo appearing in this issue of the IEEE Transactions on Signal Processing, we presented the algebraic signal processing theory, an axiomatic and general framework for linear signal processing. The basic concept in this theory is the signal model defined as the triple (A,M,Phi), where A is a chosen algebra of filters, M an associated A-module of signals, and Phi is a generalization of the z-transform. Each signal model has its own associated set of basic SP concepts, including filtering, spectrum, and Fourier transform. Examples include infinite and finite discrete time where these notions take their well-known forms. In this paper, we use the algebraic theory to develop infinite and finite space signal models. These models are based on a symmetric space shift operator, which is distinct from the standard time shift. We present the space signal processing concepts of filtering or convolution, ldquoz -transform,rdquo spectrum, and Fourier transform. For finite length space signals, we obtain 16 variants of space models, which have the 16 discrete cosine and sine transforms (DCTs/DSTs) as Fourier transforms. Using this novel derivation, we provide missing signal processing concepts associated with the DCTs/DSTs, establish them as precise analogs to the DFT, get deep insight into their origin, and enable the easy derivation of many of their properties including their fast algorithms.

[1]  P. Fuhrmann A Polynomial Approach to Linear Algebra , 1996 .

[2]  公庄 庸三 Basic Algebra = 代数学入門 , 2002 .

[3]  M. Puschel,et al.  Fourier transform for the spatial quincunx lattice , 2005, IEEE International Conference on Image Processing 2005.

[4]  Ephraim Feig,et al.  On algebras related to the discrete cosine transform , 1997 .

[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..

[6]  Thomas Kailath,et al.  Displacement structure approach to discrete-trigonometric-transform based preconditioners of G.Strang type and of T.Chan type , 1996, SIAM J. Matrix Anal. Appl..

[7]  B. Hunt,et al.  The discreteW transform , 1985 .

[8]  Rene F. Swarttouw,et al.  Orthogonal polynomials , 2020, NIST Handbook of Mathematical Functions.

[9]  José M. F. Moura,et al.  Algebraic Signal Processing Theory , 2006, ArXiv.

[10]  Antonio M. Peinado,et al.  Diagonalizing properties of the discrete cosine transforms , 1995, IEEE Trans. Signal Process..

[11]  N. Jacobson,et al.  Basic Algebra II , 1989 .

[12]  N. Ahmed,et al.  Discrete Cosine Transform , 1996 .

[13]  Markus Püschel,et al.  Algebraic Signal Processing Theory: Cooley–Tukey Type Algorithms for Real DFTs , 2008, IEEE Transactions on Signal Processing.

[14]  Stephen A. Martucci,et al.  Symmetric convolution and the discrete sine and cosine transforms , 1993, IEEE Trans. Signal Process..

[15]  Martin Rötteler,et al.  Algebraic Signal Processing Theory: 2-D Spatial Hexagonal Lattice , 2007, IEEE Trans. Image Process..

[16]  M. Anshelevich,et al.  Introduction to orthogonal polynomials , 2003 .

[17]  Nikhil Balram,et al.  Recursive structure of noncausal Gauss-Markov random fields , 1992, IEEE Trans. Inf. Theory.

[18]  José M. F. Moura,et al.  DCT/DST and Gauss-Markov fields: conditions for equivalence , 1998, IEEE Trans. Signal Process..

[19]  Robert M. Gray,et al.  Probability, Random Processes, And Ergodic Properties , 1987 .

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

[21]  T. Kailath,et al.  Displacement structure approach to discrete-trigonometric-transform based preconditioners of G.Strang type and of T.Chan type , 1996 .

[22]  P. Yip,et al.  Discrete Cosine Transform: Algorithms, Advantages, Applications , 1990 .

[23]  J. Dicapua Chebyshev Polynomials , 2019, Fibonacci and Lucas Numbers With Applications.

[24]  G. Steidl,et al.  A polynomial approach to fast algorithms for discrete Fourier-cosine and Fourier-sine transforms , 1991 .

[25]  Markus Püschel,et al.  Algebraic Signal Processing Theory: Foundation and 1-D Time , 2008, IEEE Transactions on Signal Processing.

[26]  José M. F. Moura,et al.  Algebraic Signal Processing Theory: Cooley–Tukey Type Algorithms for DCTs and DSTs , 2007, IEEE Transactions on Signal Processing.

[27]  Markus Püschel Algebraic Signal Processing Theory: An Overview , 2006 .