Course Objectives
At the completion of this course, students will be able to
1) Understand the design method of the combinational circuit, and design a specific circuit.
2) Understand the design method of the sequential circuit , and expresse by state transition diagram and state transition table.
Rubric
| Ideal Level of Achievement | Standard Level of Achievement | Unacceptable Level of Achievement) |
| Derivation of the logical function | Can derive the optimal logic function by using the Quine-McCluskey algorithm almost perfectly. | Can derive the optimal logic function by using the Quine-McCluskey algorithm correctly. | Can't derive the optimal logic function by using the Quine-McCluskey algorithm correctly. |
| Design of synchronous sequential circuits | Can understand A state transition table and a characteristic equation almost perfectly. | Can understand A state transition table and a characteristic equation correctly. | Can't understand A state transition table and a characteristic equation correctly. |
Assigned Department Objectives
MCCコア科目
See
Hide
ディプロマポリシー 1
See
Hide
Teaching Method
Outline:
Students recheck logic circuits.
Students learn about the optimization design of combinational circuits and order circuits.
Style:
Lectures led by teacher.
Notice:
The recognition of credit requires 60 points or more rating.
Course Plan
|
|
|
Theme |
Goals |
| 1st Semester |
| 1st Quarter |
| 1st |
Syllabus description. Digital representation of
information.
|
Can explain the digital representation of the information.
|
| 2nd |
Basic logic gates and logic circuits. |
Can represent a logical function as a logical expression.
|
| 3rd |
Various theorems of Boolean algebra. |
Can represent logical expressions as combinational logic circuits.
|
| 4th |
Standard system of logical functions. |
Can be expressed in principal disjunctive canonical form or principal conjunctive canonical form.
|
| 5th |
Simplification by Kamaugh diagram. |
Can simplify a logic function by Kamaugh diagram.
|
| 6th |
Simplification by Quine-McCluskey algorithm. |
Can simplify a logic function by Kamaugh diagram.
|
| 7th |
Simplification when there is the presence of a combination inhibition term.
|
Can simplify a logic function by Quine-McCluskey algorithm.
|
| 8th |
Semester midterm exam. |
Midterm examination.
|
| 2nd Quarter |
| 9th |
Method of representation of the sequential circuit. |
Can express sequential circuits by state transition and state transition tables.
|
| 10th |
Characteristic equation of a flip-flop. |
Can explain the characteristic equation of a flip flop.
|
| 11th |
Input equation for the flip-flop. |
Can explain the input equation of a flip flop.
|
| 12th |
Input equation for the flip-flop. |
Can design other flip-flops using flip flops.
|
| 13th |
Design of a flip-flop.
|
Can explain the operation of basic sequential circuits.
|
| 14th |
Examples (1) of synchronous sequential circuitry. |
Can explain how to design a synchronous sequential
circuit.
|
| 15th |
Semester final exam. |
Terminal examination.
|
| 16th |
Return and explanation of the final exam. |
Return of the final exam.
|
Evaluation Method and Weight (%)
| Midterm exam | Final exam | Submissions. | Behavior | Portfolio | Other | Total |
| Subtotal | 25 | 50 | 25 | 0 | 0 | 0 | 100 |
| Basic Ability | 25 | 50 | 25 | 0 | 0 | 0 | 100 |
| Technical Ability | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| Interdisciplinary Ability | 0 | 0 | 0 | 0 | 0 | 0 | 0 |