This course covers combinatorial, sequential circuits, state machines, verification methodologies, memories, design principles, SOC concepts and interfaces, which are frequently used in the digital design world. Within the scope of the course, a processor named Fenerbahçe Processor will be designed for educational purposes and verified with Verilog HDL. FPGA based demo will be presented.
Course Hours (Theoretical + Lab)
Assist. Prof. Vecdi Emre Levent
T. A. Uğur Özbalkan
There are no prerequisites.
Reference sources of the course are listed below.
- Introduction to Logic Design, Third Edition, Alan B. Marcovitz, McGraw-Hill, 2010
- Digital Design, Moris Mano and Michael D. Ciletti, 5th edition, Prentice Hall, 2009
- FPGA Prototyping by Verilog Examples, Pong Chu, John Wiley, 2008
- Introduction to Logic Design, Alan Marcovitz, McGraw Hill, 2010
Xilinx Vivado 2022.1
The course has 2 hours of theory and 2 hours of laboratory part per week. It is expected that the course materials given by the lecturer will be reviewed before the lesson and repeated after the lesson.
- Logic minimization with KMAPs
- Circuit development with RTL design languages
- Accuracy measurement of RTL circuits
- Design of interfaces frequently used in industry
There will be two quizzes during the semester. 30 minutes will be given. Quiz date will be announced one week in advance.
It is mandatory to attend classes at 80%.
Term grade; will be determined by midterm, labs, assignments, project and final exam. Evaluation percentages are given in the table below.
|Bonus||Up to 5 points|
5 points will be deducted for each hour that passes over the delivery time of homework and quizzes.
The weight and letter grade corresponding to the end of term grade are given in the table below.
The effort table that the student is expected to show during the term is given below.
|Midterm and Final||24||2||48|
Students are expected to spend an average of 232 hours during the semester to be successful in the course.
Grading of coding assignments will be done by examining the accuracy, quality and details of the algorithmic implementation of the code.
Test entry and expected outputs will be shared for each assignment to be given. However, other test situations that have not been shared with you will be tried during the homework control. Code that takes longer to run than expected may be evaluated incorrectly.
The code should be the design of the desired algorithm. The optimal solution is not expected. But memory and runtime shouldn’t be too much than expected.
The assignment should be written in your own handwriting. The homework answer sheet should contain the name of the course, student name and surname, student number and date.
The aim of the homework is to learn to do in-depth research about the course and to gain practical knowledge. Working with other students on assigned assignments is encouraged. Students who form a study group are more successful in exams than students who study on their own.
But even if you work with others to solve an assignment, you must solve each problem yourself without help. If you obtain your solution through a search (eg an internet search), you should express the solution in your own sentence and/or code. When the solution is asked orally, the student is expected to be able to explain it.
If the given assignment is a code, you have to write it yourself. You can get help from others in debugging. Manual and automatic mechanisms will be used for plagiarism detection in code. Plagiarism, cheating in the exam and similar behaviors are punished according to the disciplinary regulations.