Combinational logic

In automata theory, **combinational logic** (sometimes also referred to as **time-independent logic**) is a type of digital logic which is implemented by Boolean circuits, where the output is a pure function of the present input only. This is in contrast to sequential logic, in which the output depends not only on the present input but also on the history of the input. In other words, sequential logic has *memory* while combinational logic does not.

Combinational logic is used in computer circuits to perform Boolean algebra on input signals and on stored data. Practical computer circuits normally contain a mixture of combinational and sequential logic. For example, the part of an arithmetic logic unit, or ALU, that does mathematical calculations is constructed using combinational logic. Other circuits used in computers, such as half adders, full adders, half subtractors, full subtractors, multiplexers, demultiplexers, encoders and decoders are also made by using combinational logic.

Practical design of combinational logic systems may require consideration of the finite time required for practical logical elements to react to changes in their inputs. Where an output is the result of the combination of several different paths with differing numbers of switching elements, the output may momentarily change state before settling at the final state, as the changes propagate along different paths.

An alternate term is **combinatorial logic**.

## Representation

Combinational logic is used to build circuits that produce specified outputs from certain inputs. The construction of combinational logic is generally done using one of two methods: a sum of products, or a product of sums. Consider the following truth table :

Using sum of products, all logical statements which yield true results are summed, giving the result:

(
A
∧
¬
B
∧
¬
C
)
∨
(
A
∧
B
∧
C
)

{\displaystyle (A \wedge \neg B \wedge \neg C) \vee (A \wedge B \wedge C) \,}

Using Boolean algebra, the result simplifies to the following equivalent of the truth table:

A
∧
(
(
¬
B
∧
¬
C
)
∨
(
B
∧
C
)
)

{\displaystyle A \wedge ((\neg B \wedge \neg C) \vee (B \wedge C)) \,}

## Logic formula minimization

Minimization (simplification) of combinational logic formulas is done using the following rules based on the laws of Boolean algebra:

(
A
∨
B
)
∧
(
A
∨
C
)

=
A
∨
(
B
∧
C
)

(
A
∧
B
)
∨
(
A
∧
C
)

=
A
∧
(
B
∨
C
)

{\displaystyle \begin{align}
(A \vee B) \wedge (A \vee C) &= A \vee (B \wedge C) \\
(A \wedge B) \vee (A \wedge C) &= A \wedge (B \vee C)
\end{align}}

A
∨
(
A
∧
B
)

=
A

A
∧
(
A
∨
B
)

=
A

{\displaystyle \begin{align}
A \vee (A \wedge B) &= A \\
A \wedge (A \vee B) &= A

\end{align}}

A
∨
(
¬
A
∧
B
)

=
A
∨
B

A
∧
(
¬
A
∨
B
)

=
A
∧
B

{\displaystyle \begin{align}

A \vee (\lnot A \wedge B) &= A \vee B \\
A \wedge(\lnot A \vee B) &= A \wedge B

\end{align}}

(
A
∨
B
)
∧
(
¬
A
∨
B
)

=
B

(
A
∧
B
)
∨
(
¬
A
∧
B
)

=
B

{\displaystyle \begin{align}

(A \vee B)\wedge(\lnot A \vee B)&=B \\
(A \wedge B) \vee (\lnot A \wedge B)&=B

\end{align}}

(
A
∧
B
)
∨
(
¬
A
∧
C
)
∨
(
B
∧
C
)

=
(
A
∧
B
)
∨
(
¬
A
∧
C
)

(
A
∨
B
)
∧
(
¬
A
∨
C
)
∧
(
B
∨
C
)

=
(
A
∨
B
)
∧
(
¬
A
∨
C
)

{\displaystyle \begin{align}

(A \wedge B) \vee (\lnot A \wedge C) \vee (B \wedge C) &= (A \wedge B) \vee (\lnot A \wedge C) \\
(A \vee B) \wedge (\lnot A \vee C) \wedge (B \vee C) &= (A \vee B) \wedge (\lnot A \vee C)

\end{align}}

With the use of minimization (sometimes called logic optimization), a simplified logical function or circuit may be arrived upon, and the logic combinational circuit becomes smaller, and easier to analyse, use, or build.

## See also

* Sequential logic
* Asynchronous circuit
* Field-programmable gate array
* Formal verification
* Relay logic
* Programmable logic controller