Logic Design Computer Architecture and Design Lecture 1.

Slides:



Advertisements
Similar presentations
CT455: Computer Organization Logic gate
Advertisements

컴퓨터구조론 교수 채수환. 교재 Computer Systems Organization & Architecture John D. Carpinelli, 2001, Addison Wesley.
COE 202: Digital Logic Design Combinational Circuits Part 1
Chapter 2 Logic Circuits.
التصميم المنطقي Second Course
Sequential Circuits1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.
Multiplexors Sequential Circuits and Finite State Machines Prof. Sin-Min Lee Department of Computer Science.
1 CS/COE0447 Computer Organization & Assembly Language Logic Design.
The Map Method Boolean expressions may be simplified by algebraic means as discussed in Previous lecture However, this procedure of minimization is awkward.
Computer Organization Boolean Logic and the CPU i206 Fall 2010 John Chuang Some slides adapted from Marti Hearst, Brian Hayes, or Glenn Brookshear.
08/07/041 CSE-221 Digital Logic Design (DLD) Lecture-8:
CS 151 Digital Systems Design Lecture 6 More Boolean Algebra A B.
Chapter 4 Gates and Circuits.
CHAPTER 3 Digital Logic Structures
EECS 40 Spring 2003 Lecture 12S. Ross and W. G. OldhamCopyright Regents of the University of California More Digital Logic Gate delay and signal propagation.
State Machines Used to Design Sequential Circuits.
Informationsteknologi Friday, October 19, 2007Computer Architecture I - Class 81 Today’s class Digital Logic.
CS 105 Digital Logic Design
Chapter 2: Boolean Algebra and Logic Functions
Boolean Algebra Dr. Bernard Chen Ph.D. University of Central Arkansas Spring 2009.
Chapter 4 Gates and Circuits. 4–2 Chapter Goals Identify the basic gates and describe the behavior of each Describe how gates are implemented using transistors.
Digital Computer Design Fundamental
Introduction to Digital Logic Design Appendix A of CO&A Dr. Farag
Quiz # 2 Chapters 4, 5, & 6.
Circuit, State Diagram, State Table
1 CHAPTER 4: PART I ARITHMETIC FOR COMPUTERS. 2 The MIPS ALU We’ll be working with the MIPS instruction set architecture –similar to other architectures.
Introduction to Computing Systems from bits & gates to C & beyond Chapter 3 Digital Logic Structures Transistors Logic gates & Boolean logic Combinational.
Chap 4. Sequential Circuits
Chap 3. Chap 3. Combinational Logic Design. Chap Combinational Circuits l logic circuits for digital systems: combinational vs sequential l Combinational.
Dept. of Computer Science Engineering Islamic Azad University of Mashhad 1 DIGITAL LOGIC CIRCUITS Dept. of Computer Science Engineering Islamic Azad University.
Lecture 17: Digital Design Today’s topic –Intro to Boolean functions Reminders –HW 4 due Wednesday 10/8/2014 (extended) –HW 5 due Wednesday 10/15/2014.
SUPLEMENTARY CHAPTER 1: An Introduction to Digital Logic The Architecture of Computer Hardware and Systems Software: An Information Technology Approach.
B-1 Appendix B - Reduction of Digital Logic Principles of Computer Architecture by M. Murdocca and V. Heuring © 1999 M. Murdocca and V. Heuring Principles.
1.Overview of Course Objective 2.Details of course website, BLOG 3.Details of Syllabus 4.Recommended Books 5.Details of Lab Sessions 6.Introductory concepts.
Monday, December 6 Assignment(s) due:Assignments #11(original or redo), #12 and #EC2 are due tonight Tonight is the last chance to turn in Quizzes #13.
Fall 2012: FCM 708 Foundation I Lecture 2 Prof. Shamik Sengupta
Module 9.  Digital logic circuits can be categorized based on the nature of their inputs either: Combinational logic circuit It consists of logic gates.
1.8 Binary Storage and Registers
Logic Design CS 270: Mathematical Foundations of Computer Science Jeremy Johnson.
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits II.
1 EG 32 Digital Electronics Thought for the day You learn from your mistakes..... So make as many as you can and you will eventually know everything.
CHAPTER-2 Fundamentals of Digital Logic. Digital Logic Digital electronic circuits are used to build computer hardware as well as other products (digital.
ITEC 352 Lecture 3 Low level components(2). Low-level components Review Electricity Transistors Gates Really simple circuit.
Chap 2. Combinational Logic Circuits
Computer Architecture and Organization Unit -1. Digital Logic Circuits – Logic Gates – Boolean Algebra – Map Simplification – Combinational Circuits –
Digital Circuits State Reduction and Assignment State Reduction reductions on the number of flip-flops and the number of gates a reduction in the.
ENGIN112 L6: More Boolean Algebra September 15, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 6 More Boolean Algebra A B.
CS/COE0447 Computer Organization & Assembly Language
Logic Design / Processor and Control Units Tony Diep.
CS151 Introduction to Digital Design Chapter 2: Combinational Logic Circuits Lecture 5: Binary Logic and Gates.
Logic Design CS221 1 st Term combinational circuits Cairo University Faculty of Computers and Information.
Boolean Algebra. BOOLEAN ALGEBRA Formal logic: In formal logic, a statement (proposition) is a declarative sentence that is either true(1) or false (0).
1 Lecture 24 Transistors A look ahead Course summary.
1 CS 352 Introduction to Logic Design Lecture 1 Ahmed Ezzat Number Systems and Boolean Algebra, Ch-1 + Ch-2.
Chapter 3 Boolean Algebra and Digital Logic T103: Computer architecture, logic and information processing.
Lecture 1 Gunjeet kaur Dronacharya group of institutions.
Week 1: Introduction and Logic gates IT3002 – Computer Architecture
Chap 3. Combinational Logic Design
Chapter 2: Boolean Algebra and Logic Functions
DIGITAL LOGIC CIRCUITS
Boolean Algebra.
Boolean Expressions Lecture No. 10.
Computer Architecture CST 250
DIGITAL LOGIC CIRCUITS
Fundamentals of Computer Science Part i2
Digital Logic Structures Logic gates & Boolean logic
Basic Logic Gates 1.
Logic Gates.
COMPUTER ORGANIZATION
Presentation transcript:

Logic Design Computer Architecture and Design Lecture 1

Youpyo Hong & Kangwoo DGU Computer Architecture? Instruction set  operation encoding, memory addressing techniques Data representations  signed magnitude, floating-point Addressing  direct, indirect, relative I/O mechanisms  memory mapped, I/O mapped So, it is a mixture of hardwares and softwares. 2

Youpyo Hong & Kangwoo DGU HW & SW for Computers Hardware : Electronic components & electromechanical devices that comprise the physical entity of the device Software : Programs composed of a sequence of instructions  System Software Programs to make use of the core function of computers Example: Operating systems, Compilers  Application Software Programs for various users application Example: Games, Word-processor  Firmware Programs directly related to hardware control Example: Device driver 3

Youpyo Hong & Kangwoo DGU Computer Hardware We have learned hardware design in digital logic design courses. Brief review on digital logic design follows. 4 Memory Central processing Unit Central processing Unit Input-Output processor Input-Output processor Input devices Input devices Output devices Output devices

Youpyo Hong & Kangwoo DGU Transistors : Basic Elements for HW Logic gates are physically implemented by Transistors. If N & P transistors in a single semiconductor place, it is called CMOS technology. 5 N - type V CA nS C B A - + P - type V BC pS C B A - + Source Drain Gate C B A C B A Source Drain Gate C B A C B A Switch Transistor Logic Symbol

Youpyo Hong & Kangwoo DGU v out C B A C B A V DD v in xz Details on transistors are covered in semiconductor & integrated circuit design courses. Our design ground is digital logic as follows. Inverter Gate 6

Youpyo Hong & Kangwoo DGU Boolean Algebra Boolean algebra is an algebra that deals with binary variables and logic operations. Three representations for a function.  Boolean Function ( = Logic Expression) Algebraic expression with binary variables, logic operation symbols, parenthesis & equal sign  Truth Table A relationship between the function and its variables  Logic Diagram Expression of Boolean function using logic gates 7

Youpyo Hong & Kangwoo DGU Examples 8  Truth Table x y z F  Logic Diagram x y z F F = x + y’z  Boolean Function

Youpyo Hong & Kangwoo DGU Logic Simplification Why ?  To minimize the number of logic gates, the propagation delay and the cost while performing the same function How?  Using the basic identities of Boolean algebra or  Using the karnaugh-map simplification or  Using other approaches 9

Youpyo Hong & Kangwoo DGU Karnaugh-Map Simplification AB CD F(A,B,C,D) =  (0,1,2,6,8,9,10) F = BD’ + B’C’ + A’CD’ A BC F(A,B,C) =  (3,4,6,7) F = BC + AC’ A BC F(A,B,C) =  (0,2,4,5,6) F = C’ + AB’

Youpyo Hong & Kangwoo DGU Combinational Logic (= Circuit) Outputs are determined by current inputs only. (No memory in combinational logic.) 11 Combinational Circuit m output variables n input variables  Problem statement  Assign letter symbols to I/O  Build a truth table  Simplification for each output  Logic Diagram Circuit Design Procedure

Youpyo Hong & Kangwoo DGU Half Adder Example 12 xy 00 CS Truth Table S = x’y + xy’ = x  y C = xy Boolean Function x y C S Logic Diagram

Youpyo Hong & Kangwoo DGU Sequential Logic Outputs are determined by current inputs and the memory contents. Basic unit of memory is flip-flop that stores 1 bit information. You need to understand the concept of latch, register and RAM. 13

Youpyo Hong & Kangwoo DGU Flip-Flops 14 Q(t)Q(t+1) 00 SR 0x x0 SR Flip-Flop Q(t)Q(t+1) 00 D D Flip-Flop Q(t)Q(t+1) 00 JK 0x x x1 11x0 JK Flip-Flop Q(t)Q(t+1) 00 D T Flip-Flop

Youpyo Hong & Kangwoo DGU Sequential Circuit Configuration 15 Combinational Circuit inputsoutputs Flip-Flops clock

Youpyo Hong & Kangwoo DGU Sequential Circuit Design Flow 16  Draw a State Transition Diagram  Assign state Variables to the states  Determine the types of flip-flops to use  Translate state diagram to State Table with current states, inputs, outputs, next states  Extend state table to Excitation Table including inputs to flip-flops  Determine Boolean functions for the outputs and for the inputs of flip-flops  Draw a Logic Diagram

Youpyo Hong & Kangwoo DGU Sequential Circuit Example 17 J Q K J Q K A B clock x J A = BxJ B = x K B = xK A = Bx  State Diagram  Variables  Flip-flop types  State Table  Excitation Table  Boolean function  Logic Diagram Procedure