Object
Title: Efficient calculation of the Reed-Muller form by means of the Walsh transform
Contributor:
Korbicz, Józef - red. ; Uciński, Dariusz - red.
Group publication title:
Abstract:
The paper describes a spectral method for combinational logic synthesis using the Walsh transform and the Reed-Muller form. A new algorithm is presented that allows us to obtain the mixed polarity Reed-Muller expansion of Boolean functions. ; The most popular minimisation (sub-minimisation) criterion of the Reed-Muller form is obtained by the exhaustive search of all the polarity vectors. This paper presents a non-exhaustive method for Reed-Muller expansions. ; The new method allows us to build the Reed-Muller form based on the analysis of Walsh-Hadamard coefficients. The presented method has much less complexity than the procedures which have been applied until now. Both the transforms and the presented Walsh-Hadamard spectral characterization of the Reed-Muller expansion are compared. An analysis of the properties of the spectra obtained from these transforms is made.
Publisher:
Zielona Góra: Uniwersytet Zielonogórski
Resource Identifier:
Pages:
Source:
AMCS, volume 12, number 4 (2002) ; click here to follow the link
Language:
Rights:
Biblioteka Uniwersytetu Zielonogórskiego
Object collections:
- Repository > Faculties > Faculty of Computer, Electrical and Control Engineering
- Repository > Types of work > Articles
- Repository > Scientific journals and UZ publishing series > International Journal of Applied Mathematics and Computer Science (AMCS)
- Repository > Scientific journals and UZ publishing series > International Journal of Applied Mathematics and Computer Science (AMCS) > International Journal of Applied Mathematics and Computer Science (AMCS) (2002)
Last modified:
Sep 3, 2021
In our library since:
Sep 3, 2021
Number of object content hits:
67
All available object's versions:
https://zbc.uz.zgora.pl/repozytorium/publication/65761
Show description in RDF format:
Show description in OAI-PMH format:
-
International Journal of Applied Mathematics and Computer Science (AMCS)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 26 (2016)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 25 (2015)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 24 (2014)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 23 (2013)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 22 (2012)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 21 (2011)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 20 (2010)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 19 (2009)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 18 (2008)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 17 (2007)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 16 (2006)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 15 (2005)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 13 (2003)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 12 (2002)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 12, number 1 (2002)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 12, number 2 (2002)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 12, number 3 (2002)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 12, number 4 (2002)
- Enlarged exact compensation in distributed systems
- An elastic membrane with an attached non-linear thermoelastic rod
- A boundary-value problem for linear PDAEs
- Design of linear feedback for bilinear control systems
- Two observer-based tracking algorithms for a unicycle mobile robot
- Control of an induction motor using sliding mode linearization
- Inequality-based approximation of matrix eigenvectors
- Continuity of solutions of Riccati equations for the discrete-time JLQP
- Dynamics of social networks: A deterministic approach
- Reliability design of complex systems by minimizing the lifetime variance
- Generating quasigroups for cryptographic applications
- Efficient calculation of the Reed-Muller form by means of the Walsh transform
- Component composition validation
- Optimal feedback control proportional to the system state can be found for non-causal descriptor systems (A remark on a paper by P.C. Müller)
- Comment on the remark by G. A. Kurina on the paper (Müller, 1998)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 12, number 1 (2002)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 11 (2001)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 10 (2000)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 9 (1999)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 8 (1998)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 7 (1997)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 6 (1996)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 5 (1995)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 4 (1994)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 3 (1993)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 2 (1992)
-
International Journal of Applied Mathematics and Computer Science (AMCS),volume 1 (1991)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 26 (2016)
| Edition name | Date |
|---|---|
| Efficient calculation of the Reed-Muller form by means of the Walsh transform | Sep 3, 2021 |
