The Pascal Triangle (1654), the Reed-Muller-Fourier Transform (1992), and the Discrete Pascal Transform (2005)

This paper makes a theoretical comparative analysis of the Reed-Muller-Fourier Transform, Pascal matrices based on the Pascal triangle, and the Discrete Pascal Transform. The Reed-Muller-Fourier Transform was not originated by a Pascal matrix, however it happens to show a strong family resemblance with it, sharing several basic properties. Its area of application is the multiple-valued switching theory, mainly to obtain polynomial expressions from the value vector of multiple-valued functions. The Discrete Pascal Transform was introduced over a decade later, based on an ad hoc modification of a Pascal matrix, for applications on picture processing. It is however shown that a Discrete Pascal Transform of size p, taken modulo p equals the special Reed-Muller-Fourier Transform for the same p and n = 1. The Sierpinski fractal is close related to the Pascal matrix. Data structures based on the Sierpinski triangle have been successfully used to solve special problems in switching theory. Some of them will be addressed in the paper.

[1]  Irving S. Reed,et al.  A class of multiple-error-correcting codes and the decoding scheme , 1954, Trans. IRE Prof. Group Inf. Theory.

[3]  A. Skodras.  Fast discrete Pascal transform , 2006 .

[4]  Marek A. Perkowski,et al.  Multiple-valued generalized Reed-Muller forms , 1991, [1991] Proceedings of the Twenty-First International Symposium on Multiple-Valued Logic.

[5]  Thomas J. Goodman,et al.  The discrete Pascal transform and its applications , 2005, IEEE Signal Processing Letters.

[6]  Peter Maurer,et al.  Spectral Logic And Its Applications For The Design Of Digital Devices , 2016 .

[7]  Claudio Moraga,et al.  Representation of Multiple-Valued Logic Functions , 2012, Representation of Multiple-Valued Logic Functions.

[8]  C. Watari.  A generalization of Haar functions , 1956 .

[9]  E. Sakk,et al.  The Fourier Convolution Theorem over Finite Fields: Extensions of its Application to Error Control Coding , 2012 .

[10]  J. S. Ratti,et al.  Finite Mathematics with Applications. , 1973 .

[11]  Maurice F. Aburdene,et al.  Unification of Legendre, Laguerre, Hermite, and binomial discrete transforms using Pascal's matrix , 1994, Multidimens. Syst. Signal Process..

[12]  J. K. Mandal,et al.  A F RAGILE WATERMARKING BASED ON BINOMIAL TRANSFORM IN COLOR IMAGES , 2013 .

[13]  Claudio Moraga,et al.  Calculation of Reed-Muller-Fourier coefficients of multiple-valued functions through multiple-place decision diagrams , 1994, Proceedings of 24th International Symposium on Multiple-Valued Logic (ISMVL'94).

[14]  M. Karpovsky.  Finite Orthogonal Series in Design of Digital Devices , 2006 .

[15]  H. E. Chrestenson.  A class of generalized Walsh functions , 1955 .

[16]  Athanassios N. Skodras.  Efficient computation of the discrete Pascal transform , 2006, 2006 14th European Signal Processing Conference.

[17]  Anita Dani,et al.  Sierpinski gaskets for logic functions representation , 2002, Proceedings 32nd IEEE International Symposium on Multiple-Valued Logic.

[18]  Claudio Moraga,et al.  Efficient derivation of Reed-Muller expansions in multiple-valued logic systems , 1992, [1992] Proceedings The Twenty-Second International Symposium on Multiple-Valued Logic.

[19]  J. E. Gibbs.  'Instant' Fourier transform , 1977 .

[21]  T.J. Goodman,et al.  Interpolation Using the Discrete Pascal Transform , 2006, 2006 40th Annual Conference on Information Sciences and Systems.

[22]  Mireille Boutin,et al.  The Pascal Triangle of a Discrete Image: Definition, Properties and Application to Shape Analysis , 2012, ArXiv.

[23]  Jaakko Astola,et al.  Spectral Logic and Its Applications for the Design of Digital Devices , 2008 .

[24]  Radomir S. Stankovic,et al.  Some remarks on Fourier transform and differential operators for digital functions , 1992, [1992] Proceedings The Twenty-Second International Symposium on Multiple-Valued Logic.

[25]  Athanassios N. Skodras,et al.  On the use of the discrete Pascal transform in hiding data in images , 2010, Photonics Europe.

[26]  David E. Muller,et al.  Application of Boolean algebra to switching circuit design and to error detection , 1954, Trans. I R E Prof. Group Electron. Comput..

[27]  Thomas J. Goodman,et al.  On The Pascal Transform and Threshold Selection , 2007, 2007 41st Annual Conference on Information Sciences and Systems.