On Identification and Realisation of Symmetric Circuit Representation from any Switching Function

This paper presents methods for identification of symmetric and partially symmetric Boolean function in its first section. In the second section, conversion of any arbitrary switching function to its completely symmetric module form has been discussed. Finally, techniques for obtaining the minimum number of repetition of assymmetric variables required to convert any switching function to its symmetric circuit representation has been discussed.