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
Intercultural skills | Communication skills | ✔ Specialist 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 of logic gates of MOS transistors, Boolean algebra and logic functions | Study features of CMOS logic circuits and Boolean algebra and Logic functions as mathematical basis of logic circuits |
Class 3 | Minterm expression, Maxterm expression and Reed Muller expression | Study typical representations of logic functions |
Class 4 | Simplification of logic circuits: Karnaugh's map | Study Karnaugh's map as a simplification technique for logic circuits |
Class 5 | Simplification of logic circuits: Quine-Mclusky's method | Study Quine-Mclusky's method as a simplification technique for logic circuits |
Class 6 | Summary of the first half of the course | Summarize the first half of the course |
Class 7 | Introduction of sequential circuit(constitution of sequential circuit) | Principals, features and applications of sequential circuits |
Class 8 | 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 9 | Elements of sequential circuit : Flip Flop (Difference from delay element) | Study about the basic memory elements of sequential circuit : Flip Flop. |
Class 10 | Flip-Flop circuits by CMOS | Study how Flip-Flops are represented by CMOS circuits. |
Class 11 | Counter and Pseudo random number generator by sequential circuit | Study applications of sequential circuits such as Counter nad Pseudo-random-number-generator. |
Class 12 | Driving circuit for Flip-Flop and simplification of the circuit | Study the ways of designing and simplifying the circuits containing Flip-Flops for applications |
Class 13 | Driving circuit for Flip-Flop and simplification of the circuit(practice) | Experince the application examples of designing and simplification of circuits containing Flip-Flops |
Class 14 | 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 15 | Summary of the second half and exercise | Summarize the second half of the course and solve problems as exercises. |
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
No prerequisites