Combinational circuits

-MOHANKUMAR.M
AP/ECE/SECE
Combinational logic
A circuit whose output is dependent only on the state of its
inputs.
COMBINATIONAL CIRCUIT-DESIGN PROCEDURE
The design procedure for combinational logic circuits starts
with the problem specification and comprises the following
steps:

1. Determine required number of inputs and outputs from

the specifications.
2. Derive the truth table for each of the outputs based on
their relationships to the input.
3. Simplify the Boolean expression for each output. Use
Karnaugh Maps or Boolean algebra.
4. Draw a logic diagram that represents the simplified
Boolean expression. Verify the design by analyzing or
simulating the circuit.
 Examples
Is input greater than or equal to 5? Derive the Truth Table

Specification A B C Z
Design a circuit that has a 3-bit
0 0 0 0
binary input and a single output
(Z) specified as follows: 0 0 1 0
Z = 0, when the input is less
than 510 0 1 0 0
Z = 1, otherwise 0 1 1 0
Determine the inputs and
Outputs 1 0 0 0
Label the inputs (3 bits) as 1 0 1 1
A, B, C
A is the most significant 1 1 0 1
bit 1 1 1 1
C is the least significant
bit UseKarnaugh Mapto minimise the logic or
The output (1 bit) is Z From the truth table, get theCanonical Sum of
Z = 1 -> 1012, 1102Productsboolean
, expression.
1112 Z = A * ~B * C + A * B * ~C + A * B * C
Z = 0 -> other inputs UseBoolean Algebrato simplify the boolean
expression to:
Draw the logic diagram
Draw a logic diagram that represents the simplified Boolean
expression. Verify the design by analyzing or simulating the
circuit.

LOGIC DIAGRAM
HALF ADDER
A combinational circuit which adds two one-bit binary
numbers is called a half-adder.
As the name suggestshalf-adderis an arithmetic circuit block by using this circuit block we can be used to
add two bits. As we know it can add two bit number so it has two inputs terminals and as well as two outputs
terminals, with one producing the SUM output and the other producing the CARRY

LOGIC DIAGRAM
FULL ADDER