Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The problem of synthesizing switching networks out of linear-input (threshold) elements is studied for the class of symmetric switching functions. Tight bounds are derived for the number of elements required in a minimal realization, and a method of synthesis is presented which yields economical networks. Minimal networks result for all symmetric functions of no more than about tlve variables, and for several other cases. In particular, it is shown how the parity function of any number n of variables can be realized with about log2(n) elements.
['William H. Kautz']
I am writing a research paper on a idea The Realization of Symmetric Switching Functions with Linear-Input Logical Elements
[{"from": "human", "value": "I am writing a research paper on a idea The Realization of Symmetric Switching Functions with Linear-Input Logical Elements"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The problem of synthesizing switching networks out of linear-input (threshold) elements is studied for the class of symmetric switching functions. Tight bounds are derived for the number of elements required in a minimal realization, and a method of synthesis is presented which yields economical networks. Minimal networks result for all symmetric functions of no more than about tlve variables, and for several other cases. In particular, it is shown how the parity function of any number n of variables can be realized with about log2(n) elements."}]