Lecture 24: 12/3/2002CS170 Fall 20021 CS170 Computer Organization and Architecture I Ayman Abdel-Hamid Department of Computer Science Old Dominion University.

Slides:

Advertisements

Similar presentations

Basic Logic Gate Sayed Mahbub Hasan Amiri Dhaka Residential Model College.

Advertisements

Digital Circuits. Review – Getting the truth table The first step in designing a digital circuit usually is to get the truth table. That is, for every.

CDA 3100 Recitation Week 10.

Digital Circuits.

Computer Science 210 Computer Organization Clocks and Memory Elements.

CPS3340 COMPUTER ARCHITECTURE Fall Semester, /23/2013 Lecture 7: Computer Clock & Memory Elements Instructor: Ashraf Yaseen DEPARTMENT OF MATH &

CS 300 – Lecture 3 Intro to Computer Architecture / Assembly Language Sequential Circuits.

Sequential Circuits and Finite State Machines Prof. Sin-Min Lee

Computer Architecture: Intro Lecture 8- The Control Path J. Schmalzel S. Mandayam.

Example: 7 Segment Displays BA DC\ xxxx 10 11xx Decimal Number Inputs Outputs DCBA abcdefg

ECE 331 – Digital System Design Logic Circuit Design (Lecture #7)

The Processor Andreas Klappenecker CPSC321 Computer Architecture.

Lecture 17: 10/29/2002CS149D Fall CS149D Elements of Computer Science Ayman Abdel-Hamid Department of Computer Science Old Dominion University Lecture.

Introduction to Digital Logic Design Appendix A of CO&A Dr. Farag

CS 151: Digital Design Chapter 3 3-8: Encoding. CS 151 Encoding Encoding - the opposite of decoding - the conversion of a maximum of 2 n input code to.

Random-Access Memory (RAM)

Memory and Programmable Logic Dr. Ashraf Armoush © 2010 Dr. Ashraf Armoush.

COE 202: Digital Logic Design Combinational Circuits Part 3 Dr. Ahmad Almulhem ahmadsm AT kfupm Phone: Office: Ahmad Almulhem, KFUPM.

Introduction to Digital Logic and Circuits EE 101, Fall 2015 University of Kentucky.

CSET 4650 Field Programmable Logic Devices

CPS3340 COMPUTER ARCHITECTURE Fall Semester, /10/2013 Lecture 5: Combinational Logic Instructor: Ashraf Yaseen DEPARTMENT OF MATH & COMPUTER SCIENCE.

ROM & PLA Digital Logic And Computer Design

CPS3340 COMPUTER ARCHITECTURE Fall Semester, /05/2013 Lecture 4: Basics of Logic Design Instructor: Ashraf Yaseen DEPARTMENT OF MATH & COMPUTER.

Lecture 22: 11/19/2002CS170 Fall CS170 Computer Organization and Architecture I Ayman Abdel-Hamid Department of Computer Science Old Dominion University.

Exclusive OR Gate. Logically, the exclusive OR (XOR) operation can be seen as either of the following operations:exclusive OR (XOR) 1. A AND NOT B OR.

Read Only Memory DC A0A0 A b1b1 b2b2 Programmable ROM DC A0A0 A v b1b1 b2b Fuse Mask-programmed ROM.

Combination of logic gates  Logic gates can be combined to produce more complex functions.  They can also be combined to substitute one type of gate.

Logic Gates. The Inverter The inverter (NOT circuit) performs the operation called inversion or complementation. Standard logic symbols: 1 1 input output.

Memory 10/27/081ECE Lecture. Memory Memory Types Using memory to implement logic functions 10/27/082ECE Lecture.

1 Computer Organization & Design Microcode for Control Sec. 5.7 (CDROM) Appendix C (CDROM) / / pdf / lec_3a_notes.pdf.

Digital Logic Design Lecture # 14 University of Tehran.

Lecture 1: 8/27/2002CS170 Fall CS170 Computer Organization and Architecture I Ayman Abdel-Hamid Department of Computer Science Old Dominion University.

Lecture 7: 9/17/2002CS149D Fall CS149D Elements of Computer Science Ayman Abdel-Hamid Department of Computer Science Old Dominion University Lecture.

CS151 Introduction to Digital Design

Lecture 4: 9/5/2002CS170 Fall CS170 Computer Organization and Architecture I Ayman Abdel-Hamid Department of Computer Science Old Dominion University.

Logic Design CS221 1 st Term Storage (memory) Cairo University Faculty of Computers and Information.

CPS3340 Computer Architecture Fall Semester, 2013

CS/COE0447 Computer Organization & Assembly Language

1-1 Computer Organization Part The von Neumann Model The von Neumann model consists of five major components: (1) input unit; (2) output unit;

Appendix C Basics of Digital Logic Part I. Florida A & M University - Department of Computer and Information Sciences Modern Computer Digital electronics.

Programmable logic devices. CS Digital LogicProgrammable Logic Device2 Outline PLAs PALs ROMs.

ECE 301 – Digital Electronics Logic Circuit Design (Lecture #9)

LECTURE 4 Logic Design. LOGIC DESIGN We already know that the language of the machine is binary – that is, sequences of 1’s and 0’s. But why is this?

COMPUTER ARCHITECTURE & OPERATIONS I Instructor: Yaohang Li.

Lecture 23: 11/26/2002CS170 Fall CS170 Computer Organization and Architecture I Ayman Abdel-Hamid Department of Computer Science Old Dominion University.

Lecture 16: 10/29/2002CS170 Fall CS170 Computer Organization and Architecture I Ayman Abdel-Hamid Department of Computer Science Old Dominion University.

Minute Paper 4/4/04 Z=50+j86.7=100

1 CS/COE0447 Computer Organization & Assembly Language Logic Design Appendix C.

Programmable Logic Devices

The George Washington University School of Engineering and Applied Science Department of Electrical and Computer Engineering ECE122 – Lab 7 Latches & Flip-flops.

Appendix C Basics of Logic Design. Appendix C — Logic Basic — 2 Logic Design Basics §4.2 Logic Design Conventions Objective: To understand how to build.

Chapter- 9 Programmable Logic Devices DHADUK ANKITA ENRL NO Noble Engineering College- Junagadh.

Computer Science 210 Computer Organization

Computer Architecture & Operations I

Computer Architecture & Operations I

Biconditional - 2 CS-708.

Computer Organization & Design Microcode for Control Sec. 5

Computer Architecture & Operations I

Computer Science 210 Computer Organization

ECE 434 Advanced Digital System L03

Computer Science 210 Computer Organization

CS170 Computer Organization and Architecture I

CS149D Elements of Computer Science

ECE434a Advanced Digital Systems L02

GCSE Computer Science – Logic Gates & Boolean Expressions

CS149D Elements of Computer Science

Digital Circuits.

Agenda Lecture Content: Combinatorial Circuits Boolean Algebras

Presentation transcript:

Lecture 24: 12/3/2002CS170 Fall CS170 Computer Organization and Architecture I Ayman Abdel-Hamid Department of Computer Science Old Dominion University Lecture 24: 12/3/2002

CS170 Fall Outline Appendix B Example on Memory Elements More on Combinatorial Logic

Lecture 24: 12/3/2002CS170 Fall Example on Memory Elements Problem B.23 (See handout) Design a 3-bit counter using D latches and gates As exercise, try to solve B.24

Lecture 24: 12/3/2002CS170 Fall More on Combinatorial Logic 1/4 ROMread-only memory A set of locations that can be read The contents of these locations are fixed, usually at the time the ROM is created PROM, EPROM A set of input address lines (just as a PLA), say M of these.; there are 2 M addresses and these point to 2 M distinct words A set of output lines (just as a PLA) say N, giving a word of N bits Contrast a ROM and a PLA

Lecture 24: 12/3/2002CS170 Fall More on Combinatorial Logic 2/4 Don’t Cares Situations where we do not care what the value of some output is, either because another output is TRUE or because a subset of input combinations determines the values of the outputs. Two types of Don’t cares Output: don’t care about the value of an output for some input combination (appear as X in the output portion of truth table) Input: Output depends on only some of the inputs (appear as X in the input portion of the truth table)

Lecture 24: 12/3/2002CS170 Fall More on Combinatorial Logic 3/4 InputsOutputs ABCDEF If A or C is true, output D is true, whatever the value of B If A or B is true, output E is true, whatever value of C Output F is true if exactly one of the inputs is true. We don’t care about the value of F, whenever D and E are both true. Truth table without don’t cares InputsOutputs ABCDEF X 10011X 10111X 11011X 11111X Truth table with output don’t cares InputsOutputs ABCDEF X1111X 1XX11X Simplified truth table Input/Output don’t cares

Lecture 24: 12/3/2002CS170 Fall More on Combinatorial Logic 4/4 If A or C is true, output D is true, whatever the value of B If A or B is true, output E is true, whatever value of C Output F is true if exactly one of the inputs is true. We don’t care about the value of F, whenever D and E are both true. Truth table without don’t cares InputsOutputs ABCDEF X 10011X 10111X 11011X 11111X Truth table with output don’t cares InputsOutputs ABCDEF X1111X 1XX11X Simplified truth table Input/Output don’t cares How many product terms for original truth table? How many product terms for simplified truth table?