Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved. 0-13-148521-0 The Digital Logic Level.

Slides:

Advertisements

Similar presentations

Computer Buses A bus is a common electrical pathway between multiple devices. Can be internal to the CPU to transport data to and from the ALU. Can be.

Advertisements

Chapter 4 Gates and Circuits.

Chapter 4 Gates and Circuits.

Gates and Circuits Nell Dale & John Lewis (adaptation by Erin Chambers and Michael Goldwasser)

CS105 Introduction to Computer Concepts GATES and CIRCUITS

Chapter 4 Gates and Circuits.

Logical Design.

التصميم المنطقي Second Course

Chapter 10 Flip-Flops and Registers Copyright ©2006 by Pearson Education, Inc. Upper Saddle River, New Jersey All rights reserved. William Kleitz.

Chapter 4 Gates and Circuits.

Connecting with Computer Science, 2e Chapter 3 Computer Architecture.

© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd.

9/19/06 Hofstra University – Overview of Computer Science, CSC005 1 Chapter 4 Gates and Circuits.

Informationsteknologi Friday, October 19, 2007Computer Architecture I - Class 81 Today’s class Digital Logic.

TDC 311 Digital Logic. Truth Tables  AND  OR  NOT  NAND  NOR  XOR  XNOR.

Comparators A comparator compares two input words.

CPU Chips The logical pinout of a generic CPU. The arrows indicate input signals and output signals. The short diagonal lines indicate that multiple pins.

Comparators  A comparator compares two input words.  The following slide shows a simple comparator which takes two inputs, A, and B, each of length 4.

Floyd Digital Fundamentals, 9/e Copyright ©2006 by Pearson Education, Inc. Upper Saddle River, New Jersey All rights reserved. Slide 1 The Digital.

Chapter 17 Microprocessor Fundamentals William Kleitz Digital Electronics with VHDL, Quartus® II Version Copyright ©2006 by Pearson Education, Inc. Upper.

Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F F = x + y’z x y z F Truth Table Boolean Function.

© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd.

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.

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

Some Useful Circuits Lecture for CPSC 5155 Edward Bosworth, Ph.D. Computer Science Department Columbus State University.

Chapter 4 Gates and Circuits.

Boolean Algebra and Digital Logic

Quiz # 2 Chapters 4, 5, & 6.

Chapter 4 Gates and Circuits. Integrated Circuits aka CHIPS What’s in this thing???? 4–2.

Chapter 4 Gates and Circuits.

Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.

CPS120: Introduction to Computer Science

School of Computer Science G51CSA 1 Computer Systems Architecture Fundamentals Of Digital Logic.

ECEn 191 – New Student Seminar - Session 9: Microprocessors, Digital Design Microprocessors and Digital Design ECEn 191 New Student Seminar.

The Digital Logic Level

1 DIGITAL ELECTRONICS. 2 OVERVIEW –electronic circuits capable of carrying out logical (boolean) and arithmetic operations on information stored as binary.

1 Lecture #7 EGR 277 – Digital Logic Reading Assignment: Chapter 4 in Digital Design, 3 rd Edition by Mano Chapter 4 – Combinational Logic Circuits A)

מבנה מחשב תרגול 2. 2 Boolean AND Operation Truth Table Equivalent Gate Different notations:

CHAPTER-2 Fundamentals of Digital Logic. Digital Logic Digital electronic circuits are used to build computer hardware as well as other products (digital.

Chapter 3 Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Transistor: Building.

Concepts of Engineering and Technology Copyright © Texas Education Agency, All rights reserved.

© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.

Chapter 3 - Digital Logic Level Gates Basic Digital Logic Memory –Storage Hierarchy CPU –PII –PicoJava Bus –PCI Homework: –Chapter 3 # 1, 4, 6, 12, 25,

Digital Logic Design Basics Combinational Circuits Sequential Circuits Pu-Jen Cheng Adapted from the slides prepared by S. Dandamudi for the book, Fundamentals.

Logic and Computer Design Fundamentals, Fifth Edition Mano | Kime | Martin Copyright ©2016, 2008, 2004 by Pearson Education, Inc. All rights reserved.

Digital electronics 4–1 Gates and Circuits SANJAYBHAI RAJGURU COLLEGE OF ENGG.

Logic Gates Dr.Ahmed Bayoumi Dr.Shady Elmashad. Objectives  Identify the basic gates and describe the behavior of each  Combine basic gates into circuits.

LOGIC CIRCUITLOGIC CIRCUIT. Goal To understand how digital a computer can work, at the lowest level. To understand what is possible and the limitations.

Chapter 3 Boolean Algebra and Digital Logic T103: Computer architecture, logic and information processing.

Chapter 36 Combinational Logic Circuits. Objectives After completing this chapter, you will be able to: –Describe the functions of encoders, decoders,

1 CE 454 Computer Architecture Lecture 5 Ahmed Ezzat The Digital Logic, Ch-3.1, 3.2.

Copyright ©2009 by Pearson Higher Education, Inc. Upper Saddle River, New Jersey All rights reserved. Digital Fundamentals, Tenth Edition Thomas.

Week 1: Introduction and Logic gates IT3002 – Computer Architecture

Dr.Ahmed Bayoumi Dr.Shady Elmashad

Hardware building blocks in detail

Basics of digital systems

DIGITAL LOGIC CIRCUITS

The Digital Logic Level

Chapter 11 Sequential Circuits.

Basics Combinational Circuits Sequential Circuits

Basics Combinational Circuits Sequential Circuits Ahmad Jawdat

Chapter 4 Gates and Circuits.

CS105 Introduction to Computer Concepts GATES and CIRCUITS

Fundamentals of Computer Science Part i2

The Digital Logic Level

Chapter 4 Gates and Circuits.

XOR Function Logic Symbol  Description  Truth Table 

Digital Circuits and Logic

Presentation transcript:

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved The Digital Logic Level Chapter 3

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved Gates and Boolean Algebra (1) (a) A transistor inverter. (b) A NAND gate. (c) A NOR gate.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved Gates and Boolean Algebra (2) The symbols and functional behavior for the five basic gates.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved Boolean Algebra (a) Truth table for majority function of three variables. (b) A circuit for (a).

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved Circuit Equivalence (1) Construction of (a) NOT, (b) AND, and (c) OR gates using only NAND gates or only NOR gates.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved Circuit Equivalence (2) Two equivalent functions (a) AB + AC, (b) A(B + C).

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved Circuit Equivalence (3) Some identities of Boolean algebra.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved Circuit Equivalence (4) Alternative symbols for some gates: (a) NAND, (b) NOR, (c) AND, (d) OR

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved Circuit Equivalence (5) (a) The truth table for the XOR function. (b-d) Three circuits for computing it.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved Circuit Equivalence (6) (a) Electrical characteristics of a device. (b) Positive logic. (c) Negative logic.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved Integrated Circuits An SSI chip containing four gates.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved Multiplexers (1) An eight-input multiplexer circuit.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved Multiplexers (2) (a) An MSI multiplexer. (b) The same multiplexer wired to compute the majority function.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved Decoders A 3-to-8 decoder circuit.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved Comparators A simple 4-bit comparator.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved Programmable Logic Arrays A 12-input, 6-output programmable logic array. The little squares represent fuses that can be burned out.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved Shifters A 1-bit left/right shifter.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved Adders (1) (a) A truth table for 1-bit addition. (b) A circuit for a half adder. (a) (b)

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved Adders (2) (a) Truth table for a full adder. (b) Circuit for a full adder.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved Arithmetic Logic Units (1) A 1-bit ALU.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved Arithmetic Logic Units (2) Eight 1-bit ALU slices connected to make an 8-bit ALU. The enables and invert signals are not shown for simplicity.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved Clocks (a) A clock. (b) The timing diagram for the clock. (c) Generation of an asymmetric clock.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved Latches (1) (a) NOR latch in state 0. (b) NOR latch in state 1. (c) Truth table for NOR.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved Latches (2) A clocked SR latch.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved Latches (3) A clocked D latch.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved Flip-Flops (1) (a) A pulse generator. (b) Timing at four points in the circuit.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved Flip-Flops (2) A D flip-flop.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved Flip-Flops (3) D latches and flip-flops.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved Flip-Flops (4) Dual D flip-flop.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved Flip-Flops (5) Octal flip-flop.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved Memory Organization (1) Logic diagram for a 4 x 3 memory. Each row is one of the four 3-bit words.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved Memory Organization (2) (a) A noninverting buffer. (b) Effect of (a) when control is high. (c) Effect of (a) when control is low. (d) An inverting buffer.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved Memory Chips (1) Two ways of organizing a 4-Mbit memory chip.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved Memory Chips (2) Two ways of organizing a 512 Mbit memory chip.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved Nonvolatile Memory Chips A comparison of various memory types.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved CPU Chips The logical pinout of a generic CPU. The arrows indicate input signals and output signals. The short diagonal lines indicate that multiple pins are used. For a specific CPU, a number will be given to tell how many.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved Computer Buses (1) A computer system with multiple buses.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved Computer Buses (2) Examples of bus masters and slaves.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved Bus Width Growth of an Address bus over time.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved Bus Clocking (1) Read timing on a synchronous bus.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved Bus Clocking (2) Specification of some critical times.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved Asynchronous Buses Operation of an asynchronous bus.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved Bus Arbitration (1) (a) A centralized one-level bus arbiter using daisy chaining. (b) The same arbiter, but with two levels.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved Bus Arbitration (2) Decentralized bus arbitration.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved Bus Operations (1) A block transfer.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved Bus Operations (2) Use of the 8259A interrupt controller.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved The Pentium 4 The Pentium 4 physical pinout.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved The Pentium 4’s Logical Pinout Logical pinout of the Pentium 4. Names in upper case are the office are the official Intel names for individual signals. Names in mixed case are groups of related signals or signal descriptions.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved Pipelining on the Pentium 4’s Memory Bus Pipelining requests on the Pentium 4’s memory bus.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved The UltraSPARC III (1) The UltraSPARC III CPU chip.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved The UltraSPARC III (2) The main features of the core of an UltraSPARC III system.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved The 8051 (1) Physical pinout of the 8051.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved The 8051 (2) Logical pinout of the 8051.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved The ISA Bus The PC/AT bus has two components, the original PC part and the new part.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved The PCI Bus (1) Architecture of an early Pentium system. The thicker buses have more bandwidth than the thinner ones but the figure is not to scale.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved The PCI Bus (2) The bus structure of a modern Pentium 4.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved PCI Bus Arbitration The PCI bus uses a centralized bus arbiter.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved PCI Bus Signals(1) Mandatory PCI bus signals.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved PCI Bus Signals(2) Optional PCI bus signals.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved PCI Bus Transactions Examples of 32-bit PCI bus transactions. The first three cycles are used for a read operation, then an idle cycle, and then three cycles for a write operation.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved PCI Express A typical PCI Express system.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved PCI Express Protocol Stack (a) The PCI Express protocol stack. (b) The format of a packet.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved The Universal Serial Bus The USB root hub sends out frames every 1.00 ms.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved PIO Chips An 8255A PIO chip.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved Address Decoding (1) Location of the EPROM, RAM, and PIO in our 64 KB address space.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved Address Decoding (2) Full address decoding.

Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved Address Decoding (3) Partial address decoding.