Portland State University. Department of Electrical Engineering
W. Robert Daasch
Date of Publication
Master of Science (M.S.) in Electrical and Computer Engineering
Computer algorithms, Parallel processing (Electronic computers), Kronecker products
1 online resource (100 p.)
A number of recent developments has increased the desirability of using exclusive OR (XOR) gates in the synthesis of switching functions. This has, in turn, led naturally to an increased interest in algorithms for the minimization of Exclusive-Or Sum of Products (ESOP) forms. Although this is an active area of research, it is not nearly as developed as the traditional Sum of Products forms. Computer programs to find minimum ESOPs are not readily available and those that do exist are impractical to use as investigative tools because they are too slow and/or require too much memory. A practical tool would be easy enough to use (faster/smaller) so that it could be run many times to explore the solution space of the minimization problem as well as to provide a baseline of comparison. This thesis develops and investigates such a tool.
In Copyright. URI: http://rightsstatements.org/vocab/InC/1.0/ This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s).
Gilliam, Paul John, "A practical parallel algorithm for the minimization of Krönecker Reed-Muller expansions" (1991). Dissertations and Theses. Paper 4178.