OFDD based minimization of fixed polarity Reed-Muller expressions using hybrid genetic algorithms
- 17 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 106-110
- https://doi.org/10.1109/iccd.1994.331866
Abstract
We present an ordered functional decision diagram (OFDD) based method to minimize fixed polarity Reed-Muller expressions (FPRMs) for very large functions using genetic algorithms (GAs). R. Dreschsler et al. (1994) presented fast heuristic methods for FPRM minimization and compared them to several other approaches. We show that better results for large functions can be obtained if these heuristics are combined with GAs, i.e. we use hybrid GAs (HGAs). Experimental results are given to show the efficiency of the approach.Keywords
This publication has 12 references indexed in Scilit:
- Fast exact and quasi-minimal minimization of highly testable fixed-polarity AND/XOR canonical networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Fast minimization of mixed-polarity AND/XOR canonical networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Multilevel logic synthesis based on functional decision diagramsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Logic synthesis for arithmetic circuits using the Reed-Muller representationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Efficient graph-based computation and manipulation of functional decision diagramsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Fast OFDD-based minimization of fixed polarity Reed-Muller expressionsIEEE Transactions on Computers, 1996
- Efficient representation and manipulation of switching functions based on ordered Kronecker functional decision diagramsPublished by Association for Computing Machinery (ACM) ,1994
- Reduction of OBDDs in linear timeInformation Processing Letters, 1993
- On the complexity of mod-2l sum PLA'sIEEE Transactions on Computers, 1990
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986