350 likes | 721 Views
Combinational Logic Circuits. Reference: M. Mano, C. Kime, “Logic and Computer Design Fundamentals”, Chapter 2. Basic Logic Gates. Logic Function. Gate Symbol. Logic Expression. Truth Table. Basic Logic Gates with Inverted Outputs. Logic Gates with more than two inputs.
E N D
Combinational Logic Circuits Reference: M. Mano, C. Kime, “Logic and Computer Design Fundamentals”, Chapter 2
Basic Logic Gates Logic Function Gate Symbol Logic Expression Truth Table
Truth Tables Truth table of a logic circuit is a table showing all the possible input combinations with the corresponding value of the output. Examples:
Example:Find the logic expression and fill up the truth table for the circuit below.
Homework:Find the logic expression and fill up the truth table for the circuit below.
Analyzing a logic circuit using timing diagrams Logic 1 Logic 0
Homework: Fill up the truth table and timing diagram for the circuit below.
Boolean Algebra Basic Boolean identities:
Boolean Algebra (Examples) Prove the following identities using Boolean algebra and truth tables:
Digital circuit simplification using Boolean algebra • Logic functions are simplified in order to reduce the number of gates required to implement them. Thus the circuit will • cost less, • need less space and power, • be build faster with less effort. • For example the expression F needs six gates to be build. If the expression is simplified then the function can be implemented with only two gates.
Boolean Algebra (Examples) Simplify the expressions given below. Use truth tables to verify your results.
Boolean Algebra (Examples - Cont.) Simplify the expressions given below. Use truth tables to verify your results.
Boolean Algebra (Examples - Cont.) Simplify the expression given below. Use truth tables to verify your results.
Boolean Algebra (Examples - Cont.) Simplify the expression given below. Use truth tables to verify your results.