
Λογική Σχεδίαση
 Title:  Λογική Σχεδίαση  Lesson Code:  3212003  Semester:  1  ECTS:  5  Theory Hours:  3  Lab Hours:  2  Faculty:  Kalligeros Emmanouil 
  External Website  http://www.icsd.aegean.gr/lecturers/kalliger/LogicDesign/LogicDesign.htm   Content outline  Introduction: Analog and Digital Signals, Usefulness of Digital Signal Processing and Digital Circuits, Evolution of Digital Circuits. Digital Systems and Binary Numbers: Digital Systems, Binary Numbers, NumberBase Conversions, Octal and Hexadecimal Numbers, Complements, Signed Binary Numbers, Binary Codes, Binary Storage and Registers, Binary Logic. Boolean Algebra and Logic Gates: Basic Definitions, Axiomatic Definition of Boolean Algebra, Basic Theorems and Properties of Boolean Algebra, Boolean Functions, Canonical and Standard Forms of Boolean Functions, Other Logic Operations, Digital Logic Gates. GateLevel Minimization: The Map Method, Three, Four and FiveVariable Maps, ProductofSums Simplification, Don'tCare Conditions, NAND and NOR Implementations, XOR Function. Combinational Logic: Combinational Circuits, Analysis Procedure, Design Procedure, Binary AdderSubtractor, Binary Multiplier, Magnitude Comparator, Decoders, Encoders, Multiplexers, TriState Gates. Synchronous Sequential Logic: Sequential Circuits, Latches, FlipFlops, Analysis of Clocked Sequential Circuits, State Reduction and Assignment, Design Procedure. Registers and Counters: Registers, Shift Registers, Ripple Counters, Synchronous Counters, Other Counters.   Learning outcomes  A student who successfully fulfills the course requirements will have demonstrated:
1. An ability to define different number systems, perform binary addition and subtraction, use 1’s complement representation and perform operations with this representation, use 2’s complement representation and perform operations with this representation.
2. An ability to understand the different Boolean algebra theorems and apply them for logic functions.
3. An ability to define the Karnaugh map for a few variables (3, 4 and 5 mainly) and perform an algorithmic reduction of logic functions.
4. An ability to understand the functionality of basic logic gates (AND, OR, Inverter, NAND, NOR, ExclusiveOR, ExclusiveNOR).
5. An ability to analyze and design combinational circuits by using the basic logic gates.
6. An ability to define the following combinational circuits: adders (ripplecarry and carry look ahead), subtractors, simple multipliers, magnitude comparators, encoders/decoders, (de)multiplexers, buses, tristate gates; and to be able to build simple applications by using them.
7. An ability to understand the bistable element and the different latches and flipflops.
8. An ability to derive the statemachine analysis or synthesis and to perform simple projects with a few flipflops.
9. An ability to understand sequential circuits, like counters and shift registers, and to perform simple projects with them.   Prerequisites  Not required.   Basic Textbooks 
 Digital Design, M. Morris Mano and Michael D. Ciletti, 5th Ed.
 Digital Design, A Systems Approach, W. J. Dally, R. C. Harting
 Digital Design: Principles and Practices, John F. Wakerly, 3rd Ed.
  Learning Activities and Teaching Methods  Lab exercises (35%), written examination (65%)   Assessment/Grading Methods  Lectures, Problem sessions, Lab exercises   Language of Instruction  Greek, English (for Erasmus students)   Μode of delivery  Facetoface. 

