Logic Circuit
| Course Purpose |
|---|
| To understand the fundamental matters about digital circuits making up computers and various information systems. Specifically, to aquire basic knowledge and the way of thinking in information science, which include the expressions and manipulation methods of numbers within computers, the basics and properties of Boolean algebra and Boolean functions, the structure and the design methods of combinational and sequential logic circuits. |
| Learning Goals |
| Students should be able to: - Interconvert integers among the decimal, binary, and hexadecimal number systems, and perform addition/subtraction in the binary number system. - Simplify logic expressions and derive the minimum sum-of-products forms of logic functions through the Karnaugh maps. - Design combinational circuits using specified kinds of gtates from logic expressions. - Understand the principle of sequencial circuits and design them from state transition graphs. - Understand the principle of adders/subtractors and design logic circuits to detect overflow and to compare binary numbers. - Convert given logic expressions into the cannonical sum-of-products forms, cannonical product-of-sums forms, and logic expressions build up only with specified type of operators. |
| Topic | |
|---|---|
| Session 1 | Outline of the lecture, What is a logic circuit? Representation of numbers (1) |
| Session 2 | Representation of numbers (2) |
| Session 3 | Logical algebra and logical functions (1) |
| Session 4 | Logical algebra and logical functions (2) |
| Session 5 | Combinatory logic circuit |
| Session 6 | Simplification of logical functions (1) |
| Session 7 | Mid-term exam (1) |
| Session 8 | Simplification of logical functions (2) |
| Session 9 | Sequential circuit |
| Session 10 | Sequential circuit design (1) |
| Session 11 | Sequential circuit design (2) |
| Session 12 | Arithmetic circuit |
| Session 13 | Mid-term exam (2) |
| Session 14 | Properties of logical functions |