Scribd
Upload
51 views

Rangkaian Logika: Materi Kuliah Ke-4

This document discusses logic gates and binary logic. It begins with an overview of binary logic, Boolean algebra, standard and canonical forms, Karnaugh maps, and their manipulation. It then defines binary variables, logic operations like AND, OR and NOT, and how binary logic functions are represented. Truth tables are introduced for logic operators like AND, OR and NOT. Logic gates are described as abstractions of electronic components. A timing diagram demonstrates signal propagation through gates. Combinational logic circuits are discussed, showing how to construct a circuit from a logic function by connecting gates based on the function's logic operations. The document concludes by assigning a homework to find datasheets for specified CMOS and TTL logic IC series.

Uploaded by

Jimran Leo
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
51 views

Rangkaian Logika: Materi Kuliah Ke-4

This document discusses logic gates and binary logic. It begins with an overview of binary logic, Boolean algebra, standard and canonical forms, Karnaugh maps, and their manipulation. It then defines binary variables, logic operations like AND, OR and NOT, and how binary logic functions are represented. Truth tables are introduced for logic operators like AND, OR and NOT. Logic gates are described as abstractions of electronic components. A timing diagram demonstrates signal propagation through gates. Combinational logic circuits are discussed, showing how to construct a circuit from a logic function by connecting gates based on the function's logic operations. The document concludes by assigning a homework to find datasheets for specified CMOS and TTL logic IC series.

Uploaded by

Jimran Leo
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

RANGKAIAN LOGIKA

TE 2214
Materi Kuliah ke-4 LOGIC GATE

Overview
Binary logic and Gates Boolean Algebra Standard and Canonical Forms Karnaugh Maps (K-Maps) K-Map Manipulation
2, 3, 4, and 5 variable maps Simplification using K-Maps Implicants: Prime, Essential Dont Cares Basic Properties Algebraic Manipulation

Minterms and Maxterms (Canonical forms) SOP and POS (Standard forms)

Binary Logic
Deals with binary variables that take 2 discrete values (0 and 1), and with logic operations Three basic logic operations:
AND, OR, NOT

Binary/logic variables are typically represented as letters: A,B,C,,X,Y,Z

Binary Logic Function


F(vars) = expression Operators ( +, , ) Variables Constants ( 0, 1 ) Groupings (parenthesis)

set of binary variables

Example: F(a,b) = ab + b G(x,y,z) = x(y+z)

Basic Logic Operators


1-bit logic AND resembles binary multiplication:
0 0 = 0, 1 0 = 0, 0 1 = 0, 11 =1

1-bit logic OR resembles binary addition, except for one operation:


0 + 0 = 0, 0 + 1 = 1, 1 + 0 = 1, 1 + 1 = 1 ( 102)

Truth Tables for logic operators


Truth table: tabular form that uniquely represents the relationship between the input variables of a function and its output 2-Input AND 2-Input OR

A 0 0 1 1

B F=AB 0 0 1 0 0 0 1 1

A 0 0 1 1

B F=A+B 0 0 1 1 0 1 1 1

NOT

A F=A 0 1 1 0

Truth Tables (cont.)


Q: Let a function F() depend on n variables. How many rows are there in the truth table of F() ?
A: 2n rows, since there are 2n possible binary patterns/combinations for the n variables

Logic Gates
Logic gates are abstractions of electronic circuit components that operate on one or more input signals to produce an output signal.
2-Input AND A B F A B 2-Input OR G NOT (Inverter) A H

F = AB

G = A+B

H = A

Timing Diagram
t0 t1 t2 t3 t4 t5 t6 Input signals A B F=AB G=A+B H=A
1 0 1 0 1 0 1 0 1 0

Transitions Basic Assumption: Zero time for signals to propagate Through gates

Gate Output Signals

Combinational Logic Circuit from Logic Function


Consider function F = A + BC + AB A combinational logic circuit can be constructed to implement F, by appropriately connecting input signals and logic gates:
Circuit input signals from function variables (A, B, C) Circuit output signal function output (F) Logic gates from logic operations

C A B F

Combinational Logic Circuit from Logic Function (cont.)


In order to design a cost-effective and efficient circuit, we must minimize the circuits size (area) and propagation delay (time required for an input signal change to be observed at the output line) Observe the truth table of F=A + BC + AB and G=A + BC Truth tables for F and G are identical same function Use G to implement the logic circuit (less components)
A 0 0 0 0 1 1 1 1 B 0 0 1 1 0 0 1 1 C 0 1 0 1 0 1 0 1 F 1 1 1 1 0 0 1 0 G 1 1 1 1 0 0 1 0

Combinational Logic Circuit from Logic Function (cont.)


C A B F

C B A G

TUGAS 4
CARI DATA SHEET DARI IC CMOS & TTL SERIES DI INTERNET :
--------------------------------------------------------------------------------------------------

74LS00, 74LS02, 74LS04, 74LS08, 74LS10, 74LS11, 74LS20, 74LS21, 74LS27, 74LS30, 74LS32, 74LS86

You might also like