Abstract
The detection of symmetries in a switching function is an NP-complete problem. In this paper, a single-line solution for detecting total symmetry has been proposed. The proposed method exploits the linearity among Boolean terms to obtain the unique transformation matrix associated with every linear function. The proof of the theorem has been given which relates the equality of coefficients in the transformation matrix of the variables for symmetry detection. The efficiency of the proposed methodology for detecting complete symmetry in switching function has been improved in terms of cost in time-space domain compared to the existing techniques.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Guha, S., Saha, K., Sen, N.: A parametric based technique for detection of total and multiform symmetric switching functions in logic synthesis. In: IJCA Proceedings on International Conference on Microelectronic Circuit and System MICRO, vol. 2015, issue 1, pp. 1–10 (2015)
Shannon, C.E.: A symbolic analysis of relay and switching circuits. AIEE Trans. 57, 713–723 (1938)
Caldwell, S.H.: The recognition and identification of symmetric switching functions. Trans. AIEE (Commun. Electron.), 73(pt. 1), 142–146 (1954)
Marcus, M.P.: The detection and identification of symmetric switching functions with the use of tables of combinations. IRE Trans. Electron. Comput. (Correspondence) EC-5, 237–239 (1956)
McCluskey, E.J.: Detection of group invariance or total symmetry of a Boolean function. Bell Sys. Tech. J. 35, 1445–1453 (1956)
Mukhopadhyay, A.: Detection of total or partial symmetry of a switching function with the use of decomposition charts. IEEE Trans. Electron. Comput. (Correspondence), EC-12, 553–557 (1963)
Das, S., Sheng, C.: On detecting total or partial symmetry of switching functions. IEEE Trans. Comput. 352–355 (1971). https://doi.org/10.1109/PROC.1970.7777
Tsai, C.C., Marek-Sadowska, M.: Boolean functions classification via fixed polarity reed-muller forms. IEEE Trans. Comput. 46(2), 173–186 (1997)
Kravets, V.N., Sakallah, K.A.: Generalized symmetries in Boolean functions. In: International Conference on Computer Aided Design (ICCAD’00), p. 526 (2000). https://doi.org/10.1109/ICCAD.2000.896526
Rice, J.E., Muzio, J.C.: Antisymmetries in the realization of Boolean functions. In: IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353) ISCAS, USA, vol. 4 pp. 69–72, https://doi.org/10.1109/ISCAS.2002.1010390 (2002). ISBN- 0-7803-7448
Kohavi, Z.: Switching and Finite Automata Theory, 2nd edn., pp. 126–127. Tata McGraw-Hill Publishers (1978)
Guha, S., Ghosh, S., Das, P.P.: A novel approach for identification of symmetric switching function. In: 1st International Conference on Recent Advances in Information Technology (RAIT), pp. 731–736. IEEE, India (2012). ISBN 978-1-4577-0694-3. https://doi.org/10.1109/RAIT.2012.6194545
Picek, S., (Bob) McKay. R.I., Santana, R., Sebastian, S.: Fighting the symmetries: the structure of cryptographic Boolean function spaces. GECCO’15, Madrid, Spain c 2015. ACM (2015). ISBN 978-1-4503-3472-3/15/07, 11–15 July. https://doi.org/10.1145/2739480.2754739
Boyd, S., Diaconis, P., Parrilo, P., Xiao, L.: Fastest mixing Markov chain on graphs with symmetries. SIAM J. Opt. 20(2), 792–819 (2009). https://doi.org/10.1137/070689413
Mearsand, C,, Garciade la Banda, M., Wallace, M.: On implementing symmetry detection. In: Proceedings—Sixth International Workshop Cite des Congres, Nantes, France (2006)
Margalit, D., Rabinoff, J.: Interactive Linear Algebra, pp. 114–153. Georgia Institute of Technology. https://textbooks.math.gatech.edu/ila/ila.pdf (2019)
Yang, S.: Logic synthesis and optimization benchmarks user guide version 3.0. In: Report issued at MCNC International Workshop on Logic Synthesis. https://ddd.fit.cvut.cz/prj/Benchmarks/LGSynth91.pdf (1991)
Acknowledgements
We are grateful to the reviewers and facilitators whose constructive comments were useful in improving the content on this paper. This work was supported by Barrackpore Rastraguru Surendranath College by providing the platforms and means.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Guha, S., Mandal, J.K., Chakraborty, A., Sarkar, U. (2022). On Mono-Line Boolean Symmetry Detection. In: Mandal, J.K., Buyya, R., De, D. (eds) Proceedings of International Conference on Advanced Computing Applications. Advances in Intelligent Systems and Computing, vol 1406. Springer, Singapore. https://doi.org/10.1007/978-981-16-5207-3_37
Download citation
DOI: https://doi.org/10.1007/978-981-16-5207-3_37
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-16-5206-6
Online ISBN: 978-981-16-5207-3
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)