1. CSNB163 Digital Logic Design
Course Introduction
Abdul Rahim Ahmad
(Associate Prof. Dr.)
College of CSI&IT
UNITEN

2. What is Digital Logic
Digital logic is the foundation of computers and many other electronic devices and control systems.
The whole of digital electronics depends on just 7 types of logic gates, connected together with a minimum of additional components.
Combinations of logic gates then form circuits that can perform specific tasks within larger circuits or systems.
The process of producing complex circuits using combinations of basic devices is called Combinational Logic.
There are many ways that a number of logic gates can be combined to perform a specific task. They may all work, but some combinations will perform the task that is better than others.
For example, a circuit designer may want to design a combinational logic circuit that uses the minimum number of gates, or performs the required task in the least time, or at the minimum cost.

3. 7 Logic Gates: AND, OR, NAND, NOR, NOT, XOR and XNOR.

4. 7 Logic Gates chips: AND, OR, NAND, NOR, NOT, XOR and XNOR.

5. Example Combinational Circuits
Example Circuit for BCD to 7 Segment Decoder ‘a’ Output

6. Synopsis
This aim of this course is to give students an understanding to the design and simplification of combinational logic circuits by introducing the concepts of logic gates and understanding the function representations in truth tables, timing diagrams, logic circuits and Boolean Expression.
In addition, this course includes an overview to different elements and properties of sequential logic circuits. Visualizations of different logic circuits designs. Karnaugh map simplifications are demonstrated in practical labs through the use of simulation tools.

7. Assessment Methods and Types
Course work:
Quizzes - 10%
Tutorials/Exercises - 10%
Assignments/Projects - 20%
Mid-Term Examination - 20%
Final Exam:
2 hours – 40 %

8. Contents Topic Logic Gates
Logic gates & logic functions representation
Truth table & timing diagram
Boolean Algebra and Logic Simplification
Basic Properties & Theorems of Boolean algebra
Simplification using Boolean algebra
Boolean Expression Representation
Standard forms of Boolean expression (Sum of Products & Product of Sum)
Canonical forms of Boolean expression (Sum of Minterms & Product of Maxterms)
Conversion between standard to canonical forms of Boolean Expression
Simplification using Karnaugh Maps
The Karnaugh Map minimization techniques
Don’t care terms in K-Map
Combinational Logic Analysis
Basic combinational logic circuits
Conversion to NAND/NAND and NOR/NOR
Network
Combinational Logic Circuits
Adders (Half Adder, Full Adder, Cascaded Adders)
Subtractor with Borrow (Half Subtractor, Full Subtractor, Cascaded Subtractors) Subtractor with 2’s Complement
Multiplier
Magnitude comparator
Encoder
Decoder
Sequential Logic Circuits
Latches
Edge-triggered flip-flop
Characteristics tables

9. Text Book
Main: "Digital Design", 5th Edition by Morris Mano, 2013, Pearson (Course Textbook). 4th Edition is available in softcopy over the internet
Additional: “Introduction to Logic Design”, 3rd Edition by Alan B. Marcovitz, 2010, Mgraw- Hill.