Download cse231 digital logic design and more Lecture notes Digital Logic Design and Programming in PDF only on Docsity!
Department of Electrical and Computer Engineering North South University, Bashundhara, Dhaka-1229, Bangladesh CSE231, (2 Sections) Course Number and Title: EEE231–Digital Logic Design CSE231L Digital Logic Design Laboratory Credits: 3 + 0 = 3 Credits Semester : Summer 2021 Course Type: Required, Engineering, Lecture + Lab Contact Hours: Lecture – 3 Hours/week, Lab – 3 Hours/week Instructor(s) : Dr. Mohammad Monirujjaman Khan Office: SAC 1027, Phone: 55668200,Ext. 1565 Email: [email protected] Course Schedule/Timing : ST 4.20 PM - 5:50 PM Class Room : SAC 309 Grading policy: Attendance: 3% Quizzes: 15% Assignment: 2% Project: 20% Midterm exam: 15% Final exam: 25% Lab: 20 % May be changed based on UGC and University Decision. Office Hours and Location : Please email me. Office hour location is the same as the Instructor’s office location Textbook : Thomas L. Floyd, “Digital Fundamentals” 8 th edition, Prentice Hall. Digital Design By M. Morris Mano, 5th^ Edition, ISBN 01- Reference(s) : M. Morris Mano, “Digital Logic & Computer Design” Prentice Hall. Digital Logic Techniques, T J Stonham, 3rd^ Edition Digital Design Principles & Practices by John F Wakerly, 4th^ Edition Fundamentals of Digital Logic with VHDL design, Stephen Brown and ZvonkoVranesic, 2nd^ Edition
Please read my lecture notes, suggested book and suggested extra
materials.
Course Learning Outcomes (ABET Criteria): The students who complete this course should have: b) Experiment & Interpretation: an ability to design and conduct experiments of engineering problems, as well as to analyze and interpret data c) Design: an ability to design a system, component, or process to meet desired needs within realistic constraints such as economic, environmental, social, political, ethical, health and safety, manufacturability, and sustainability. Course Summary: This course provides an introduction to logic design and basic tools for the design of digital logic systems. A basic idea of number systems will be provided, followed by a discussion on combinational logic: logic gates, Boolean algebra, minimization techniques, arithmetic circuits (adders, subtractors), basic digital circuits (decoders, encoders, multiplexers, shift registers), programmable logic devices (PROM, PAL, PLA). The course will then cover sequential circuits: flip-flops, state transition tables and diagrams, state minimization, state machines, design of synchronous/asynchronous counters, RAM/ROM design. An introduction to programmable logic will also be provided. Hands-on experience will be provided through project on design of a sequential logic system. This course has separate mandatory laboratory session every week as CSE 231L. Objective: The objectives of this course are a. to introduce Boolean logic operation and Boolean Algebra b. to teach students how to use Boolean Algebra and K-maps to realize two-level minimal/optimal combinational circuits c. to exposed students in the introductory design process of combinational and sequential circuits d. to teach the operation of latches, flip-flops, counters and registers. e. to explain how to analyze and design sequential circuits built with various flip-flops. f. to introduce using simulation tool for digital system design. g. Course Outcomes (COs): Upon successful completion of this course, students will be able to Sl. CO Description Weightage (%) CO1 apply principles of Boolean algebra to logic functions. 10% CO2 use K-maps to realize two-level minimal/optimal combinational circuits with up to 4-5 variables
CO3 construct gate-level implementation of a combinational logic function using fundamental logic gates (AND/OR/NOT), Multiplexers, Decoders and Programmable logic gates (ROMs, PLAs and PALs)
sequential circuits Psychomotor/ Precision Project By the end of the course the student will be able to: Acquire the concept of number systems and switching algebra Minimize area and timing of a digital circuit Use off the shelf ICs to design circuit Build finite state machine using sequential circuits Design circuits using memory componentsand PLDs Topics covered and level of coverage : (Subject to change by the instructor) Course Description/Course syllabus: Introductory Digital Concept: Digital and Analog Quantities, Binary Digits, Logic Level and Digital Waveforms. Binary Logic, Logic Gates and their Truth Table. Number Systems, operations and Different Digital Codes Minterm and maxterm, SOP, POS, SSOP and SPOS and DLD design problem Boolean Algebra Logic Simplifications Combinational Logic Circuit Design and Functions Minimization Techniques Universal Gates and Their Applications. Combinational Logic with MSI and LSI Adders and Subtractors, LAC and Binary Multiplier Comparator Circuit Decoders and Encoders, Parity Generators/Checkers Multiplexers and Demultiplexers, Boolean Function Implementation Using Multiplexer Flip-flops and Related Devices, Sequential Logic Circuit Counters: Asynchronous and Synchronous Counters and Their Applications, Binary Up-Down Counter, Ripple Counter.
State Diagram, State Table, State Equation, State Reduction, Cascaded Counters, Counter Applications, Counter Decoding. Shift Registers, Basic Shift Register Functions, Different types of Shift Registers. Shift Register Counters. Johnson counter, Ring counter. Memory Unit/Devices. RAM design, Programmable logic devices (PROM, PAL, PLA). Lecture Plan Topic Lecture Assessment Introductory Digital Concept: Digital and Analog Quantities, Binary Digits, Logic Level and Digital Waveforms.
Binary Logic, Logic Gates and their Truth Table, Basic combinational circuit using logic gates, truth table, Boolean equation and circuit building from Boolean equation
Numbering system and conversion, BCD, Excess 3, Sign number, basic addition, subtraction, and multiplication
Minterm and Maxterm, SOP, POS, SSOP and SPOS and DLD design problem.
Boolean Algebra 5 Logic Simplifications 6 Combinational Logic Circuit Design and Functions. Design problem solve.
Minimization Techniques (K-Map and others) 8 Quiz 1 Universal Gates and Their Applications. 9 Combinational Logic with MSI and LSI 10 Adders and Subtractors, carry-look-ahead generator (CLA), and Binary Multiplier.
Comparator Circuit 12 Decoders and Encoders, Parity Generators/Checkers, Seven Segment Display, Project discussion 13 Assign project topic Multiplexers and Demultiplexers, Boolean Function Implementation Using Multiplexer
15 Mid Exam (After covering lecture 14) Latch, Flip-flops and Related Devices, Sequential Logic Circuit, Timing diagram
Application of flip flop, Counters: Asynchronous and Synchronous Counters and Their Applications, Binary Up-Down Counter, Ripple Counter, 17 Project truth table, k map and circuit building for combinational part M-counter, Irregular counter design, Counter Decoding. 18 Project software and hardware circuit complete using logisim and required ICs
Quiz 2:
Decoders and Encoders, Parity Generators/Checkers, Seven Segment Display, Project discussion
Multiplexers and Demultiplexers, Boolean Function Implementation Using Multiplexer
Latch, Flip-flops and Related Devices, Sequential Logic Circuit, Timing diagram
Application of flip flop, Counters: Asynchronous and Their Application
A sample question is provided.
Quiz 3:
Synchronous Counters
Shift Register Counters. Johnson counter, Ring counter
Memory Unit/Devices.
RAM Design
A sample question is provided.
Mid-term questions (mention chapter(s)/topic(s) for each question)
Q. 1. (a) Numbering system and conversion, (b) Numbering system and conversion (c) BCD conversion addition/ Excess 3/ Sign number Q. 2. Adders and Subtractors, carry-look-ahead generator (CLA) Q. 3. Minimization Techniques (K-Map)+SSOP and Boolean algebra Q. 4. Minterm and Maxterm, SOP, POS, SSOP and SPOS and DLD design problem. Q. 5. Combinational Logic Circuit Design and Functions. Design problem solve. Q. 6. Decoder and seven segment display, universal gate Q. 7. Multiplexer/Demultiplexer A sample question is provided.
Final questions (mention chapter(s)/topic(s) for each question)
Q. 1. Analysis of sequential counter, State Diagram, State Table, State Equation, State Reduction Q. 2. Shift Register Counters. Johnson counter Q. 3. Synchronous Counters and irregular counter design Q. 4. (a) Memory Unit/Devices (b) Memory Unit/Devices and RAM (c) RAM Design
(d) RAM Design Q. 5. (a) PROM Truth Table (b) PROM Design Q. 6. PLA/PAL A sample question is provided.
Reference materials (including weblink)
Sometime I give youtube links for project and other lecture materials. Logisim download link for the lab and project work, 555 timer.
Lecture Slides (mention chapter/topic)
I use my own lecture slides as per lecture plan it has been designed. Lecture slides have
been provided.
Video(s) if any (mention chapter/topic)
Sometime I suggest my students to watch YouTube for some problem in assignment like K map, Boolean algebra, irregular counter design, seven segment display, 555 timer, and so on. Also for project.
Any other document shared in the class with the students
My lecture slides are well designed. Yes recommended book. For project I share extra material which we have designed very well. Project lecture material has been provided. Attendance Policy: Attendance in classes is integral to the success of a student in this course. Nevertheless, i f a student needs to miss a class for unavoidable reasons, the student must e-mail the instructor prior to the class period stating the reason for being absent. In case the student fails to notify the instructor because of illness or other unavoidable reasons, certification such as a doctor’s certificate may be necessary to get the absence excused. A partial unexcused absence may result from the following behaviors: A weak excuse for missing the class for which a prior e-mail message was sent Coming late or leaving early Disruptive behavior that results in instructor asking the student to leave for the rest of the period. General Rules :
- The instructor has the right to modify, add, or remove topics in the syllabus.
- No one is exempt from any test, homework, quiz, and final exam.
- Use of cell phones in the class or lab is not permitted.
- A student who is absent from a class is responsible for obtaining knowledge of what happened in the class, especially information about announced tests, papers, or other assignments.
