Welcome,
Guest
.
Login
.
Türkçe
NİNOVA
COURSES
HELP
ABOUT
Where Am I:
Ninova
/
Courses
/
Faculty of Electrical and Electronic Engineering
/
EEF 205
/
Course Informations
Return to Faculty
Home Page
Course Information
Course Weekly Lecture Plan
Course Evaluation Criteria
Course Information
Course Name
Turkish
Lojik Tasarıma Giriş
English
Introduction to Logic Design
Course Code
EEF 205
Credit
Lecture
(hour/week)
Recitation
(hour/week)
Laboratory
(hour/week)
Semester
3
3
3
-
-
Course Language
Turkish
Course Coordinator
Ali Bahadır
Course Objectives
258 / 5.000
1. Teaching the Fundamentals of Logic Systems and Binary Numbers
2. Teaching Boolean Algebra and Logic Gates
3. Teaching Hardware Description Languages
4. Teaching Analysis and Design of Combinational Circuits
5. Teaching Analysis and Design of Synchronous Sequential Circuits
Course Description
Logic Systems and Binary Numbers: Number Systems, Number Base Transformations, Binary Numbers. Definition of Boolean Algebra with Axioms, Fundamental Theorems and Properties. Boolean Functions: Canonical Representations. Logic Gates. Hardware Description Languages ??(HDL). Reduction of Boolean Functions: Quinn McCluskey and Karnaugh Diagram Methods. Universal Gates, Implementations with TÜVE and TÜVEYA. Analysis and Design of Combinational Circuits. Combinational circuit design examples with HDL. Implementations of Boolean Functions using Medium (MSI-elements; Decoders, Encoders, Data Collectors, Data Distributors) and Large Scale Integrated Circuits (LSI-elements, Programmable Logic Elements-PLD (ROM, PAL, PLA)). HDL Models of Boolean Functions using MSI elements as sub-blocks. Memory Elements: Latches, Flip-Flops, HDL Models of SR and D Latch. Analysis and Design of Synchronous Sequential Circuits. HDL Models of Finite State Machines.
Course Outcomes
Students who successfully complete this course,
I. Understand the differences between digital and analog systems, number systems
II. Know Boolean Algebra and Boolean Functions
III. Can Reduce Boolean Functions
IV. Can Design Combinational Circuits Using Two-Level Gates
V. Can Implement Boolean Functions Using MSI Elements and PLDs
VI. Can Analyze and Design Synchronous Sequential Circuits
VII. Can Create Models of Combinational and Synchronous Sequential Circuits Using Hardware Description Languages
Pre-requisite(s)
Required Facilities
Other
Textbook
Other References
Courses
.
Help
.
About
Ninova is an ITU Office of Information Technologies Product. © 2024