Extending symmetric variable-pair transitivities using state-space transformations

Detecting the symmetries of a Boolean function can lead to simpler implementations both at the hardware and software level. Large clusters of mutually symmetric variables are more advantageous than small clusters. One way to extend the symmetry of a function is to detect abstract two-cofactor relations in addition to ordinary symmetric relations. Unfortunately, ordinary symmetries are simply transitive but more complex types of relations are not. This paper shows how to convert the more complex relations into ordinary symmetries, allowing them to be used to form large clusters of symmetric variables, larger than would be possible using ordinary symmetries.

[1]  Malgorzata Marek-Sadowska,et al.  Detecting Symmetric Variables in Boolean Functions using Generalized Reel-Muller Forms , 1994, ISCAS.

[2]  Sharad Malik,et al.  Limits of using signatures for permutation independent Boolean comparison , 1995, ASP-DAC '95.

[3]  Karem A. Sakallah,et al.  Constructive library-aware synthesis using symmetries , 2000, DATE '00.

[4]  S. L. Hurst,et al.  A Digital Synthesis Procedure Under Function Symmetries and Mapping Methods , 1978, IEEE Transactions on Computers.

[5]  Michael Weber,et al.  Detection of symmetry of Boolean functions represented by ROBDDs , 1993, ICCAD.

[6]  Rolf Drechsler,et al.  BDD minimization using symmetries , 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[7]  Malgorzata Marek-Sadowska,et al.  Generalized Reed-Muller Forms as a Tool to Detect Symmetries , 1996, IEEE Trans. Computers.

[8]  Claude E. Shannon,et al.  The synthesis of two-terminal switching circuits , 1949, Bell Syst. Tech. J..

[9]  Jon C. Muzio,et al.  Antisymmetries in the realization of Boolean functions , 2002, 2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353).

[10]  Malgorzata Marek-Sadowska,et al.  Boolean Functions Classification via Fixed Polarity Reed-Muller Forms , 1997, IEEE Trans. Computers.

[11]  M. Chrzanowska-Jeske.  Generalized symmetric and generalized pseudo-symmetric functions , 1999, ICECS'99. Proceedings of ICECS '99. 6th IEEE International Conference on Electronics, Circuits and Systems (Cat. No.99EX357).

[12]  R. Drechsler,et al.  Symmetry Based Variable Ordering for ROBDDs , 1995 .

[13]  Tsutomu Sasao,et al.  A New Expansion of Symmetric Functions and Their Application to Non-Disjoint Functional Decompositions for LUT Type FPGAs , 2000 .

[14]  Karem A. Sakallah,et al.  Generalized symmetries in Boolean functions , 2000, IEEE/ACM International Conference on Computer Aided Design. ICCAD - 2000. IEEE/ACM Digest of Technical Papers (Cat. No.00CH37140).

[15]  M. Chrzanowska-Jeske.  Generalized symmetric variables , 2001, ICECS 2001. 8th IEEE International Conference on Electronics, Circuits and Systems (Cat. No.01EX483).

[16]  Peter M. Maurer.  Efficient event-driven simulation by exploiting the output observability of gate clusters , 2003, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[17]  S. Hurst.  Detection of symmetries in combinatorial functions by spectral means , 1977 .

[18]  Andy King,et al.  An Anytime Algorithm for Generalized Symmetry Detection in ROBDDs , 2008, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[20]  Alan Mishchenko,et al.  Linear cofactor relationships in Boolean functions , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[21]  Peter M. Maurer.  Conjugate symmetry , 2011, Formal Methods Syst. Des..