Fault Detection in Combinational Networks by Reed-Muller Transforms
IEEE Transactions on Computers
Spectral Techniques and Fault Detection
Spectral Techniques and Fault Detection
Binary Polynomial and Nonlinear Digital Filters
Binary Polynomial and Nonlinear Digital Filters
Representations of Discrete Functions
Representations of Discrete Functions
Spectral Interpretation of Decision Diagrams
Spectral Interpretation of Decision Diagrams
Highly Testable Boolean Ring Logic Circuits
ISMVL '99 Proceedings of the Twenty Ninth IEEE International Symposium on Multiple-Valued Logic
Efficient Calculation of Fixed-Polarity Polynomial Expressions for Multiple-Valued Logic Functions
ISMVL '02 Proceedings of the 32nd International Symposium on Multiple-Valued Logic
Optimization of GF(4) Expressions Using the Extended Dual Polarity Property
ISMVL '03 Proceedings of the 33rd International Symposium on Multiple-Valued Logic
Functional Decision Diagrams for Multiple-Valued Functions
ISMVL '95 Proceedings of the 25th International Symposium on Multiple-Valued Logic
Reed-Muller Canonical Forms in Multivalued Logic
IEEE Transactions on Computers
Easily Testable Realizations ror Logic Functions
IEEE Transactions on Computers
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Hi-index | 0.00 |
A new algorithm for calculating quaternary Fixed-Polarity Reed-Muller (FPRM) spectra is described in this paper. The presented algorithm directly converts array of disjoint cubes representation of a quaternary function into its FPRM spectral coefficients. The main advantage of this algorithm is that it requires less memory space than other algorithms. Since each spectral coefficient can be calculated independently of other spectral coefficients, the algorithm can be implemented using parallel programming. Brief reviews and experimental results of several existing algorithms for the calculation of quaternary FPRM spectra are also included in this paper together with experimental results of the new algorithm for comparison purpose.