The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Advances in LSI technology have led to problems concerning the selection of output functions for optimum complex logic modules. A natural criterion for the evaluation of possible designs is the structure of the set of all subfunctions of the function realized by a module. Thus studying properties of the sub-function sets of Boolean functions is an approach to solving the above problems. In the paper some general results on Boolean functions having the largest sets of subfunction classes are presented and methods for constructing such functions are discussed.