Identification and realization of symmetric switching functions

Author

Deshmukh, R.G. ; Hadjilogiou, J. ; Promva, S.

Author_Institution

Florida Inst. of Technol., Melbourne, FL, USA

fYear

1989

fDate

9-12 Apr 1989

Firstpage

1356

Abstract

A method for the identification of asymmetric, partially symmetric, and totally symmetric switching functions is presented. The proposed method is based on identifying the number of 1-points when a variable in the given switching function is assigned a value of one, and the number of 1-points when the same variable is assigned a value of zero. If certain relationships exist between such 1-points for all the variables of the given switching function, then the given switching function is totally symmetric; otherwise it could be an asymmetric or partially symmetric switching function. Two computer programs are developed and discussed. The first program takes the given switching function as input and tests it for asymmetric, partially symmetric and totally symmetric switching function. If desired, the second program finds the minterms that are to be added to or deleted from the given switching function (known from the first program) to transform it into a totally symmetric switching function

Keywords

combinatorial switching; electronic engineering computing; mathematics computing; switching functions; 1-points; asymmetric switching functions; combinational switching; computer programs; minterms; partially symmetric switching function; totally symmetric switching functions; Adders; Circuit synthesis; Combinational circuits; Decoding; Input variables; Integrated circuit testing; Switching circuits;

fLanguage

English

Publisher

ieee

Conference_Titel

Southeastcon '89. Proceedings. Energy and Information Technologies in the Southeast., IEEE

Conference_Location

Columbia, SC

Type

conf

DOI

10.1109/SECON.1989.132643

Filename

132643