COURSE DESCRIPTION AND APPLICATION INFORMATION

Course Name Code Semester T+A+L (hour/week) Type (C / O) Local Credit ECTS
Design of Nano-Computers CMPE 417 Fall 03+00+00 Elective 3 5
Academic Unit: Faculty of Science and Engineering / Computer Engineering
Mode of Delivery: Face to face
Prerequisites: -
Language of Instruction: English
Level of Course Unit: Undergraduate
Course Coordinator: Nima Jafari NAVİMİPOUR
Course Lecturer(s): Nima Jafari NAVİMİPOUR
Course Objectives: Designing basic logic gates and circuits using innovative technologies like Reversible logic and Quantum Dot Cellular Automata (QCA). Analyzing the challenges and opportunities presented by nanoscale computing, including fault tolerance and error probability. Utilizing industry-standard tools like QCADesigner to simulate and analyze quantum circuits
Course Contents: In this course, students will learn to design basic logic gates and synthesize more complex circuits using reversible logic principles. Also, they will discover QCA, a revolutionary nanotechnology for computation. Master the design of fundamental logic gates like AND, OR, and NOT using QCA cells and build more complex circuits such as adder, decoder, multiplexer etc.
Learning Outcomes of the Course Unit (LO):
  • 1- Upon completing this course, students will be able to design and analyze nanoscale computing circuits using emerging technologies like QCA technology while understanding the challenges and opportunities they present.
  • 2- They will be able to apply reversible logic principles for efficient circuit design and explore alternative nanotechnologies for future computing.
  • 3- Students will also gain hands-on experience with industry-standard simulation tools and develop research and communication skills through independent projects and presentations
Planned Learning Activities and Teaching Methods: Class presentations and notes, together with some academic articles on the subject


WEEKLY SUBJECTS AND RELATED PREPARATIONS

WeekSubjectsRelated Preperation
1 History of Computers and Future of Nanotechnology Computers Lecture slides and Book and Journals articles
2 Introduction to Nanotechnology Lecture slides and Book and Journals articles
3 Nano-scale Circuits Lecture slides and Book and Journals articles
4 Reversible Logic Lecture slides and Book and Journals articles
5 Designing Circuits using Reversible Logic Lecture slides and Book and Journals Articles
6 Quantum Dots Cellular Automata Lecture slides and Book and Journals Articles
7 Midterm Lecture slides and Book and Journals Articles
8 Designing Nano-scale basic gates using QCA technology Lecture slides and Book and Journals Articles
9 Designing Nano-scale circuits using QCA technology Lecture slides and Book and Journals Articles
10 Fault-tolerant at QCA technology Lecture slides and Book and Journals Articles
11 Error probability at QCA technology Lecture slides and Book and Journals Articles
12 Design reversible circuits using QCADesigner Lecture slides and Book and Journals Articles
13 Silicon Atomic Dangling Bond Logic Lecture slides and Book and Journals Articles
14 Presentation Lecture slides and Book and Journals Articles


REQUIRED AND RECOMMENDED READING

Sasamal, T. N., Singh, A. K., & Mohan, A. (2020). Quantum-dot cellular automata based digital logic circuits: a
design perspective.
Taha, S. M. R. (2016). Reversible logic synthesis methodologies with application to quantum computing (Vol. 37).
Switzerland: Springer.
Abdessaied, N., & Drechsler, R. (2016). Reversible and quantum circuits. Optimization and Complexity Analysis.
Springer, Cham.


OTHER COURSE RESOURCES



ASSESSMENT METHODS AND CRITERIA

Semester RequirementsNumberPercentage of Grade (%)
Presentation / Jury - 20
Midterms / Oral Exams / Quizes 1 50
Final Exam 1 50
Total: 2 120


WORKLOAD

EventsCountDuration (Hours)Total Workload (hour)
Course Hours14228
Practice / Exercise14114
Preparation for Presentation / Jury12525
Midterms / Oral Exams / Quizes13030
Final Exam13030
Total Workload (hour):127


THE RELATIONSHIP BETWEEN COURSE LEARNING OUTCOMES (LO) AND PROGRAM QUALIFICATIONS (PQ)

# PQ1 PQ2 PQ3 PQ4 PQ5 PQ6 PQ7 PQ8 PQ9 PQ10 PQ11 PQ12 PQ13
LO1                          
LO2                          
LO3