Boolean Functions

Definition

A Boolean function is a function that takes one or more binary variables as input and produces a binary output, where each input and output can have only one of two values: 0 or 1.

If a Boolean function has $n$ variables, then its inputs come from all possible combinations of $n$ binary values, and the output is defined for each combination. In symbolic form, a Boolean function is often written as:

$$f(x_1, x_2, \dots, x_n) \rightarrow \{0,1\}$$

where $x_1, x_2, \dots, x_n$ are Boolean variables.

Example:

• If $f(A,B) = A + B$, this means the function outputs 1 when either $A$ or $B$ is 1.
• If $f(A,B) = A \cdot B$, this means the output is 1 only when both $A$ and $B$ are 1.

Main Content

1. Basic Structure of Boolean Functions

Binary input and binary output

• A Boolean function works only with two-valued logic. The inputs are combinations of 0 and 1, and the result is also 0 or 1. For example, with two variables $A$ and $B$, the possible input combinations are $(0,0), (0,1), (1,0), (1,1)$. A Boolean function must assign one output to each of these combinations.

Truth table representation

• The most common way to represent a Boolean function is by using a truth table. A truth table lists all possible input combinations and shows the corresponding output. For example, for the AND function:

This table clearly shows that the output becomes 1 only when both inputs are 1.

2. Boolean Operations Used in Functions

AND, OR, and NOT as core operations

• Boolean functions are built from logical operations such as AND, OR, and NOT. These operations correspond to the basic behavior of digital gates. AND gives 1 only if all inputs are 1, OR gives 1 if at least one input is 1, and NOT reverses the value of a variable.

Combination of operations

• More complex Boolean functions are formed by combining these operations. For example:

$$f(A,B,C) = A \cdot B + C'$$

This function first evaluates $A \cdot B$, then ORs the result with the complement of $C$. Such expressions are used to represent decision logic in digital circuits.

3. Representation and Properties of Boolean Functions

Algebraic representation

• Boolean functions can be written as expressions using operators such as $+$ for OR, $\cdot$ for AND, and $'$ for NOT. These algebraic forms make it easier to simplify and analyze logic circuits. Example:

$$f(A,B) = A + A'B$$

This can be simplified using Boolean algebra to:

$$f(A,B) = A + B$$

in many cases, depending on the identity used.

Canonical forms and minterms/maxterms

• Boolean functions may also be represented in standard forms such as Sum of Minterms or Product of Maxterms. These forms are useful for systematic circuit design. For instance, if a function is 1 for certain rows of the truth table, it can be written as a sum of minterms corresponding to those rows. This is an important method in digital logic design and simplification.

Working / Process

1. Identify the variables and possible input combinations

Determine how many Boolean variables are involved. If there are $n$ variables, there will be $2^n$ possible input combinations. For example, with two variables $A$ and $B$, the combinations are 00, 01, 10, and 11.

2. Construct the truth table and define the output

For each input combination, decide whether the output is 0 or 1 based on the rule of the function. This step gives a complete description of the Boolean function. For example, in the AND function, only the input 11 produces output 1.

3. Express, analyze, or simplify the function

Write the function in algebraic form, standard form, or circuit form. Then use Boolean algebra rules to simplify it if needed. Simplification reduces the number of gates required in a digital circuit, making the design more efficient.

Advantages / Applications

Foundation of digital electronics

• Boolean functions are the mathematical base of digital systems. Every logic gate, from simple AND and OR gates to complex processors, can be described using Boolean functions.

Useful in circuit design and simplification

• Engineers use Boolean functions to design, analyze, and reduce logic circuits. Simplified Boolean expressions lead to fewer hardware components, lower cost, and faster operation.

Supports computer decision-making and binary control

• Boolean functions are used in comparisons, control units, error detection, and programming logic. They help computers make yes/no decisions based on binary conditions.

Summary

• Boolean functions map binary inputs to a binary output.
• They are built using logical operations such as AND, OR, and NOT.

• They are used to represent, analyze, and simplify digital logic.

• Important terms to remember: Boolean function, truth table, binary variable, AND, OR, NOT, minterm, maxterm, Boolean algebra