2016 Switching Circuit Theory

Font size  SML

Register update notification mail Add to favorite lecture list
Academic unit or major
Computer Science
Hara Yuko 
Class Format
Lecture / Exercise     
Media-enhanced courses
Day/Period(Room No.)
Tue5-6(W323)  Fri1-4(W323)  
Course number
Academic year
Offered quarter
Syllabus updated
Lecture notes updated
Language used
Access Index

Course description and aims

As foundamentals 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 knowledes, design techniques for loigic and sequential circuits, simplification, unification and decomposition of the circuits are studied.

Student learning outcomes

Binary operation of MOS trangistor is studied. It is applied to constiutute logic gates and their characteristics are studied. Designing tecniques 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 circuit.

Competencies that will be developed

Specialist skills Intercultural skills Communication skills Critical thinking skills Practical and/or problem-solving skills

Class flow

Lecture and quizzes to check the understanding are interchangeably done. Lecture is given through active-learning and interactive discussions between lecturers and students. Evaluation is done by the quizzes, interaction and participation in the lecture, and the final exam.

Course schedule/Required learning

  Course schedule Required learning
Class 1 LSI and MOS transistor Behaviors of transistor as a basic element of LSI are studied.
Class 2 Structure of logic gates of MOS transistors and diodes Structure of logic gates composed of MOS transistors and diodes are studied.
Class 3 Features of CMOS logic circuits Features of CMOS logic circuits, such as performance, are studied.
Class 4 Boolean algebra and logic function As mathematical basis oflogic cuicuits, Boolean algebra and Logicfunction are studied.
Class 5 Minterm expression, Maxterm expression and Reed Muller expressuion Typical representations of logic function are studied.
Class 6 Simplification of logic circuits: Karnaugh's method Simplification technique for logic circuis: Karnaugh's method is studied,
Class 7 Simplification of logic circuits: Quine-Mclusky's method. Simplification technique for logic circuis: Quine-Mclusky's method is studied,
Class 8 Summary of the first half of the course. Examination of understanding. Summary of the first half of the course is given and an examination is conducted to check understanding.
Class 9 Introduction of Sequential Circuit Introduce the ideaof sequential circuits
Class 10 State transition function: Graph expression and state assignment. Statetransition function and its graph representation arestudied. StateaAssignment technique is also studied.
Class 11 Elements of sequential circuits: flip-flops and their characterstics. As elements for sequential circuits, flip-flops are introduced.
Class 12 Realization of flip-flops by CMOS circuits Flip-flops are shownto be constituted using CMOS logic gates.
Class 13 Examples of sequential circuits: Counters and Random number generators. As examples of sequential circuits,: counters and Random number generators are designed.
Class 14 Driving circuits for flip-flops for given specification of sequential circuits and their simplification In order to constitute the target sequential circuit, driving circuits for flip-flops are desined and simplified.
Class 15 Simplification of Sequential circuits by unifying equivalent states. In order to simplify sequential circuits, methods to unifiy equivalent states are studied.


Digital Circuit, Tsuyoshi Isshiki, Itsuo Kumazawa, 2011, 2100yen

Reference books, course materials, etc.

Textbook) Switching Circuit Theory, 1986, 2100yen
Reference) Logic Circuit, Naofumi Takagi, 2415yen

Assessment criteria and methods

Evaluation is done by the quizzes, interaction and participation in the lecture, and the final exam.

Related courses

  • GRE.C101 : Foundations of Computer Science I
  • GRE.C102 : Foundations of Computer Science II
  • ZUS.L201 : Basic Integrated Circuits
  • ICT.I216 : Computer Logic Design (ICT)
  • ZUS.L301 : Experiments on Computer Science III

Prerequisites (i.e., required knowledge, skills, courses, etc.)

No prerequisites


Contact by e-mail in advance to schedule an appointment

Page Top