As fundamentals for design of computer architectures, basics of computer hardware such as functions and characteristics of MOS transistor and constitution of logic gates are given. Mathematics and theories to understand logic circuits such as Boolean algebra, characteristics of logic functions, sequential circuit are studied. With these background knowledge, design techniques for logic and sequential circuits, simplification, unification and decomposition of the circuits are studied.
Binary operation of MOS transistor is studied. It is applied to constitute logic gates and their characteristics are studied. Designing techniques for logic and sequential circuits are studied with simplification, unification and decomposition methods.
MOS transistor, Logic gate, Logic circuit, Boolean algebra, Sequential Circuit and Simplification of logic circuits
|✔ Specialist skills||Intercultural skills||Communication skills||Critical thinking skills||✔ Practical and/or problem-solving skills|
Lecture and reports to check the understanding. Lecture is given through active-learning and interactive discussions between lecturers and students. Evaluation is done by the reports, interaction and participation in the lecture, and the final exam.
|Course schedule||Required learning|
|Class 1||LSI and MOS transistor||Study behaviors of transistor as a basic element of LSIs|
|Class 2||Structure and behavior of logic gates of CMOS transistors and Flip-Flops||Study features of CMOS logic circuits and Flip-Flops|
|Class 3||Boolean algebra and logic functions||Study Boolean algebra and Logic functions as mathematical basis of logic circuits|
|Class 4||Minterm expression, Maxterm expression and Reed Muller expression||Study typical representations of logic functions|
|Class 5||Simplification of logic circuits: Karnaugh's map||Study Karnaugh's map as a simplification technique for logic circuits|
|Class 6||Simplification of logic circuits: Quine-Mclusky's method||Study Quine-Mclusky's method as a simplification technique for logic circuits|
|Class 7||Summary of the first half of the course||Summarize the first half of the course|
|Class 8||Introduction of sequential circuit(constitution of sequential circuit)||Principals, features and applications of sequential circuits|
|Class 9||Representation of sequential circuit by state transfer function and state transition graph||Study how sequential circuits are represented by equations and graphs and how the states are represented by binary vectors|
|Class 10||Flip-Flops and their driving circuits||Study the ways of designing the circuits containing Flip-Flops for applications|
|Class 11||Simplification of the driving circuits for Flip-Flops||Study the ways of simplifying the circuits containing Flip-Flops for applications|
|Class 12||Counter and Pseudo random number generator by sequential circuit||Study applications of sequential circuits such as Counter nad Pseudo-random-number-generator|
|Class 13||Simplification of sequential circuit by unification of equivalent states||Study the methods to find the equivalent states and to simplify the sequential circuits by unifying the equivalent states|
|Class 14||Summary of the second half of the course||Summarize the second half of the course|
To enhance effective learning, students are encouraged to spend approximately 100 minutes preparing for class and another 100 minutes reviewing class content afterwards (including assignments) for each class.
They should do so by referring to textbooks and other course material.
Digital Circuit, Tsuyoshi Isshiki, Itsuo Kumazawa, 2011, 2100yen
Textbook) Switching Circuit Theory, 1986, 2100yen
Reference) Logic Circuit, Naofumi Takagi, 2415yen
Evaluation is done by the reports, interaction and participation in the lecture, and the final exam