Abstract
Effective algorithms exist for synthesizing symmetric functions and for ordinary nonsymmetric functions. However, the existing methods have difficulties when the functions are not symmetric but are close to being symmetric. We formulate a set of operations to decompose a function so that symmetric components can be created and utilized to simplify the function. These operations are collectively called symmetry reexpression, and we present theoretical and practical work for performing such operations. The optimal decomposition has exponential complexities; therefore, we seek algorithms to approximate the optimum. The resulting software package applies to arbitrary multilevel Boolean networks. For experimental functions constructed by taking cubes from otherwise symmetric, multiple-output benchmark functions, symmetry reexpression is beneficial when up to 40% of the cubes are removed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
