Combinationallogiccircuits.pptVIP

ACOE161 (c) Costas Kyriacou Combinational Logic Circuits Basic Logic Gates Basic Logic Gates with Inverted Outputs Logic Gates with more than two inputs Circuit Implementation of a Logic Expression with Gates Circuit Implementation of Logic Expressions:- Examples Circuit Implementation of Logic Expressions:- Homework Truth Tables Truth Tables: Examples Minterms and maxterms Standard forms: Sum of Products Logic expression and truth table of a logic circuit 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 Homework: Fill up the truth table and timing diagram for the circuit below. Boolean Algebra Boolean Algebra (Examples) Digital circuit simplification using Boolean algebra Boolean Algebra (Examples) Boolean Algebra (Examples - Cont.) Boolean Algebra (Examples - Cont.) Boolean Algebra (Examples - Cont.) Digital circuit Examples with 1 output * Reference: M. Mano, C. Kime, “Logic and Computer Design Fundamentals”, Chapter 2 Truth Table Logic Expression Gate Symbol Logic Function Truth table of a logic circuit is a table showing all the possible input combinations with the corresponding value of the output. Examples: ACOE161 Logic 0 Logic 1 ACOE161 Basic Boolean identities: Prove the following identities using Boolean algebra and truth tables: 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. Simplify the expressions given below. Use truth tables to verify your results. Simplify the expressions given below. Use truth tables to verify your results. Simplify the expression given below. Use truth tabl