A fast algorithm to minimize multi-output mixed-polarity generalized Reed-Muller forms

Authors:
Martin Helliwell;Marek Perkowski
Affiliations:
Portland State University, Department of Electrical Engineering, P.O. Box 751, Portland, OR;Portland State University, Department of Electrical Engineering, P.O. Box 751, Portland, OR
Venue:
DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
Year:
1988

Citing 5
Cited 9

Logic testing and design for testability

Logic testing and design for testability
Fault-tolerant computing: theory and techniques; vol. 1

Fault-tolerant computing: theory and techniques; vol. 1
A Computer Algorithm for Minimizing Reed-Muller Canonical Forms

IEEE Transactions on Computers
Computer Logic, Testing and Verification

Computer Logic, Testing and Verification
The Standard Data Encryption Algorithm

The Standard Data Encryption Algorithm

On the Complexity of Mod-2l Sum PLA's

IEEE Transactions on Computers
Fast exact and quasi-minimal minimization of highly testable fixed-polarity AND/XOR canonical networks

DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
Synthesis of Highly Testable Fixed-Polarity AND-XOR Canonical Networks-A Genetic Algorithm-Based Approach

IEEE Transactions on Computers
Minimization of AND-EXOR Expressions Using Rewrite Rules

IEEE Transactions on Computers
Efficient Decomposition Techniques for FPGAs

HiPC '02 Proceedings of the 9th International Conference on High Performance Computing
Efficient Realization of Parity Prediction Functions in FPGAs

Journal of Electronic Testing: Theory and Applications
Area Minimization of Exclusive-OR Intensive Circuits in FPGAs

Journal of Electronic Testing: Theory and Applications
A heuristic algorithm to minimize ESOPs for multiple-output incompletely specified functions

GLSVLSI '06 Proceedings of the 16th ACM Great Lakes symposium on VLSI
Exact ESCT minimization for functions of up to six input variables

Integration, the VLSI Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

A very fast computer program that accepts a Boolean function as an array of multi-output disjoint cubes and returns a mixed-polarity Generalized Reed-Muller Form is presented. Such circuits often have gates and interconnections than classical sum-of-product realizations and are easily testable. The program was tested on many examples from literature as well as on many large arithmetic functions with up to 8 inputs, 8 output and 255 minterms. On all the examples from the literature the solutions were either the same or better than those generated by other methods. The algorithm is based on a new cube operation, called xlinking, that generalizes known operations of merger, exclusion and other logic operations specified by previous authors.