JournalVolume 9, №2On the complexity of realization of symmetric Zhegalkin polynomials (pages 198-219) I.F. Cheburakhin, V.I. Tsurkov Abstract. Original methods for realization of Boolean functions, including symmetric ones, in classes of formulas and circuits of functional elements in various bases are suggested. Synthesis is preceded by estimating its various complexity and quality characteristics, which makes it possible to improve them in advance. For multicriteria minimization, cases in which a deterioration in some quality characteristics leads to an improvement in others are described. Intellectualization methods for automated synthesis of logic schemes are suggested.
|
|