Decomposition of Boolean functions
The synthesis problem in switching theory, that is, th e problem of designing a circuit from given building blocks, has led since the 1950s to an extensive study of the decomposition of truth functions (usually referred to as Boolean functions). Roughly speaking, this problem consists in expressing an arbitrary truth function by means of other (convenient) truth functions. In BFE, Chapter 16, §1, we have reported a few methods and results in this line of research. We strongly suggest that this field deserves a separate monograph.
Unable to display preview. Download preview PDF.