BUILDING CLOSE TO MINIMAL SFE FOR BOOLEAN FUNCTIONS OF FOUR ARGUMENTS BASED ON SHANNON''S DECOMPOSITION
In modern electronics, many elements are devices that convert input signals into output. One form of such devices is a discrete converter. One of the subclasses of discrete converters is a class of devices in which the conversion considerably little compared with the duration of signals. The mathematical model of such devices is a scheme of functional elements. One important aspect in the design of these devices is minimization schemes within them. Schemes with fewer functional elements have the following advantages: lower cost, size, power consumption, time, simplified fault diagnosis. The author builds a library of close to the minimum formulas, which are used to SFE, for Boolean functions of four arguments