3
TE 242: Digital Electronics for Engineers I – 2.0 units Course Description  The objective of the course is to build the students with the basic tools used in designing and analysing basic digital circuits. The course also introduces the concept of Finite State Machine ( FSM) and CAD of digital circuits. Objectives 1. To enable students understand the binary and hexadecimal numbering systems. 2. To enable students be able to design combinational logic systems using basic logic gates. 3. To enable students be able to optimize logic designs using Boolean algebra and Karnaugh maps 4. To enable students be able to design simple sequential circuits 5. To introduce the concept of Finite State Machine (FSM) and CAD of digital circuits ____________________ COURSE CONTENTS __________________ Introduction to digital technology and digital electronics: digital vs analog world, digital systems Nu mber systems: numeric al representat ions, di ff erent bases (binary, oc tal , hexadecimal, BCD), conversion between the different bases. Basic logic gates and Boolean algebra: Boolean constants and variable, OR operation, AND operation, NOT operation, NOR operation, NAND operation, truth tables, basic logic gates, Boolean al gebra postulates and theorems, DeMorgan’s theorem, Boolean expression from simple combinational logic circuits, EX-OR gate, EX-NOR gate. Desig n of combi nat ion al logic cir cuits: defi ni ti on, SoP and PoS representat ion, canonical maxiterm/minterm expressions, algebr aic simpli fic ation of logic cir cuits, Karnaugh method, don’t cares, decoders, encoders, multi plexers. Sequen tial logic circuits: definition, Flip-flops, NAND latch, NOR latch, clock signal and cl oc ked fl ip-f lo ps, SR-FF, JK-FF, D- FF , sy nchr onous inputs, asynchronous inputs, master/slave FF, flip-flop applications, asynchronous and synchronous counters,  Concept of finite state machine (FSM) CAD of digital circuits. Recommended References/Te xtbooks 1. Ronald J. Toc ci, “ Digit al Sy stems: Pr incip les an d Appl icati ons, “ Prent ice-Hal l, 5 th Ed. 1991. 2. Alan C. Dixon a nd Jame s L. Ant onakos , “Pra ctica l Appro ach to Di gital Elect ronics , Prent ice Hal l, 1999. 3. Nigel P. Cook, “Int roduct ory Digit al El ectronics, “Pr entic e Hall , 1997 4. Myke Pre dko, “Digita l Elec tro nic s Demysti fie d”, McGraw Hi ll, 2004 5 Dal e R. Patr ick, Steph en W. Fard o and Vigy an Chand ra, “Electronic Di git al Sys tem Fundamentals”, Fairmont Press, 2007. 6 V.M. Rao and P. K. Sri vastava, “Fundament als of Di gi ta l El ectroni cs and it s Appl ic at ions”, BPB Publications, 2006 7 Nigel P. Cook , “A Fi rst Course i n Digital Ele ctr onics” , Pre nti ce Hal l, 1998.

00 TE 242 -Syllabus_n_Schedule

Embed Size (px)

Citation preview

Page 1: 00 TE 242 -Syllabus_n_Schedule

8/6/2019 00 TE 242 -Syllabus_n_Schedule

http://slidepdf.com/reader/full/00-te-242-syllabusnschedule 1/2

TE 242: Digital Electronics for Engineers I – 2.0 unitsCourse Description

The objective of the course is to build the students with the basic tools used in designingand analysing basic digital circuits. The course also introduces the concept of Finite StateMachine ( FSM) and CAD of digital circuits.

Objectives1. To enable students understand the binary and hexadecimal numbering systems.

2. To enable students be able to design combinational logic systems using basic logic gates.3. To enable students be able to optimize logic designs using Boolean algebra and Karnaughmaps

4. To enable students be able to design simple sequential circuits5. To introduce the concept of Finite State Machine (FSM) and CAD of digital circuits

____________________ COURSE CONTENTS __________________

Introduction to digital technology and digital electronics: digital vs analog world,digital systems

Number systems : numerical representations, different bases (binary, octal,hexadecimal, BCD), conversion between the different bases.

Basic logic gates and Boolean algebra : Boolean constants and variable, OR operation,AND operation, NOT operation, NOR operation, NAND operation, truth tables, basic logicgates, Boolean algebra postulates and theorems, DeMorgan’s theorem, Booleanexpression from simple combinational logic circuits, EX-OR gate, EX-NOR gate.

Design of combinational logic circuits : definition, SoP and PoS representation,canonical maxiterm/minterm expressions, algebraic simplification of logic circuits,Karnaugh method, don’t cares, decoders, encoders, multiplexers.

Sequential logic circuits : definition, Flip-flops, NAND latch, NOR latch, clock signal andclocked flip-flops, SR-FF, JK-FF, D-FF, synchronous inputs, asynchronous inputs,master/slave FF, flip-flop applications, asynchronous and synchronous counters,

Concept of finite state machine (FSM)

CAD of digital circuits.

Recommended References/Textbooks1. Ronald J. Tocci, “Digital Systems: Principles and Applications, “Prentice-Hall, 5 th Ed. 1991.

2. Alan C. Dixon and James L. Antonakos, “Practical Approach to Digital Electronics, Prentice Hall, 1999.3. Nigel P. Cook, “Introductory Digital Electronics, “Prentice Hall, 19974. Myke Predko, “Digital Electronics Demystified”, McGraw Hill, 20045 Dale R. Patrick, Stephen W. Fardo and Vigyan Chandra, “Electronic Digital System Fundamentals”,

Fairmont Press, 2007.6 V.M. Rao and P.K. Srivastava, “Fundamentals of Digital Electronics and its Applications”, BPB

Publications, 20067 Nigel P. Cook, “A First Course in Digital Electronics”, Prentice Hall, 1998.

Page 2: 00 TE 242 -Syllabus_n_Schedule

8/6/2019 00 TE 242 -Syllabus_n_Schedule

http://slidepdf.com/reader/full/00-te-242-syllabusnschedule 2/2

TE 242: Digital Electronics for Engineers I – 2.0 unitsSemester 2 – 2010/2011

____________________ TENTATIVE COURSE SCHEDULE __________________

Session

Topics Remarks

01 Introduction to digital technology and digital electronics: digital vs. analog world,

digital systems02 Number systems: numerical representations, different bases (binary, octal, hexadecimal,

BCD), conversion between the different bases

03Basic logic gates and Boolean algebra : Boolean constants and variable, OR operation,AND operation, NOT operation, NOR operation, NAND operation, truth tables, basiclogic gates, Boolean algebra postulates and theorems, DeMorgan’s theorem, Booleanexpression from simple combinational logic circuits, EX-OR gate, EX-NOR gate

04Basic logic gates and Boolean algebra : Boolean constants and variable, OR operation,AND operation, NOT operation, NOR operation, NAND operation, truth tables, basiclogic gates, Boolean algebra postulates and theorems, DeMorgan’s theorem, Booleanexpression from simple combinational logic circuits, EX-OR gate, EX-NOR gate

04.5 Quiz (Saturday, May 21 st – 08:30~09:30) 5%

05Design of combinational logic circuits: definition, SoP and PoS representation, canonical

maxiterm/minterm expressions, algebraic simplification of logic circuits, Karnaughmethod, don’t cares, decoders, encoders, multiplexers

06Design of combinational logic circuits: definition, SoP and PoS representation, canonicalmaxiterm/minterm expressions, algebraic simplification of logic circuits, Karnaughmethod, don’t cares, decoders, encoders, multiplexers

06.5 Quiz (Saturday, June 11 th – 08:00~09:30) 5%

07 Sequential logic circuits : definition, Flip-flops, NAND latch, NOR latch, clock signal andclocked flip-flops, SR-FF, JK-FF, D-FF, synchronous inputs, asynchronous inputs,master/slave FF, flip-flop applications, asynchronous and synchronous counters

08Sequential logic circuits : definition, Flip-flops, NAND latch, NOR latch, clock signal andclocked flip-flops, SR-FF, JK-FF, D-FF, synchronous inputs, asynchronous inputs,master/slave FF, flip-flop applications, asynchronous and synchronous counters

09 Concept of finite state machine (FSM)

10 CAD of digital circuits10.5 Test (Saturday, June 25 th – 08:00~10:00) 20%

Assessment: CA (40%) - Test (20%) + 3 Quizzes (5% each) + Homeworks/Presentations/Projects/Viva voce (5%)UE (60%) – End of the semester – strictly covering the whole syllabus and all the lectures

MAY JUNE JULY

Mo

Th

Sat

Th

F Sat

Th

F Sat

Th

F Sat

Th

F Sat

Th

F Sat

Th

F Sat

Th

F Sat Th

F Sat Th

2 5 7 12

13

14

19

20

21

26

27

28

2 3 4 9 10

11

16

17

18

23

24

25 30

1 2 7

L L L L T L L T Q L T L L T L L T Q L T L L T Test

L T Presentation

SS