National Institute of Technology Rourkela

राष्ट्रीय प्रौद्योगिकी संस्थान राउरकेला

ଜାତୀୟ ପ୍ରଯୁକ୍ତି ପ୍ରତିଷ୍ଠାନ ରାଉରକେଲା

An Institute of National Importance
NIT Rourkela Inside Page Banner

Syllabus

Course Details

Subject {L-T-P / C} : EC2002 : Digital Electronics { 3-0-0 / 3}

Subject Nature : Theory

Coordinator : Manish Okade

Syllabus

Module 1 :

Module 1: Introduction to Digital Electronics
Number Systems, Boolean Algebra, Logic Gates, Canonical and Standard Forms, NAND and NOR implementation, Logic Simplification, Optimized Implementation of Logic Functions: Karnaugh Maps (3-var, 4-var, 5-var), Quine McCluskey Table method.

Module 2: Combinational Circuits
Introduction, design procedure, binary adders-subtractor (half/full adder, half/full subtractor, binary adder-subtractor, decimal adder), carry look ahead adders, binary multipliers, magnitude comparator, code conversions, decoders, encoders, priority encoders, multiplexers, de-multiplexers, parity generators and checkers.

Module 3: Sequential Circuits
Introduction, storage elements: Latches (SR and D), Flip-Flops (SR, JK, D, T, Master-Slave), race conditions, analysis of sequential circuits, state reduction and assignment, registers, shift registers, synchronous counters, ripple counters, other counters.

Module 4: Synchronous & Asynchronous Circuits
Design of synchronous and asynchronous sequential circuits, Design of Finite State Machines (FSM): state table, state assignment, state reduction. Brief introduction to Mealy and Moore machines.

Module 5: Memory & Storage Elements
Random-access memory, read-only memory, programmable read-only memory, erasable programmable read-only memory, Electrically Erasable Programmable Read-Only Memory, Static & Dynamic Memory, Cache Memory, Virtual Memory Basics, Memory decoding.

Course Objective

1 .

Convert between different number systems (binary, decimal, octal, hexadecimal).

2 .

Use Boolean algebra and Karnaugh maps (K-maps) and Quine McCLuskey method for simplification.

3 .

Design and analyze adders, subtractors, multiplexers, demultiplexers, encoders, and decoders.

4 .

Design and analyze latches and flip-flops (SR, JK, D, T), finite state machines and their applications.

Course Outcome

1 .

CO1: Understand number systems, logic gates and Boolean expression simplification.
CO2: Design and analyse combinational circuits.
CO3: Design and analyse sequential circuits.
CO4: Design and analyse finite state machines.
CO5: Understand and design memory blocks.
CO6: Apply Digital Circuits in Real-World Applications.

Essential Reading

1 .

M. Morris Mano and Michael D. Ciletti, Digital Design, Pearson , 5th Edition

2 .

ZVI Kohavi and Niraj K. Jha, Switching and Finite Automata Theory, Cambridge , 3rd Edition

Supplementary Reading

1 .

J. F. Wakerly, Digital Design Principles and Practices, Prentice-Hall

2 .

R. L. Tokheim, Digital Electronics: Principles And Applications, McGrawhil