Combinational logic

Source: Wikipedia, the free encyclopedia.
Combinational logicFinite-state machinePushdown automatonTuring machineAutomata theory
Classes of automata
(Clicking on each layer gets an article on that subject)

In

memory
while combinational logic does not.

Combinational logic is used in

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. [2]

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 :

A B C Result Logical equivalent
F F F F
F F T F
F T F F
F T T F
T F F T
T F T F
T T F F
T T T T


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

Using

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

Logic formula minimization

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

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

References

  1. ^ Savant, C.J. Jr.; Roden, Martin; Carpenter, Gordon (1991). Electronic Design: Circuits and Systems. p. 682. .
  2. .

External links