School of Engineering \ Computer Engineering
Course Credit
ECTS Credit
Course Type
Instructional Language
Programs that can take the course
Computer Engineering
Electrical and Electronics Engineering
Binary Systems. Codes. Boolean Algebra. Digital Logic Gates. Simplification of Functions. Combinational Logic. Synchronous Sequential Logic. Counters. Design Problems. Reading Integrated Circuit Catalog Data and Recognizing Laboratory Equipment. Implementation and Simplification of Boolean Functions Using Logic Gates. Function Implementation with Gates and Combinational Logic Circuits (Multiplexers and Decoders). Flip-Flops, Shift Registers, and Counters.
Textbook and / or References
Digital Design: With an Introduction to the Verilog HDL, VHDL, and System Verilog - Morris Mano
The primary goal of this fundamental hardware course, Digital System Design, is for students who successfully complete it to understand that a computer is a highly structured and efficient engineering design, created by intelligently and skillfully processing simple electrical signals through basic electrical circuits. Additionally, the course aims to equip students with the knowledge and comprehension necessary to design a basic computer at an introductory level.
1. Learning the conversions between number systems.
2. Designing combinational circuits and understanding circuit components.
3. Designing sequential circuits and understanding circuit components.
4. Gaining the ability to design a complex system, process, device, or product using Verilog Behavioral and Gate-Level Modeling under realistic constraints and conditions to meet specific requirements, as well as applying modern design methodologies for this purpose.
5. Properly utilizing the input and output components on an FPGA board according to a given problem.
6. Learning how to integrate and use IP Cores within a project.
7. Designing and implementing asynchronous (clockless) circuits using Verilog.
8. Designing and implementing synchronous (clocked) circuits using Verilog.
Week 1: Digital Systems and Binary Numbers
Week 2: Digital Systems and Binary Numbers
Week 3: Boolean Algebra and Logic Gates
Week 4: Boolean Algebra and Logic Gates
Week 5: Gate-Level Minimization
Week 6: Gate-Level Minimization
Week 7: Combinational Circuits
Week 8: Combinational Circuits
Week 9: Synchronous Sequential Circuits
Week 10: Registers and Counters
Week 11: Finite State Machines
Week 12: Pipelining Method
Tentative Assesment Methods
• Quiz 1 7 %
• Quiz 2 4 %
• Midterm 1 26 %
• Midterm 2 6 %
• Project 15 %
• Final 42 %
|
Program Outcome
*
|
| 1 |
2 |
3 |
4 |
5 |
6 |
7 |
8 |
9 |
10 |
11 |
|
Course Outcome
|
|---|
| 1 |
A, C
|
|
|
|
|
|
|
|
|
|
|
| 2 |
|
A
|
|
|
|
B
|
|
|
|
|
|
| 3 |
|
B
|
|
|
|
B
|
|
|
|
|
|
| 4 |
D, B
|
|
|
B
|
B, C, D
|
B, C
|
|
|
B
|
|
|
| 5 |
C, D
|
A, B
|
|
B
|
B, C, D
|
B, C
|
|
|
B
|
|
|
| 6 |
C
|
|
|
B
|
B
|
B
|
|
|
B
|
|
|
| 7 |
A
|
A, B
|
|
A
|
B, C, D
|
|
|
|
B
|
|
|
| 8 |
A
|
A, B
|
|
A
|
B, C, D
|
B
|
|
|
B
|
|
|