2017 Switching Circuit Theory

Font size  SML

Register update notification mail Add to favorite lecture list
Academic unit or major
Undergraduate major in Computer Science
Instructor(s)
Miyazaki Jun  Yokota Haruo 
Course component(s)
Lecture
Mode of instruction
 
Day/Period(Room No.)
Tue7-8(W631)  Fri7-8(W631)  
Group
-
Course number
CSC.T252
Credits
2
Academic year
2017
Offered quarter
2Q
Syllabus updated
2017/3/17
Lecture notes updated
-
Language used
Japanese
Access Index

Course description and aims

This course focuses on switching circuit theory that is a fundamental theory for designing and analyzing digital circuits.
It is very important to understand that computer hardware is inseparable from software in the field of computer science. Switching circuit theory is a foundation for designing advanced digital circuits, such as processors, and analyzing the behavior of them. To comprehend the behavior of computer hardware also leads to an essential understanding of that of software.
This course covers not only switching circuit theory such as Boolean algebra, Boolean functions, and the methodologies to design combinational and sequential logic circuits, but also a hardware description language which is used for designing logic circuits by software.

Student learning outcomes

At the end of this course, students will:
- Understand the principles and properties of Boolean algebra and Boolean functions required to understand logic circuits,
- Understand the principles of combinational logic circuits and sequential logic circuits, and the methodologies to design them, and
- Design logic circuits with a hardware description language.

Keywords

Boolean algebra, Boolean function, combinational logic circuit, sequential logic circuit, hardware description language

Competencies that will be developed

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

Class flow

In the first 70% of each class, the details of topics are described. The remainder will be spent for exercises and their explanation to help students’ comprehension. Two classes will be for exercises at a computer room.

Course schedule/Required learning

  Course schedule Required learning
Class 1 Boolean algebra and its properties Understand Boolean algebra
Class 2 Boolean expression and its duality Understand logical expression and its duality principle
Class 3 Maxterm expression and minterm expression of Boolean functions Understand the principle of maxterm and minterm expressions
Class 4 NAND form, NOR form, Reed-Muller expansion Understand Boolean expressions by all-NAND or all-NOR operators, and Reed-Muller expansion
Class 5 Unate function and monotonic function Understand the properties of unate and monotonic functions
Class 6 Dual function, symmetric function, linear function, threshold function Understand the properties of dual, symmetric, linear, and threshold functions
Class 7 Designing combinational logic circuits with the Karnaugh map Understand how to design combinational logic circuits with the Karnaugh map
Class 8 Designing combinational logic circuits by the Quine-McCluskey algorithm Understand how to design combinational logic circuits by the Quine-McCluskey algorithm
Class 9 Programing combinational logic circuits with a hardware description language Understand how to write combinational logic circuits with a hardware description language
Class 10 Organization of sequential logic circuits Understand the mechanism of sequential logic circuits
Class 11 State transition and assignment for sequential logic circuits Understand the state transition and assignment of sequential logic circuits
Class 12 Designing sequential logic circuits with flip-flops Understand how to implement sequential logic circuits with flip-flops
Class 13 Minimizing sequential logic circuits by identifying equivalent states Understand the notion of an equivalent state for minimizing sequential logic circuits
Class 14 Minimizing sequential logic circuits by identifying a compatible state set Understand the notion of a compatible state set for minimizing sequential logic circuits
Class 15 Programing sequential logic circuits with a hardware description language Understand how to write sequential logic circuits with a hardware description language

Textbook(s)

A textbook in English will be introduced by instructors.

Reference books, course materials, etc.

Reference books in English will be introduced by instructors.

Assessment criteria and methods

Students will be assessed on their understanding of principles of Boolean algebra, Boolean functions, combinational logic circuits, and sequential logic circuits. Students’ course scores are based on a midterm assignment (40%) and a final exam (60%).

Related courses

  • CSC.T341 : Computer Logic Design
  • CSC.T363 : Computer Architecture
  • CSC.T433 : Advanced Computer Architecture

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

No prerequisites are necessary.

Page Top