ABSTRACT
The analysis and design of logic circuits are guided by Boolean algebra. This chapter aims to relate Boolean algebraic concepts to logic circuits in an informal manner. It offers a formal definition of Boolean algebra and describes the terminology and notation useful in digital design. The most important use of the theorems and postulates of Boolean algebra are in the simplification of Boolean expressions. The theorems and postulates of Boolean algebra form the foundation for all the mechanical procedures used by the practicing logic designer. The chapter examines the gates commonly used in building combinational logic circuits and shows the utility of Boolean algebra in the analysis and design of combinational circuits. The chapter also aims to define various terms leading to the definition of the some popular algebraic representations of Boolean functions. A Boolean function can be expressed either as a sum of several product terms or as a product of several sum terms.
