Front | Back |
Boolean Algebra
|
A simplified mathematical system for working with binary functions. Boolean algebra provides a way to express logic functions and design digital logic circuits.
|
Boolean Expression
|
A mathematical equation that expresses that expresses the output of a logic circuit in terms of its inputs.
|
Combinational Logic Circuit
|
When two or more logic elements are combined to achieve a decision making function. The circuits usually have more than one input and/or output. Any combination of multiple ANDs, ORs, and NOTs is a combinational logic circuit.
|
Logical Product
|
The AND function that may result from a Boolean expression. It may be represented by a dot or parentheses.
|
Logical Sum
|
The OR function that may result from a Boolean expression. The plus sign (+) is often used to designate the OR function.
|
Product of Sums Circuit
|
Product refers to the AND function, andd sum refers to the OR function. In this circuit, first the OR product is determined; then thses are logically ORed to determine the output expression. Contrast this definition with the sum of products circuit.
|
Sum of Products Circuit
|
The most common Boolean expression in complex decision making. Sum refers to the OR function; product refers to the AND function. First the AND product is determined; then these products are logically ORed to determine the output expression.
|
Truth Tables
|
Charts that list all possible inputs to a circuit and the outputs that result. Truth tables are useful for analyzing and designing digital circuits.
|