Algebraic Signal Processing Theory: Sampling for Infinite and Finite 1-D Space

We derive a signal processing framework, called space signal processing, that parallels time signal processing. As such, it comes in four versions (continuous/discrete, infinite/finite), each with its own notion of convolution and Fourier transform. As in time, these versions are connected by sampling theorems that we derive. In contrast to time, however, space signal processing is based on a different notion of shift, called space shift, which operates symmetrically. Our work rigorously connects known and novel concepts into a coherent framework; most importantly, it shows that the sixteen discrete cosine and sine transforms are the space equivalent of the discrete Fourier transform, and hence can be derived by sampling. The platform for our work is the algebraic signal processing theory, an axiomatic approach and generalization of linear signal processing that we recently introduced.

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

[2]  V. A. Kotel’nikov CONFERENCES AND SYMPOSIA: On the transmission capacity of 'ether' and wire in electric communications , 2006 .

[3]  H. Nyquist,et al.  Certain Topics in Telegraph Transmission Theory , 1928, Transactions of the American Institute of Electrical Engineers.

[4]  J. M. Whittaker The “Fourier” Theory of the Cardinal Function , 1928 .

[5]  V. A. Kotel’nikov,et al.  On the Transmission Capacity of the “Ether” and Wire in Electrocommunications , 2001 .

[6]  Stephen A. Martucci Interpolation in the DST and DCT domains , 2000, Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101).

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

[8]  José M. F. Moura,et al.  Algebraic Signal Processing Theory: 1-D Space , 2008, IEEE Transactions on Signal Processing.

[9]  L. A. Shemetkov On the theory of finite groups , 1969 .

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

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

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

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

[14]  Jelena Kovacevic,et al.  Wavelets and Subband Coding , 2013, Prentice Hall Signal Processing Series.

[15]  R. E. Edwards,et al.  Fourier series : a modern introduction , 1982 .

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

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

[18]  Richard H. Sherman,et al.  Chaotic communications in the presence of noise , 1993, Optics & Photonics.

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

[20]  M. Burrow Representation Theory of Finite Groups , 1965 .

[21]  A. W. M. van den Enden,et al.  Discrete Time Signal Processing , 1989 .

[22]  Zhongde Wang Interpolation using type I discrete cosine transform , 1990 .

[23]  Hyun Wook Park,et al.  L=M -Fold Image Resizing in Block-DCT Domain Using Symmetric Convolution , 2001 .

[24]  D. Lieberman,et al.  Fourier analysis , 2004, Journal of cataract and refractive surgery.

[25]  Jianqin Zhou,et al.  On discrete cosine transform , 2011, ArXiv.

[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]  A. Atoyan,et al.  Properties of continuous Fourier extension of the discrete cosine transform and its multidimensional generalization , 2004 .

[28]  M. Unser Sampling-50 years after Shannon , 2000, Proceedings of the IEEE.