Pseudo Kronecker Expressions for Symmetric Functions

Authors:
R. Drechsler
Affiliations:
-
Venue:
VLSID '97 Proceedings of the Tenth International Conference on VLSI Design: VLSI in Multimedia Applications
Year:
1997

Citing 3
Cited 1

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
An enhanced algorithm for the minimization of exclusive-OR sum-of-products for incompletely specified functions

ICCD '95 Proceedings of the 1995 International Conference on Computer Design: VLSI in Computers and Processors
Sympathy: fast exact minimization of fixed polarity Reed-Muller expressions for symmetric functions

EDTC '95 Proceedings of the 1995 European conference on Design and Test

Decision Diagrams in Synthesis - Algorithms, Applications and Extensions

VLSID '97 Proceedings of the Tenth International Conference on VLSI Design: VLSI in Multimedia Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Pseudo Kronecker Expressions (PSDKROs) are a class of AND/EXOR expressions. In this paper it is proven that exact minimization of PSDKROs for totally symmetric functions can be performed in polynomial time. A new implementation method for PSDKROs is presented. Experimental results are given to show the efficiency of the presented approach in comparison to previously published work on AND/EXOR minimization.