Computer Science. 19. Combinational Circuits. Computer Science. Building blocks Boolean algebra Digital circuits Adder circuit. Arithmetic/logic unit
|
|
- Letitia Adams
- 7 years ago
- Views:
Transcription
1 PA R T I I : A L G O R I T H M S, M A C H I N E S, a n d T H E O R Y PA R T I I : A L G O R I T H M S, M A C H I N E S, a n d T H E O R Y Computer Science 9. Combinational Circuits Computer Science 9. Combinational Circuits Building blocks Boolean algebra Digital circuits Adder circuit An Interdisciplinary Approach Section 6. Arithmetic/logic unit ROBERT SEDGEWICK K E V I N WAY N E CS.9.A.Circuits.Basics Context Wires Wires propagate on/off values ON (): connected to power. OFF (): not connected to power. Any wire connected to a wire that is ON is also ON. Drawing convention: "flow" from top, left to bottom, right. Q. What is a combinational circuit? A. A digital circuit (all signals are or ) with no feedback (no loops). analog circuit: signals vary continuously sequential circuit: loops allowed (stay tuned) Q. Why combinational circuits? A. Accurate, reliable, general purpose, fast, cheap. thick wires are ON Basic abstractions power connection On and off. Wire: propagates on/off value. Switch: controls propagation of on/off values through wires. thin wires are OFF Applications. Smartphone, tablet, game controller, antilock brakes, microprocessor,
2 Controlled Switch Controlled Switch Switches control propagation of on/off values through wires. Simplest case involves two connections: control (input) and. control OFF: ON control ON: OFF Switches control propagation of on/off values through wires. General case involves three connections: control input, data input and. control OFF: is connected to input control ON: is disconnected from input control input OFF control input OFF data input OFF control input ON control input ON OFF data input OFF control input OFF ON control input ON OFF data input ON 5 Controlled switch: example implementation ON data input ON Idealized model of pass transistors found in real integrated circuits. OFF 6 First level of abstraction A relay is a physical device that controls a switch with a magnet connections: input,, control. Magnetic force pulls on a contact that cuts electrical flow. schematic OFF control off Switches and wires model provides separation between physical world and logical world. We assume that switches operate as specified. That is the only assumption. Physical realization of switch is irrelevant to design. control on magnet (off ) contact connection broken Physical realization dictates performance Size. Speed. Power. magnet on pulls contact up New technology immediately gives new computer. spring Better switch? Better computer. Basis of Moore's law. 7 all built with "switches and wires" 8
3 Switches and wires: a first level of abstraction Switches and wires: a first level of abstraction technology technology information pneumatic air pressure switch switch VLSI = Very Large Scale Integration relay (9s) Technology Deposit materials on substrate. Key properties Lines are wires. Certain crossing lines are controlled switches. vacuum tube fluid relay (now) water pressure electric potential Amusing attempts that do not scale but prove the point Key challenge in physical world Fabricating physical circuits with billions of wires and controlled switches transistor pass transistor in integrated circuit Key challenge in abstract world Understanding behavior of circuits with billions of wires and controlled switches atom-thick transistor Bottom line. Circuit = Drawing (!) Real-world examples that prove the point 9 Circuit anatomy Image sources Need more levels of abstraction to understand circuit behavior CS.9.A.Circuits.Basics
4 PART II: ALGORITHMS, MACHINES, and THEORY Boolean algebra Developed by George Boole in 8s to study logic problems Variables represent true or false ( or for short). Basic operations are AND, OR, and NOT (see table below). Widely used in mathematics, logic and computer science. 9. Combinational Circuits Building blocks Boolean algebra Digital circuits Adder circuit Arithmetic/logic unit operation Java notation logic notation circuit design (this lecture) AND x && y x y xy OR x y x y x + y NOT! x x x' Example: (stay tuned for proof) DeMorgan's Laws (xy)' = (x' + y' ) (x + y)' = x'y' various notations in common use George Boole CS.9.B.Circuits.Algebra Relevance to circuits. Basis for next level of abstraction. Copyright, Sidney Harris Truth tables Truth table proofs A truth table is a systematic way to define a Boolean function One row for each possible set of arguments. Each row gives the function value for the specified arguments. N inputs: N rows needed. Truth tables are convenient for establishing identities in Boolean logic One row for each possibility. Identity established if columns match. x x' NOT x y xy x y x + y x y NOR x y XOR Proofs of DeMorgan's laws x y xy (xy) ' x y x' y' x' + y' x y x + y NOR (x + y)' NOR x y x' y' x'y' AND OR NOR XOR (xy)' = (x' + y' ) (x + y)' = x'y' 5 6
5 All Boolean functions of two variables Functions of three and more variables Q. How many Boolean functions of two variables? A. 6 (all possibilities for the bits in the truth table column). Q. How many Boolean functions of three variables? A. 56 (all possibilities for the 8 bits in the truth table column). Truth tables for all Boolean functions of variables x y ZERO AND x y XOR OR NOR EQ y x NAND ONE 7 AND OR NOR MAJ ODD Some Boolean functions of variables Examples AND logical AND iff any inputs is ( iff all inputs ) OR logical OR iff any input is ( iff all inputs ) NOR logical NOR iff any input is ( iff all inputs ) MAJ majority iff more inputs are than ODD odd parity iff an odd number of inputs are Q. How many Boolean functions of N variables? A. (N ) N all extend to N variables number of Boolean functions with N variables = 6 8 = 56 6 = 65,56 5 =,9,967, = 8,6,7,7,79,55,66 8 Universality of AND, OR and NOT Every Boolean function can be represented as a sum of products Form an AND term for each in Boolean function. OR all the terms together. Image sources MAJ x'yz xy'z xyz' xyz x'yz + xy'z + xyz' + xyz = MAJ Def. A set of operations is universal if every Boolean function can be expressed using just those operations. Fact. { AND, OR, NOT } is universal. Expressing MAJ as a sum of products 9 CS.9.B.Circuits.Algebra
6 PART II: ALGORITHMS, MACHINES, and THEORY A basis for digital devices Claude Shannon connected circuit design with Boolean algebra in Combinational Circuits Building blocks Boolean algebra Digital circuits Adder circuit Arithmetic/logic unit Possibly the most important, and also the most famous, master's thesis of the [th] Howard Gardner Key idea. Can use Boolean algebra to systematically analyze circuit behavior. Claude Shannon 96 CS.9.C.Circuits.Digital A second level of abstraction: logic gates Multiway OR gates boolean function NOT notation x' truth table x x' classic symbol x our symbol x' under the cover circuit (gate) x x' proof iff x is OR gates with multiple inputs. if any input is. if all inputs are. NOR (x + y)' x y NOR (x+y)' x y NOR (x+y)' x y (x+y)' iff x and y are both classic symbol u v w u+v+w+x+y+z our symbol u v w OR u+v+w+x+y+z under the cover u v w if inputs are ; if any input is u+v+w+x+y+z OR AND x + y xy x y OR x y AND x y OR x y AND x+y xy x y x y x+y xy NOR x+y = ((x + y)')' NOR xy = (x' + y')' Multiway OR gates are oriented vertically in our circuits. Learn to recognize them! examples
7 Multiway generalized AND gates Multiway generalized AND gates. for exactly set of input values. for all other sets of input values. Pop quiz on generalized AND gates Q. Give the Boolean function computed by these gates. Q. Also give the inputs for which the is. gate u v w function inputs that another set of inputs u v w AND uvwxyz u v w u v w generalized u'vwx'y'z NOR u v w u'v'w'x'y'z' same as (u + v + w + x + y + z)' Might also call these "generalized NOR gates"; we consistently use AND. 5 6 Pop quiz on generalized AND gates A useful combinational circuit: decoder Q. Give the Boolean function computed by these gates. Q. Also give the inputs for which the is. u v w uv'wxy'z x'y'z' x'y'z x'yz' Decoder n input lines (address). n s. Addressed is. All other s are. Example: -to-8 decoder = 6 u v w u'vwx'y'z x'yz xy'z' s -5 and 7 are Get the idea? If not, replay this slide, like flash cards. Note. From now on, we will not label these gates. xy'z xyz' xyz is 7 8
8 A useful combinational circuit: decoder Decoder n input lines (address). n s. Addressed is. All other s are. Example: -to-8 decoder = 6 Another useful combinational circuit: demultiplexer (demux) Demultiplexer n address inputs. data input with value x. n s. Addressed has value x. All other s are. Example: -to-8 demux = 5 x Implementation Use all n generalized AND gates with n inputs. Only one of them matches the input address. s -5 and 7 are s - and 6-7 are 5 5 has value x Application (next lecture) Select a memory word for read/write. [Use address bits of instruction from IR.] 6 is Another useful combinational circuit: demultiplexer (demux) Demultiplexer n address inputs. data input with value x. n s. Addressed has value x. All other s are. Example: -to-8 demux = 5 x Decoder/demux Decoder/demux n address inputs. data input with value x. n pairs. Addressed pair has value (, x ). All other s are. = 5 x Example: -to-8 decoder/demux Implementation Start with decoder. Add AND x to each gate. s - and 6-7 are pairs - and 6-7 are (, ) 5 5 has value x 5 pair 5 has value (, x) Application (next lecture) Turn on control wires to implement instructions. [Use opcode bits of instruction in IR.]
9 Decoder/demux Decoder/demux n address inputs. data input with value x. n pairs. Addressed pair has value (, x ). All other s are. Example: -to-8 decoder/demux = 5 x Creating a digital circuit that computes a boolean function: majority Use the truth table Identify rows where the function is. Use a generalized AND gate for each. OR the results together. Example : Majority function MAJ xyz multiway OR gate MAJ Implementation Add decoder to demux. pairs - and 6-7 are (, ) term gate pair 5 has value (, x) x'yz Application (next lecture) Access and control write of memory word [Use addr bits of instruction in IR.] MAJ = x'yz + xy'z + xyz' + xyz xy'z xyz' xyz MAJ majority circuit example MAJ is Creating a digital circuit that computes a boolean function: odd parity Combinational circuit design: Summary Use the truth table Identify rows where the function is. Use a generalized AND gate for each. OR the results together. Example : Odd parity function ODD term x'y'z x'yz' xy'z' gate xyz multiway OR gate ODD Problem: Design a circuit that computes a given boolean function. Ingredients OR gates. NOT gates. NOR gates. Wire. use to make generalized AND gates Method Step : Represent input and with Boolean variables. Step : Construct truth table to define the function. Step : Identify rows where the function is. Step : Use a generalized AND for each and OR the results. MAJ xyz MAJ ODD xyz ODD ODD = x'y'z + x'yz' + xy'z' + xyz xyz ODD odd parity circuit example ODD is 5 Bottom line (profound idea): Yields a circuit for ANY function. Caveat: Circuit might be huge (stay tuned). MAJ ODD 6
10 Pop quiz on combinational circuit design Q. Design a circuit to implement XOR(x, y). Pop quiz on combinational circuit design Q. Design a circuit to implement XOR(x, y). A. Use the truth table Identify rows where the function is. Use a generalized AND gate for each. OR the results together. XOR function circuit interface x y XOR xy term gate x'y xy' XOR = x'y + xy' XOR XOR 7 8 Encapsulation Encapsulation in hardware design mirrors familiar principles in software design Building a circuit from wires and switches is the implementation. Define a circuit by its inputs, controls, and s is the API. We control complexity by encapsulating circuits as we do with ADTs. Image sources NOT AND DECODER DEMULTIPLEXER DECODER/DEMUX ODD OR MAJ XOR 9 CS.9.C.Circuits.Digital
11 Let's make an adder circuit! 9. Combinational Circuits PART II: ALGORITHMS, MACHINES, and THEORY Adder Compute z = x + y for n-bit binary integers. n inputs. n s. Ignore overflow. ADD + 9 Building blocks Boolean algebra Digital circuits Adder circuit Arithmetic/logic unit carry out Example: 8-bit adder + CS.9.D.Circuits.Adder = 7 Let's make an adder circuit! Let's make an adder circuit! Adder Compute z = x + y for n-bit binary integers. n inputs. n s. Ignore overflow. x7 y7 x6 y6 x5 y5 x y x y x y x y x y ADD Goal: z = x + y for 8-bit integers. Strawman solution: Build truth tables for each bit. x7 x6 x5 x x x x x y7 y6 y5 y y y y y c z7 z6 z5 z z z z z c8 c7 c6 c5 c c c c x7 x6 x5 x x x x x + y7 y6 y5 y y y y y z7 z6 z5 z z z z z Example: 8-bit adder 8-bit adder truth table 6 = 6556 rows! carry out c8 c7 c6 c5 c c c c x7 x6 x5 x x x x x + y7 y6 y5 y y y y y z7 z6 z5 z z z z z Q. Not convinced this a bad idea? z7 z6 z5 z z z z z A. 8-bit adder: 56 rows >> # electrons in universe!
12 Let's make an adder circuit! Let's make an adder circuit! Goal: z = x + y for 8-bit integers. Do one bit at a time. Build truth table for carry bit. Build truth table for sum bit. carry bit xi yi ci ci+ MAJ A surprise! Carry bit is MAJ. Sum bit is ODD. sum bit xi yi ci zi c8 c7 c6 c5 c c c c x7 x6 x5 x x x x x + y7 y6 y5 y y y y y z7 z6 z5 z z z z z ODD Goal: z = x + y for -bit integers. Do one bit at a time. Carry bit is MAJ. Sum bit is ODD. Chain -bit adders to "ripple" carries. c8 c7 c6 c5 c c c c x7 x6 x5 x x x x x + y7 y6 y5 y y y y y z7 z6 z5 z z z z z x7 y7 x6 y6 x5 y5 x y x y x y x y x y c7 c6 c5 c c c c c z7 z6 z5 z z z z z 5 6 An 8-bit adder circuit Layers of abstraction Lessons for software design apply to hardware Interface describes behavior of circuit. Implementation gives details of how to build it. Exploit understanding of behavior at each level. Layers of abstraction apply with a vengeance On/off. Controlled switch. [relay, pass transistor] Gates. [NOT, OR, AND] Boolean functions. [MAJ, ODD] Adder. Arithmetic/Logic unit (next). CPU (next lecture, stay tuned). ADD NOT OR AND MAJ ODD Vastly simplifies design of complex systems and enables use of new technology at any layer 7 8
13 PART II: ALGORITHMS, MACHINES, and THEORY 9. Combinational Circuits Building blocks Boolean algebra Digital circuits Adder circuit Arithmetic/logic unit CS.9.D.Circuits.Adder CS.9.E.Circuits.ALU Next layer of abstraction: modules, busses, and control lines Arithmetic and logic unit (ALU) module Basic design of our circuits Organized as modules (functional units of TOY: ALU, memory, register, PC, and IR). Connected by busses (groups of wires that propagate information between modules). Controlled by control lines (single wires that control circuit behavior). Ex. Three functions on 8-bit words Two input busses (arguments). One bus (result). Three control lines. input busses ALU (8-bit) Conventions Bus inputs are at the top, input connections are at the left. Bus s are at the bottom, connections are at the right. Control lines are blue. input busses control lines control lines ADD XOR These conventions make circuits easy to understand. (Like style conventions in coding.) bus 5 AND bus 5
14 Arithmetic and logic unit (ALU) module A simple and useful combinational circuit: one-hot multiplexer Ex. Three functions on 8-bit words Two input busses (arguments). One bus (result). Three control lines. Left-right shifter circuits omitted (see book for details). input busses One-hot multiplexer m selection lines m data inputs. At most one selection line is. Output has value of selected input. selection inputs this is a precondition unlike other circuits we consider select input data input is all other data inputs ignored Implementation One circuit for each function. Compute all values in parallel. ADD is Q. How do we select desired? A. "One-hot muxes" (see next slide). control lines XOR AND data inputs data input is "Calculator" at the heart of your computer. bus 5 is 5 A simple and useful combinational circuit: one-hot multiplexer One-hot multiplexer m selection lines m data inputs. At most one selection line is. Output has value of selected input. Implementation AND corresponding selection and data inputs. OR all results (at most one is ). AND gate multiway OR gate select input data input is is Summary: Useful combinational circuit modules DEMUX DECODER/DEMUX ALU Applications Arithmetic-logic unit (previous slide). Main memory (next lecture). data input is Important to note. No direct connection from input to. a virtual selection switch is 55 Next: Registers, memory, connections, and control. 56
15 PA R T I I : A L G O R I T H M S, M A C H I N E S, a n d T H E O R Y Computer Science Computer Science An Interdisciplinary Approach Section 6. ROBERT SEDGEWICK K E V I N WAY N E CS.9.D.Circuits.Adder 9. Combinational Circuits
CHAPTER 3 Boolean Algebra and Digital Logic
CHAPTER 3 Boolean Algebra and Digital Logic 3.1 Introduction 121 3.2 Boolean Algebra 122 3.2.1 Boolean Expressions 123 3.2.2 Boolean Identities 124 3.2.3 Simplification of Boolean Expressions 126 3.2.4
More informationDigital Logic Design. Basics Combinational Circuits Sequential Circuits. Pu-Jen Cheng
Digital Logic Design Basics Combinational Circuits Sequential Circuits Pu-Jen Cheng Adapted from the slides prepared by S. Dandamudi for the book, Fundamentals of Computer Organization and Design. Introduction
More informationGates, Circuits, and Boolean Algebra
Gates, Circuits, and Boolean Algebra Computers and Electricity A gate is a device that performs a basic operation on electrical signals Gates are combined into circuits to perform more complicated tasks
More informationBinary Adders: Half Adders and Full Adders
Binary Adders: Half Adders and Full Adders In this set of slides, we present the two basic types of adders: 1. Half adders, and 2. Full adders. Each type of adder functions to add two binary bits. In order
More information1. True or False? A voltage level in the range 0 to 2 volts is interpreted as a binary 1.
File: chap04, Chapter 04 1. True or False? A voltage level in the range 0 to 2 volts is interpreted as a binary 1. 2. True or False? A gate is a device that accepts a single input signal and produces one
More informationLet s put together a Manual Processor
Lecture 14 Let s put together a Manual Processor Hardware Lecture 14 Slide 1 The processor Inside every computer there is at least one processor which can take an instruction, some operands and produce
More informationChapter 4 Register Transfer and Microoperations. Section 4.1 Register Transfer Language
Chapter 4 Register Transfer and Microoperations Section 4.1 Register Transfer Language Digital systems are composed of modules that are constructed from digital components, such as registers, decoders,
More informationUnderstanding Logic Design
Understanding Logic Design ppendix of your Textbook does not have the needed background information. This document supplements it. When you write add DD R0, R1, R2, you imagine something like this: R1
More informationCombinational circuits
Combinational circuits Combinational circuits are stateless The outputs are functions only of the inputs Inputs Combinational circuit Outputs 3 Thursday, September 2, 3 Enabler Circuit (High-level view)
More informationLogic in Computer Science: Logic Gates
Logic in Computer Science: Logic Gates Lila Kari The University of Western Ontario Logic in Computer Science: Logic Gates CS2209, Applied Logic for Computer Science 1 / 49 Logic and bit operations Computers
More informationexclusive-or and Binary Adder R eouven Elbaz reouven@uwaterloo.ca Office room: DC3576
exclusive-or and Binary Adder R eouven Elbaz reouven@uwaterloo.ca Office room: DC3576 Outline exclusive OR gate (XOR) Definition Properties Examples of Applications Odd Function Parity Generation and Checking
More informationTake-Home Exercise. z y x. Erik Jonsson School of Engineering and Computer Science. The University of Texas at Dallas
Take-Home Exercise Assume you want the counter below to count mod-6 backward. That is, it would count 0-5-4-3-2-1-0, etc. Assume it is reset on startup, and design the wiring to make the counter count
More informationChapter 2 Logic Gates and Introduction to Computer Architecture
Chapter 2 Logic Gates and Introduction to Computer Architecture 2.1 Introduction The basic components of an Integrated Circuit (IC) is logic gates which made of transistors, in digital system there are
More informationDigital Electronics Detailed Outline
Digital Electronics Detailed Outline Unit 1: Fundamentals of Analog and Digital Electronics (32 Total Days) Lesson 1.1: Foundations and the Board Game Counter (9 days) 1. Safety is an important concept
More informationSistemas Digitais I LESI - 2º ano
Sistemas Digitais I LESI - 2º ano Lesson 6 - Combinational Design Practices Prof. João Miguel Fernandes (miguel@di.uminho.pt) Dept. Informática UNIVERSIDADE DO MINHO ESCOLA DE ENGENHARIA - PLDs (1) - The
More information5 Combinatorial Components. 5.0 Full adder. Full subtractor
5 Combatorial Components Use for data transformation, manipulation, terconnection, and for control: arithmetic operations - addition, subtraction, multiplication and division. logic operations - AND, OR,
More informationLab 1: Full Adder 0.0
Lab 1: Full Adder 0.0 Introduction In this lab you will design a simple digital circuit called a full adder. You will then use logic gates to draw a schematic for the circuit. Finally, you will verify
More informationSystems I: Computer Organization and Architecture
Systems I: Computer Organization and Architecture Lecture 9 - Register Transfer and Microoperations Microoperations Digital systems are modular in nature, with modules containing registers, decoders, arithmetic
More informationFigure 8-1 Four Possible Results of Adding Two Bits
CHPTER EIGHT Combinational Logic pplications Thus far, our discussion has focused on the theoretical design issues of computer systems. We have not yet addressed any of the actual hardware you might find
More information(Refer Slide Time: 00:01:16 min)
Digital Computer Organization Prof. P. K. Biswas Department of Electronic & Electrical Communication Engineering Indian Institute of Technology, Kharagpur Lecture No. # 04 CPU Design: Tirning & Control
More information3.Basic Gate Combinations
3.Basic Gate Combinations 3.1 TTL NAND Gate In logic circuits transistors play the role of switches. For those in the TTL gate the conducting state (on) occurs when the baseemmiter signal is high, and
More informationCOMBINATIONAL CIRCUITS
COMBINATIONAL CIRCUITS http://www.tutorialspoint.com/computer_logical_organization/combinational_circuits.htm Copyright tutorialspoint.com Combinational circuit is a circuit in which we combine the different
More informationCircuits and Boolean Expressions
Circuits and Boolean Expressions Provided by TryEngineering - Lesson Focus Boolean logic is essential to understanding computer architecture. It is also useful in program construction and Artificial Intelligence.
More informationLecture 5: Gate Logic Logic Optimization
Lecture 5: Gate Logic Logic Optimization MAH, AEN EE271 Lecture 5 1 Overview Reading McCluskey, Logic Design Principles- or any text in boolean algebra Introduction We could design at the level of irsim
More informationBasic Logic Gates Richard E. Haskell
BASIC LOGIC GATES 1 E Basic Logic Gates Richard E. Haskell All digital systems are made from a few basic digital circuits that we call logic gates. These circuits perform the basic logic functions that
More informationLecture #21 April 2, 2004 Relays and Adder/Subtractors
Lecture #21 April 2, 2004 Relays and Adder/Subtractors In this lecture we look at a real technology for implementing gate circuits, as well as a more-or-less complete design for a general purpose adder/subtractor
More informationECE410 Design Project Spring 2008 Design and Characterization of a CMOS 8-bit Microprocessor Data Path
ECE410 Design Project Spring 2008 Design and Characterization of a CMOS 8-bit Microprocessor Data Path Project Summary This project involves the schematic and layout design of an 8-bit microprocessor data
More informationTwo-level logic using NAND gates
CSE140: Components and Design Techniques for Digital Systems Two and Multilevel logic implementation Tajana Simunic Rosing 1 Two-level logic using NND gates Replace minterm ND gates with NND gates Place
More informationCSE140 Homework #7 - Solution
CSE140 Spring2013 CSE140 Homework #7 - Solution You must SHOW ALL STEPS for obtaining the solution. Reporting the correct answer, without showing the work performed at each step will result in getting
More informationFORDHAM UNIVERSITY CISC 3593. Dept. of Computer and Info. Science Spring, 2011. Lab 2. The Full-Adder
FORDHAM UNIVERSITY CISC 3593 Fordham College Lincoln Center Computer Organization Dept. of Computer and Info. Science Spring, 2011 Lab 2 The Full-Adder 1 Introduction In this lab, the student will construct
More informationA single register, called the accumulator, stores the. operand before the operation, and stores the result. Add y # add y from memory to the acc
Other architectures Example. Accumulator-based machines A single register, called the accumulator, stores the operand before the operation, and stores the result after the operation. Load x # into acc
More informationEE360: Digital Design I Course Syllabus
: Course Syllabus Dr. Mohammad H. Awedh Fall 2008 Course Description This course introduces students to the basic concepts of digital systems, including analysis and design. Both combinational and sequential
More informationwhat operations can it perform? how does it perform them? on what kind of data? where are instructions and data stored?
Inside the CPU how does the CPU work? what operations can it perform? how does it perform them? on what kind of data? where are instructions and data stored? some short, boring programs to illustrate the
More informationUnited States Naval Academy Electrical and Computer Engineering Department. EC262 Exam 1
United States Naval Academy Electrical and Computer Engineering Department EC262 Exam 29 September 2. Do a page check now. You should have pages (cover & questions). 2. Read all problems in their entirety.
More informationLecture 12: More on Registers, Multiplexers, Decoders, Comparators and Wot- Nots
Lecture 12: More on Registers, Multiplexers, Decoders, Comparators and Wot- Nots Registers As you probably know (if you don t then you should consider changing your course), data processing is usually
More informationBOOLEAN ALGEBRA & LOGIC GATES
BOOLEAN ALGEBRA & LOGIC GATES Logic gates are electronic circuits that can be used to implement the most elementary logic expressions, also known as Boolean expressions. The logic gate is the most basic
More informationKarnaugh Maps. Circuit-wise, this leads to a minimal two-level implementation
Karnaugh Maps Applications of Boolean logic to circuit design The basic Boolean operations are AND, OR and NOT These operations can be combined to form complex expressions, which can also be directly translated
More information6.080/6.089 GITCS Feb 12, 2008. Lecture 3
6.8/6.89 GITCS Feb 2, 28 Lecturer: Scott Aaronson Lecture 3 Scribe: Adam Rogal Administrivia. Scribe notes The purpose of scribe notes is to transcribe our lectures. Although I have formal notes of my
More informationC H A P T E R. Logic Circuits
C H A P T E R Logic Circuits Many important functions are naturally computed with straight-line programs, programs without loops or branches. Such computations are conveniently described with circuits,
More informationCS101 Lecture 26: Low Level Programming. John Magee 30 July 2013 Some material copyright Jones and Bartlett. Overview/Questions
CS101 Lecture 26: Low Level Programming John Magee 30 July 2013 Some material copyright Jones and Bartlett 1 Overview/Questions What did we do last time? How can we control the computer s circuits? How
More informationCPU Organisation and Operation
CPU Organisation and Operation The Fetch-Execute Cycle The operation of the CPU 1 is usually described in terms of the Fetch-Execute cycle. 2 Fetch-Execute Cycle Fetch the Instruction Increment the Program
More informationGates & Boolean Algebra. Boolean Operators. Combinational Logic. Introduction
Introduction Gates & Boolean lgebra Boolean algebra: named after mathematician George Boole (85 864). 2-valued algebra. digital circuit can have one of 2 values. Signal between and volt =, between 4 and
More informationCHAPTER 2. Logic. 1. Logic Definitions. Notation: Variables are used to represent propositions. The most common variables used are p, q, and r.
CHAPTER 2 Logic 1. Logic Definitions 1.1. Propositions. Definition 1.1.1. A proposition is a declarative sentence that is either true (denoted either T or 1) or false (denoted either F or 0). Notation:
More informationNEW adder cells are useful for designing larger circuits despite increase in transistor count by four per cell.
CHAPTER 4 THE ADDER The adder is one of the most critical components of a processor, as it is used in the Arithmetic Logic Unit (ALU), in the floating-point unit and for address generation in case of cache
More informationCombinational Logic Design
Chapter 4 Combinational Logic Design The foundations for the design of digital logic circuits were established in the preceding chapters. The elements of Boolean algebra (two-element switching algebra
More informationMICROPROCESSOR AND MICROCOMPUTER BASICS
Introduction MICROPROCESSOR AND MICROCOMPUTER BASICS At present there are many types and sizes of computers available. These computers are designed and constructed based on digital and Integrated Circuit
More informationCSE140: Components and Design Techniques for Digital Systems
CSE4: Components and Design Techniques for Digital Systems Tajana Simunic Rosing What we covered thus far: Number representations Logic gates Boolean algebra Introduction to CMOS HW#2 due, HW#3 assigned
More informationComputer organization
Computer organization Computer design an application of digital logic design procedures Computer = processing unit + memory system Processing unit = control + datapath Control = finite state machine inputs
More informationFORDHAM UNIVERSITY CISC 3593. Dept. of Computer and Info. Science Spring, 2011. The Binary Adder
FORDHAM UNIVERITY CIC 3593 Fordham College Lincoln Center Computer Organization Dept. of Computer and Info. cience pring, 2011 1 Introduction The Binar Adder The binar adder circuit is an important building
More informationMICROPROCESSOR. Exclusive for IACE Students www.iace.co.in iacehyd.blogspot.in Ph: 9700077455/422 Page 1
MICROPROCESSOR A microprocessor incorporates the functions of a computer s central processing unit (CPU) on a single Integrated (IC), or at most a few integrated circuit. It is a multipurpose, programmable
More informationGates. J. Robert Jump Department of Electrical And Computer Engineering Rice University Houston, TX 77251
Gates J. Robert Jump Department of Electrical And Computer Engineering Rice University Houston, T 77251 1. The Evolution of Electronic Digital Devices...1 2. Logical Operations and the Behavior of Gates...2
More informationBuilding a computer. Electronic Numerical Integrator and Computer (ENIAC)
Building a computer Electronic Numerical Integrator and Computer (ENIAC) CSCI 255: Introduc/on to Embedded Systems Keith Vertanen Copyright 2011 Layers of abstrac
More informationearlier in the semester: The Full adder above adds two bits and the output is at the end. So if we do this eight times, we would have an 8-bit adder.
The circuit created is an 8-bit adder. The 8-bit adder adds two 8-bit binary inputs and the result is produced in the output. In order to create a Full 8-bit adder, I could use eight Full -bit adders and
More informationAdder.PPT(10/1/2009) 5.1. Lecture 13. Adder Circuits
Adder.T(//29) 5. Lecture 3 Adder ircuits Objectives Understand how to add both signed and unsigned numbers Appreciate how the delay of an adder circuit depends on the data values that are being added together
More informationPROGRAMMABLE LOGIC CONTROLLERS Unit code: A/601/1625 QCF level: 4 Credit value: 15 OUTCOME 3 PART 1
UNIT 22: PROGRAMMABLE LOGIC CONTROLLERS Unit code: A/601/1625 QCF level: 4 Credit value: 15 OUTCOME 3 PART 1 This work covers part of outcome 3 of the Edexcel standard module: Outcome 3 is the most demanding
More informationDEPARTMENT OF INFORMATION TECHNLOGY
DRONACHARYA GROUP OF INSTITUTIONS, GREATER NOIDA Affiliated to Mahamaya Technical University, Noida Approved by AICTE DEPARTMENT OF INFORMATION TECHNLOGY Lab Manual for Computer Organization Lab ECS-453
More informationA s we saw in Chapter 4, a CPU contains three main sections: the register section,
6 CPU Design A s we saw in Chapter 4, a CPU contains three main sections: the register section, the arithmetic/logic unit (ALU), and the control unit. These sections work together to perform the sequences
More information150127-Microprocessor & Assembly Language
Chapter 3 Z80 Microprocessor Architecture The Z 80 is one of the most talented 8 bit microprocessors, and many microprocessor-based systems are designed around the Z80. The Z80 microprocessor needs an
More informationDigital circuits make up all computers and computer systems. The operation of digital circuits is based on
Digital Logic Circuits Digital circuits make up all computers and computer systems. The operation of digital circuits is based on Boolean algebra, the mathematics of binary numbers. Boolean algebra is
More informationComputer System: User s View. Computer System Components: High Level View. Input. Output. Computer. Computer System: Motherboard Level
System: User s View System Components: High Level View Input Output 1 System: Motherboard Level 2 Components: Interconnection I/O MEMORY 3 4 Organization Registers ALU CU 5 6 1 Input/Output I/O MEMORY
More informationCHAPTER 7: The CPU and Memory
CHAPTER 7: The CPU and Memory The Architecture of Computer Hardware, Systems Software & Networking: An Information Technology Approach 4th Edition, Irv Englander John Wiley and Sons 2010 PowerPoint slides
More informationBinary Division. Decimal Division. Hardware for Binary Division. Simple 16-bit Divider Circuit
Decimal Division Remember 4th grade long division? 43 // quotient 12 521 // divisor dividend -480 41-36 5 // remainder Shift divisor left (multiply by 10) until MSB lines up with dividend s Repeat until
More informationManagement Challenge. Managing Hardware Assets. Central Processing Unit. What is a Computer System?
Management Challenge Managing Hardware Assets What computer processing and storage capability does our organization need to handle its information and business transactions? What arrangement of computers
More informationINTRODUCTION TO DIGITAL SYSTEMS. IMPLEMENTATION: MODULES (ICs) AND NETWORKS IMPLEMENTATION OF ALGORITHMS IN HARDWARE
INTRODUCTION TO DIGITAL SYSTEMS 1 DESCRIPTION AND DESIGN OF DIGITAL SYSTEMS FORMAL BASIS: SWITCHING ALGEBRA IMPLEMENTATION: MODULES (ICs) AND NETWORKS IMPLEMENTATION OF ALGORITHMS IN HARDWARE COURSE EMPHASIS:
More informationLecture 8: Synchronous Digital Systems
Lecture 8: Synchronous Digital Systems The distinguishing feature of a synchronous digital system is that the circuit only changes in response to a system clock. For example, consider the edge triggered
More informationCHAPTER 4 MARIE: An Introduction to a Simple Computer
CHAPTER 4 MARIE: An Introduction to a Simple Computer 4.1 Introduction 195 4.2 CPU Basics and Organization 195 4.2.1 The Registers 196 4.2.2 The ALU 197 4.2.3 The Control Unit 197 4.3 The Bus 197 4.4 Clocks
More informationDigital Electronics Part I Combinational and Sequential Logic. Dr. I. J. Wassell
Digital Electronics Part I Combinational and Sequential Logic Dr. I. J. Wassell Introduction Aims To familiarise students with Combinational logic circuits Sequential logic circuits How digital logic gates
More informationProgramming Logic controllers
Programming Logic controllers Programmable Logic Controller (PLC) is a microprocessor based system that uses programmable memory to store instructions and implement functions such as logic, sequencing,
More informationRead-only memory Implementing logic with ROM Programmable logic devices Implementing logic with PLDs Static hazards
Points ddressed in this Lecture Lecture 8: ROM Programmable Logic Devices Professor Peter Cheung Department of EEE, Imperial College London Read-only memory Implementing logic with ROM Programmable logic
More informationCOMBINATIONAL and SEQUENTIAL LOGIC CIRCUITS Hardware implementation and software design
PH-315 COMINATIONAL and SEUENTIAL LOGIC CIRCUITS Hardware implementation and software design A La Rosa I PURPOSE: To familiarize with combinational and sequential logic circuits Combinational circuits
More informationHaving read this workbook you should be able to: recognise the arrangement of NAND gates used to form an S-R flip-flop.
Objectives Having read this workbook you should be able to: recognise the arrangement of NAND gates used to form an S-R flip-flop. describe how such a flip-flop can be SET and RESET. describe the disadvantage
More informationDigital Circuit Design
Test and Diagnosis of of ICs Fault coverage (%) 95 9 85 8 75 7 65 97.92 SSL 4,246 Shawn Blanton Professor Department of ECE Center for Silicon System Implementation CMU Laboratory for Integrated Systems
More informationDesign and Development of Virtual Instrument (VI) Modules for an Introductory Digital Logic Course
Session ENG 206-6 Design and Development of Virtual Instrument (VI) Modules for an Introductory Digital Logic Course Nikunja Swain, Ph.D., PE South Carolina State University swain@scsu.edu Raghu Korrapati,
More informationMemory Systems. Static Random Access Memory (SRAM) Cell
Memory Systems This chapter begins the discussion of memory systems from the implementation of a single bit. The architecture of memory chips is then constructed using arrays of bit implementations coupled
More informationProgrammable Logic Controllers Definition. Programmable Logic Controllers History
Definition A digitally operated electronic apparatus which uses a programmable memory for the internal storage of instructions for implementing specific functions such as logic, sequencing, timing, counting,
More informationDigital Systems Based on Principles and Applications of Electrical Engineering/Rizzoni (McGraw Hill
Digital Systems Based on Principles and Applications of Electrical Engineering/Rizzoni (McGraw Hill Objectives: Analyze the operation of sequential logic circuits. Understand the operation of digital counters.
More informationFlip-Flops, Registers, Counters, and a Simple Processor
June 8, 22 5:56 vra235_ch7 Sheet number Page number 349 black chapter 7 Flip-Flops, Registers, Counters, and a Simple Processor 7. Ng f3, h7 h6 349 June 8, 22 5:56 vra235_ch7 Sheet number 2 Page number
More informationETEC 2301 Programmable Logic Devices. Chapter 10 Counters. Shawnee State University Department of Industrial and Engineering Technologies
ETEC 2301 Programmable Logic Devices Chapter 10 Counters Shawnee State University Department of Industrial and Engineering Technologies Copyright 2007 by Janna B. Gallaher Asynchronous Counter Operation
More informationFormal Languages and Automata Theory - Regular Expressions and Finite Automata -
Formal Languages and Automata Theory - Regular Expressions and Finite Automata - Samarjit Chakraborty Computer Engineering and Networks Laboratory Swiss Federal Institute of Technology (ETH) Zürich March
More informationCMOS Binary Full Adder
CMOS Binary Full Adder A Survey of Possible Implementations Group : Eren Turgay Aaron Daniels Michael Bacelieri William Berry - - Table of Contents Key Terminology...- - Introduction...- 3 - Design Architectures...-
More informationEE 261 Introduction to Logic Circuits. Module #2 Number Systems
EE 261 Introduction to Logic Circuits Module #2 Number Systems Topics A. Number System Formation B. Base Conversions C. Binary Arithmetic D. Signed Numbers E. Signed Arithmetic F. Binary Codes Textbook
More informationMathematical Induction
Mathematical Induction In logic, we often want to prove that every member of an infinite set has some feature. E.g., we would like to show: N 1 : is a number 1 : has the feature Φ ( x)(n 1 x! 1 x) How
More informationBoolean Algebra. Boolean Algebra. Boolean Algebra. Boolean Algebra
2 Ver..4 George Boole was an English mathematician of XIX century can operate on logic (or Boolean) variables that can assume just 2 values: /, true/false, on/off, closed/open Usually value is associated
More informationMULTIPLE CHOICE FREE RESPONSE QUESTIONS
MULTIPLE CHOICE FREE RESPONSE QUESTIONS World ORT Union I n p u t d e v i c e s Where would you find the letters QUERTY? A. Mouse B. Keyboard C.Numeric Keypad How did the computer mouse get its name? A.
More informationSimplifying Logic Circuits with Karnaugh Maps
Simplifying Logic Circuits with Karnaugh Maps The circuit at the top right is the logic equivalent of the Boolean expression: f = abc + abc + abc Now, as we have seen, this expression can be simplified
More informationSystems I: Computer Organization and Architecture
Systems I: Computer Organization and Architecture Lecture : Microprogrammed Control Microprogramming The control unit is responsible for initiating the sequence of microoperations that comprise instructions.
More informationBoolean Algebra Part 1
Boolean Algebra Part 1 Page 1 Boolean Algebra Objectives Understand Basic Boolean Algebra Relate Boolean Algebra to Logic Networks Prove Laws using Truth Tables Understand and Use First Basic Theorems
More informationCS 61C: Great Ideas in Computer Architecture Finite State Machines. Machine Interpreta4on
CS 61C: Great Ideas in Computer Architecture Finite State Machines Instructors: Krste Asanovic & Vladimir Stojanovic hbp://inst.eecs.berkeley.edu/~cs61c/sp15 1 Levels of RepresentaKon/ InterpretaKon High
More informationLecture 1: Course overview, circuits, and formulas
Lecture 1: Course overview, circuits, and formulas Topics in Complexity Theory and Pseudorandomness (Spring 2013) Rutgers University Swastik Kopparty Scribes: John Kim, Ben Lund 1 Course Information Swastik
More informationMultiplexers Two Types + Verilog
Multiplexers Two Types + Verilog ENEE 245: Digital Circuits and ystems Laboratory Lab 7 Objectives The objectives of this laboratory are the following: To become familiar with continuous ments and procedural
More informationChapter 1. Computation theory
Chapter 1. Computation theory In this chapter we will describe computation logic for the machines. This topic is a wide interdisciplinary field, so that the students can work in an interdisciplinary context.
More informationDIGITAL-TO-ANALOGUE AND ANALOGUE-TO-DIGITAL CONVERSION
DIGITAL-TO-ANALOGUE AND ANALOGUE-TO-DIGITAL CONVERSION Introduction The outputs from sensors and communications receivers are analogue signals that have continuously varying amplitudes. In many systems
More information1. Convert the following base 10 numbers into 8-bit 2 s complement notation 0, -1, -12
C5 Solutions 1. Convert the following base 10 numbers into 8-bit 2 s complement notation 0, -1, -12 To Compute 0 0 = 00000000 To Compute 1 Step 1. Convert 1 to binary 00000001 Step 2. Flip the bits 11111110
More informationTYPES OF COMPUTERS AND THEIR PARTS MULTIPLE CHOICE QUESTIONS
MULTIPLE CHOICE QUESTIONS 1. What is a computer? a. A programmable electronic device that processes data via instructions to output information for future use. b. Raw facts and figures that has no meaning
More informationECE 3401 Lecture 7. Concurrent Statements & Sequential Statements (Process)
ECE 3401 Lecture 7 Concurrent Statements & Sequential Statements (Process) Concurrent Statements VHDL provides four different types of concurrent statements namely: Signal Assignment Statement Simple Assignment
More informationUsing Logic to Design Computer Components
CHAPTER 13 Using Logic to Design Computer Components Parallel and sequential operation In this chapter we shall see that the propositional logic studied in the previous chapter can be used to design digital
More informationCS311 Lecture: Sequential Circuits
CS311 Lecture: Sequential Circuits Last revised 8/15/2007 Objectives: 1. To introduce asynchronous and synchronous flip-flops (latches and pulsetriggered, plus asynchronous preset/clear) 2. To introduce
More informationEE 42/100 Lecture 24: Latches and Flip Flops. Rev B 4/21/2010 (2:04 PM) Prof. Ali M. Niknejad
A. M. Niknejad University of California, Berkeley EE 100 / 42 Lecture 24 p. 1/20 EE 42/100 Lecture 24: Latches and Flip Flops ELECTRONICS Rev B 4/21/2010 (2:04 PM) Prof. Ali M. Niknejad University of California,
More information