Multilevel logic synthesis of symmetric switching functions

USAF Summer Research Program - 1994 Summer Faculty Research Program Final Reports, Volume 5B, Wright Laboratory

“…Kim and Dietmeyer [77], observed that current systems for multilevel synthesis from PLA-like macros have a difficulty with symmetric functions. Designs of totally symmetric functions generated from descriptions that lack global network structure, have on average more than twice as many literals as the best designs, while the designs of nonsymmetric functions have on average 20% more literals than the best designs.…”

Constructive library-aware synthesis using symmetries

“…Symmetries as functional properties have been studied to improve synthesis quality for a long time [5,6,14]. In this work symmetries establish the key relation between desirable decompositions and the library of primitives which makes such decompositions possible.…”

Use of gray decoding for implementation of symmetric functions

“…A lower bound on the number of gates in conjunctive (disjunctive) normal form representation of symmetric Boolean functions is given in [30] and a method for generating a minimal SOP cover is presented in [3]. A multilevel synthesis of symmetric functions which exploits the disjoint decomposability and weight dependency of the functions is presented in [16] and a mapping of symmetric and partially symmetric functions to the CA-type FGPAs was suggested in [2]. A new expansion of symmetric functions and their application to non-disjoint functional decompositions for LUT-type FPGAs is presented in [25].…”