Registers and Counters
Hasan Zidan Department of Electrical Engineering AUST
1
D-FF Register
0 ->1 0 ->1 0 ->0 0 ->1
Q'3 CLR CK
Q3
Q'2 CLR
Q2
Q'1 CLR
Q1
Q'0 CLR
Q0
D3
CK
D2
CK
D1
CK
D0
Clock Clear
1
1
Latches d Fli Fl L t h and Flip-Flops
Hasan Zidan Department of Electrical Engineering AUST
1
Sequential Systems
A combinational system is a system whose outputs depend only upon its current inputs.
Programmable Logic g g Devices (c)
Hasan Zidan Department of Electrical Engineering AUST
1
Programmable Logic
Other ways to implement a logic function than to hook together discrete 74XX packages or
Multiplexers, Multiplexers Decoders
Hasan Zidan Department of Electrical Engineering AUST
Multiplexers 2/1 Multiplexer (MUX)
Data Inputs I0 I1 S Z if S = 0, then Z = I0 if S = 1, then Z = I1
Control I
Multiplexers, Multiplexers Decoders
Hasan Zidan Department of Electrical Engineering AUST
When designing a multiple Output Network
Try to minimize the total number of gates required If several soluti
Multi-level Gate Circuit M lti l l G t Ci it
Hasan Zidan Department of Electrical Engineering AUST
1
MULTI-LEVEL GATE NETWORKS
The maximum number of gates cascaded in series between a network input a
Karnaugh Maps
Hasan Zidan Department of Electrical Engineering Department of Electrical Engineering AUST
1
Karnaugh Map Minimization
Karnaugh Map ( K-map) minimization is a visual g p (or p) minimiza
Applications of BOOLEAN ALGEBRA
Hasan Zidan Hasan Zidan Department of Electrical Engineering AUST
1
Combinational logic
One or more digital signal inputs O or more digital signal outputs One di it l
BOOLEAN ALGEBRA
Continued
Hasan Zidan Department of Electrical Engineering Department of Electrical Engineering AUST
1
Exclusive-OR function
One gate type is the XOR Gate (Exclusive OR gate). A XOR F
BOOLEAN ALGEBRA
Hasan zidan Department of Electrical Engineering AUST
1
Introduction
Basic mathematics for the study of logic design is Boolean Algebra by George Boole 1847. Basic laws of Boolean Alg
Introduction, Introduction Number systems and Conversion (C)
Hasan Zidan Department of Electrical Engineering AUST
1
One's Complement Representation p p
One's complement is another way to represent si
Introduction, Number systems y and Conversion (B)
Hasan Zidan Department of Electrical Engineering AUST
1
Binary Arithmetic
The rules for binary (+) arithmetic are: 0 + 0 = 0, carry = 0 1 + 0 = 1, car
Introduction, Number ntroduct on, systems and Conversion (A)
Hasan Zidan Department of Electrical Engineering AUST
1
Outline
Syllabus Prerequisite, top cs e equ s te, topics
Computer Applications(1041