Authors: Moraga, Claudio
Stanković, Radomir 
Stanković, Milena
Title: The pascal triangle (1654), the reed-muller-fourier transform (1992), and the discrete pascal transform (2005)
Journal: Proceedings of The International Symposium on Multiple-Valued Logic
Volume: 2016-July
First page: 229
Last page: 234
Conference: 46th IEEE International Symposium on Multiple-Valued Logic, ISMVL 2016; Sapporo, Hokkaido; Japan; 18 May 2016 through 20 May 2016
Issue Date: 18-Jul-2016
ISBN: 978-1-467-39488-8
ISSN: 0195-623X
DOI: 10.1109/ISMVL.2016.24
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.
Keywords: Discrete Pascal Transform | Fractals | Pascal matrices | Pascal triangle | Reed-Muller-Fourier Transform
Publisher: IEEE

Show full item record


checked on May 27, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.