Synopsis


This course introduces procedures for the analysis and design of digital logic circuits.

Announcements

  • Information regarding the final exams
    • There are 30 questions in total.
      • Typo: question #29 on the actual exam: Change "Y <=" to "X <=".
    • The exam will have three parts (similar to the practice problems).
      • Part A: About 5 to 10 T/F questions
      • Part B: About 5 to 10 multiple-choice questions
      • Part C: About 10-20 questions.
    • Here is a pdf file containing (almost) all the post-midterm slides.
    • Here is the practice problems for the final exam.
    • Short Review + Q/A session:
      • We have done quite a bit of review in the last lecture.
      • There will be no new material presented in this extra session.
      • (Thai Session) Tuesday afternoon.
        • Room 414, main building, Rangsit,
        • 1:30-3:30 PM
      • (English session) Tuesday afternoon.
        • 3:30-4:30 PM
    • All the raw scores: CS and IT
    • Caution!
      • This exam is 40% of your grade. It can significantly improve your final grade.
      • Exam is straightforward.
      • Show the steps that you have done to arrive at the answers. If the answer comes out of nowhere, then you get no credit for that answer, even when it is correct.
      • Do not expect that my grading will be as lenient as on the midterm/HW/quiz.
      • If I specifically ask you to use a K-map, then you need to completely show the prime implicants and the product terms associated with them as well.
      • Use dark dot to indicates connection.
  • Caution: Because I grade only a few problems on your HW, you might get a high scores even when some of your answers are incorrect. Please check with the posted solutions. If your answers is different from the solution and you are not sure whether it can be an alternative solution, come and talk with me. DO NOT assume that it is correct. [Posted @ 3PM on Sep 26]
  • The slides from the final lecture is posted. [Posted @ 6PM on Sep 26]
  • HW10 solution is posted. Sorry for the delay. [Posted @ 3PM on Sep 26]
  • HW8 solution is posted. Sorry for the delay. [Posted @ 2PM on Sep 26]
  • HW9 scores and solution are posted. [Posted @ 5PM on Sep 21]
  • Some links to the videos shown in class are available below. [Posted @ 9AM on Sep 21]
  • A combined version of all post-midterm slides will be posted soon. [Posted @ 9AM on Sep 21]
  • HW10 is posted. [Posted @ 10:30AM on Sep 16]
  • HW9 is posted. [Posted @ 4:00PM on Sep 10]
  • For CS students, the scores for Quiz #4 is available here.The mean is 4.3. [Posted @ 3:30PM on Sep 7]
  • Typo in HW8 [Posted @ 4:30PM on Sep 4]:
    • For question #7, the question should read "Construct the counter as in problem 5.....".
    • An updated version of HW8 is posted.
  • The examples in lecture 22 are VERY important. Make sure that you understand them well. [Posted @ 9AM on Sep 4]
  • Handout for Lecture 21-22 is posted. [Posted @ 4:30PM on Sep 2]
  • HW8 is posted. [Posted @ 4:30PM on Sep 2]
  • The examples in lecture 21 are VERY important. Make sure that you understand them well. [Posted @ 10:30AM on Sep 2]
  • We will resume the lectures at the usual times this week. [Posted @ 4:30PM on Aug 29]
  • HW7 has two parts! Don't forget to do part A. [Posted @ 4PM on Aug 25]
  • All ECS371 lectures this week (Aug 24, 25, 27) are cancelled. Make-up lecture TBA (to be announced). [Posted @ 5PM on Aug 24]
    • Dr. Prapun will be @ NSTDA.
  • CS lecture on Monday is cancelled. Make-up lecture TBA (to be announced). [Posted @ 7PM on Aug 23]
    • Dr. Prapun will be @ NSTDA.
  • Some remarks about HW7 [Posted @ 10:30AM on Aug 21]:
    • For Q4 from Chapter 8, you may need additional gate. Explain your answer.
    • For Q8 from Chapter 8, CTEN = count enable. You can make an educated guess about its function from its name
  • HW7 is posted. [Posted @ 9AM on Aug 20]
  • For those in CS section, all the submitted quizes got full score! Good Job! [Posted @ 3PM on Aug 13]
  • HW6 is posted. [Posted @ 11AM on Aug 13]
  • No new handout today. We will use the old handout from last time. [Posted @ 9AM on Aug 10]
  • Midterm results is available [Posted @ 9AM on Aug 10]
  • Some information abot the midterm exam:
    • We will be distributed into 5 exam rooms (BKD32xx). During the exam time, I will visit each exam room regularly. If you have any questions during the exam, I think it is not necessary to ask the proctor to call for me. It might be better to work on another problem and wait until I visit your exam room.
    • It has 14 pages.
    • There are 23 problems.
      • 5 of these are T/F questions.
      • 4 of these are multiple-choice questions.
    • Here is the photo of the first page (cover page).
    • Here is an updated version of the pre-midterm slides.
    • Here is an updated version of the sample exam.
  • The scores for Quiz #2 are available. For CS people, please look here. For IT people, please look here. [Posted @ 9AM on July 27]
  • I create two documents to help you prepare for the midterm exam.The first one is in the format that the actual exam will probably follow. The second one gives you some more true/false and multiple choices problems. [Posted @ 2PM on July 22]
  • I combine all the pre-midterm slides into one file. There may be another updated version posted later in the week. [Posted @ 4:30PM on July 21]
  • HW5 is posted. It will not be graded; so you don't have to submit your solutions. I will posted the solution next week. [Posted @ 4PM on July 21]
  • Solution for Quiz #2 is available. [Posted @ 3PM on July 14]
  • No new HW this week. So, nothing to submit next week. [Posted @ 2PM on July 13]
  • For HW4, problem 30 is interesting but I forgot to put it in the list of to-do problem. So, you don't have to do it. However, since it is a decent question, I might try to find a way to put it in quiz/exam. [Posted @ 2PM on July 13]
  • HW4 is posted. [Posted @ 9AM on July 9]
  • The solution for HW2 is posted. [Posted @ 5PM on July 5]
  • We haven't talked about some of the material on HW3. Those materials should be covered in our next lecture. [Posted @ 3PM on July 2]
  • The solution for HW1 is posted. [Posted @ 9:30AM on June 29]
  • The scores for HW1 are available. For CS people, please look here. For IT people, please look here. The full score is 10. The first column indicates the last three digits of your ID. The second column indicates the score. [Posted @ 5PM on June 26]
  • Do not worry if you miss the attendance check on Thursday because of the acvivities for the SIIT day. Please provide me with some evidence that you participate in some events and you won't be counted as absence. [Posted @ 11:30AM on June 25]
  • HW2 is posted. [Posted @ 9AM on June 25]
  • The scores for Quiz #1 are available. For CS people, please look here. For IT people, please look here. The full score is 10. The first column is the last three digits of your ID. The second column indicates the score. [Posted @ 5PM on June 23]
  • For the lecture on Thursday (July 25), we will work on a lot of examples. I will try not to introduce any new concept. This is because some of us will participate in the SIIT day activities. [Posted @ 5PM on June 23]
  • I forgot to write down the name of the person (in CS section) who told me that the due date of HW1 should be on the 25th (not 24th). If you are that person, please come to me before/after lecture; so that I can give you the extra credit. [Posted @ 1:30PM on June 20]
  • The textbook is available downstairs! The price is about 700 Baht. [Posted @ 1:30PM on June 17]
  • A section about reading assignment is added below. [Posted @ 5PM on June 15]
  • HW1 is posted. [Posted @ 5PM on June 15]
  • Skip section 2-4 in the reading assignment. If you want, you may read the binary addition section because we cover that part a little bit in lecture. [Posted @ 4PM on June 11]
  • For IT students, sorry for the confusion I have about the room change. We will use the old room next time. [Posted @ 4PM on June 11]
  • Please check back regularly. [Posted @ 10AM on June 3]

General Information

Handouts and Course Material

Problem Set

  1. Problem Set 1
  2. Problem Set 2 (with scanned questions)
  3. Problem Set 3 (with scanned questions)
  4. Problem Set 4 (with scanned questions) - Skip problem 30.
  5. Problem Set 5 (Not due)
  6. Problem Set 6
  7. Problem Set 7
    • For Q4 from Chapter 8, you may need additional gate. Explain your answer.
    • For Q8 from Chapter 8, CTEN = count enable. You can make an educated guess about its function from its name.
    • Problem A.1 is graded.
    • Solution for Problem Set 7
  8. Problem Set 8
  9. Problem Set 9
  10. Problem Set 10

Calendar


Reading Assignment

  1. Chapter 1: 1-1, 1-2
  2. Chapter 2:
    • 2-1, 2-2, 2-3
    • 2.4 (only Binary Addition.)
    • 2-5, 2-6
    • 2-7 (addition and subtraction for signed numbers)
    • 2-10
  3. Chapter 3: Focus on 3-1 to 3-6
  4. Chapter 4: 4-1 to 4-9
  5. Chapter 5: 5-1 to 5-5
  6. Chapter 6: 6-1, 6-2, 6-5, 6-6, 6-8, 6-9
  7. Chapter 7: 7-1, 7-2, 7-4
  8. Chapter 8: 8-1, 8-2, 8-4, 8-5
  9. Chapter 9: 9-1 to 9-5
  10. Chapter 10: 10-1 to 10-3, 10-6
  11. Chapter 12: 12-1
  12. VHDL: 4-11, 5-7

Course Outline

  1. Introduction to digital circuits, number systems, signed numbers
  2. Logic gates and Boolean algebra (DeMorgan's theorem, truth tables)
  3. Combinational logic circuits (SOP and POS forms)
  4. Combinational logic circuits (Karnaugh maps)
  5. Arithmetic circuits (adders, subtractors, multipliers)
  6. MSI logic circuits (encoders, decoders, 7-segment LED, multiplexers, comparators)
  7. MIDTERM: 13:30 - 16:30 on Jul 30, 2009
  8. Sequential logic circuits (latches, flip-flop)
  9. Sequential logic circuits (analysis and design)
  10. Sequential logic circuits (counters, shift registers, digital filters)
  11. Memory and storage
  12. Programmable logic devices (PLD, FPGA)
  13. Hardware description language (HDL)
  14. Integrated Circuit Technologies
  15. FINAL: 13:30 - 16:30 on Oct 1, 2009

Misc. Links