CpE358/CS381. Switching Theory and Logical Design. Summer


 Stephen McKinney
 1 years ago
 Views:
Transcription
1 Switching Theory and Logical Design 
2 Class Schedule Monday Tuesday Wednesday Thursday Friday May Class 2  Class Class Class Quiz Commencement 3 June 2  Class Class 6 4 Memorial Day Project defined 7  Class Class 8  Class 9 Quiz Class Class 7  Class 2 8 Quiz Class Class Class 5 25 Quiz 4 Projects due 28  Class Class 7 July 7/2 Quiz 52
3 Course Introduction Logistics: Instructor: Bruce McNair Office: Burchard 26 Phone: Office hours: Class days ~9:3  ~ Web site: (course notes, solutions, etc. are here) Homework Must be typed or printed hardcopy, or electronic (i.e., not handwritten). is OK with MS/Office (2 or previous), or program (e.g.,.c,.m,...) attachments. Don t me an executable or a macrovirus. pdf is OK. VERIFY THAT PROGRAMMING SUBMISSIONS INCLUDE ENOUGH ENVIRONMENT TO BE BUILT AND RUN (e.g.,.h files, initialization, etc.) Include the problem statement with solution. Keep a copy of your hardcopy or electronic homework (it may not be returned) If you submit homework as an attachment, make sure your name appears in the file. The file name must include your name (or login), course number, and assignment number, e.g.: bmcnaircpe358hw2.doc To ensure proper credit for the homework, indicate the due date on the homework Homework will be due at the second class after it is assigned. (E.g., Class homework is due during Class 3) My goal is to grade it and post the solution within a week. Problem solutions will be posted on my web site I do not penalize late homework, but HOMEWORK WILL NOT BE ACCEPTED AFTER THE SOLUTION IS POSTED Grading All items are INDIVIDUAL effort Homework: 25% Project: 25% Weekly tests: % each (5%) Detailed grades and status will be posted on WebCT 3
4 Course Introduction (continued) Course project requirements will be defined in Class 5 Project will be due in Class 5 Project will be an individual (paper) design of a modestly complex digital system using all of the design and analysis techniques covered in the class Specific examples of design problems will be provided (e.g., traffic light controller, digital clock, safety interlocks on door controllers, etc.) Multiple projects can be completed of varying levels of difficulty 4
5 Course Introduction (continued) Course description: Digital systems; number systems and codes; Boolean algebra; application of Boolean algebra to switching circuits; minimization of Boolean functions using algebraic, Karnaugh map, and tabular methods; programmable logic devices; sequential circuit components; design and analysis of synchronous and asynchronous sequential circuits Textbook M. Morris Mano, Digital Design, Third Edition, Prentice Hall, Engelwood Cliffs, NJ, 22. ISBN My approach: Practical, realworld examples Multiple perspectives on an issue 5
6 Topics Fundamental concepts of digital systems Binary codes and number systems Boolean algebra Simplification of switching equations Digital device characteristics (e.g., TTL, CMOS) and design considerations Combinatoric logical design including LSI implementation Hazards, Races, and time related issues in digital design Flipflops and state memory elements Sequential logic analysis and design Synchronous vs. asynchronous design Counters, shift register circuits Memory and Programmable logic Minimization of sequential systems Introduction to Finite Automata 6
7 ABET Course Objectives By the end of this course, students should be able to: Understand number systems and codes and their application to digital circuits; understand Boolean algebra and its application to the design and characterization of digital circuits (A) Understand the mathematical characteristics of logic gates (4A) Use truth tables, Boolean algebra, Karnaugh maps, and other methods to obtain design equations Use design equations and procedures to design combinatorial and sequential systems consisting of gates and flipflops (4C) Combine combinatorial circuits and flipflops to design combinatorial and sequential system (5B) Consider alternatives to traditional design techniques to simplify the design process to yield innovative designs (5E) 7
8 Today s Material Fundamental concepts of digital systems (Mano Chapter ) Binary codes, number systems, and arithmetic (Ch ) Boolean algebra (Ch 2) Simplification of switching equations (Ch 3) Digital device characteristics (e.g., TTL, CMOS)/design considerations (Ch ) Combinatoric logical design including LSI implementation (Chapter 4) Hazards, Races, and time related issues in digital design (Ch 9) Flipflops and state memory elements (Ch 5) Sequential logic analysis and design (Ch 5) Synchronous vs. asynchronous design (Ch 9) Counters, shift register circuits (Ch 6) Memory and Programmable logic (Ch 7) Minimization of sequential systems Introduction to Finite Automata 8
9 Why Digital? Analog computers were the standard for simulation in the 94s and 5s: v(t) G dv 2 dv G G dt 2 2 G2 dt G 2 dv dv G2 + G 2 + v dt dt Issues: precision, stability, accuracy, aging, noise, Manufacturing and testing are labor intensive processes 9
10 Why Digital? Digital circuits have become the standard for computing, control, and many other applications D Q D Q D Q Q Q Q Functions can be created with a small set of functional elements Designs are stable and repeatable Costs and size are rapidly dropping while speed and functionality increase 
11 Simplicity of Logic Design Any digital logic design can be created with three fundamental building blocks: AND OR NOT Signals are represented by only two states: ON TRUE OFF FALSE 
12 Basic Number Systems  Decimal Integers: ,678 = Rational numbers: 3.42 = In general: aaaa a a = a + a + a + a + a + a Decimal point 2
13 Basic Number Systems Arbitrary Base Integers: = = Rational numbers: 3.42 = = In general: ( a aa a a ) = a n r + + a r + a r + a r + + a r n m r n m Radix point a {,,, r } i m 3
14 Basic Number Systems Base 2 Integers: = = Rational numbers:. = = In general: ( a aa a a ) n = a a 2 + a 2 + a a 2 n m 2 n m binary point a i {,} m 4
15 Numbers to Remember 2 2 = 4 2 = 8 2 = 6 2 = 32 2 = 64 2 = 28 2 = = 52 2 = 24 2 = = = = = = =.25.5 =.25.5 = = =
16 Basic Arithmetic Addition: + + * Multiplication: x x * carry Subtraction:  6
17 Binary to Decimal The hard way: An easier way: 2 Number Base Conversion = = = = = ((() ) ) = = 7
18 Decimal to Binary: Number Base Conversion = 2i ( 87mod 2) = i = 2i ( 43mod 2) = i = 2i ( 2mod 2) = i + = 2i ( mod 2) = i = 2i ( 5mod2) = i = 2i + ( 2mod2) = 2+ 2 i = 2i + ( mod2) = = 8
19 Number Base Conversion Fractional Numbers Decimal to Binary:.765 =. Switching Theory and Logical Design ( ).765 =.765 i i + i 2 i = i = i2 i i =.53 + i ( ) ( ) ( ) ( ) ( ) ( ) =.53 i i + i 2 i = i = i2 i.3 + i =.6 + i =.6 i i i i =.6 + i = i2 i.6 + i =.2 + i ( ) ( ) ( ) i ( ) i ( ) i ( ) i ( ) i ( ) i = = = = = =
20 Binary Equivalents of Decimal Numbers
21 Other Popular Bases Octal a i {,, 2,3, 4,5,6,7} BinaryOctal mapping: =
22 Other Popular Bases Hexadecimal ai {,,2,3,4,5,6,7,8,9, A, B, C, D, E, F} BinaryHexadecimal Mapping 7EF9.2C = A B C D E F 22
23 Complements Subtracting by adding: A B = A+ ( B) How can we create B? 23
24 Complements Subtracting by adding: A B = A+ ( B) How can we create B? If B is an integer and B < r N Define: x = r x so B = b r + b r + + b r + br + b r Notice N N 2 2 N N 2 2 B+ B+ = r so N B = r + B+ B+ N 24
25 Decimal: 9 s and s Complement 9 s Complement B B = = B + B = s Complement B B = = B + B = Subtraction With s Complement
26 Binary: s and 2 s Complement s Complement b {,} B = B = 2 s Complement 2 2 B = 2 B = + =
27 Working With Negative Binary Numbers Represent +3 in binary as a 6 bit number: How can you represent 3? Signed Magnitude Add use the MSB to represent +/ Useful for multiplication, but not addition/subtraction Signed s Complement Complement the bits Not particularly useful for arithmetic Signed 2 s Complement Complement the bits and add Most widely used means of dealing with signed arithmetic 27
28 Arithmetic With Signed Numbers Add the following numbers (all base ) in binary using 6bit 2 s complement representation: = Carry out of 6bit range occurs
29 An Interesting Side Effect of 2 s Complement Add the following numbers (all base ) in binary using 6bit 2 s complement representation: = +28 (intermediate results cannot be represented in 6bit 2 s complement! e.g., 7+23=4 > 32) (+4 is out of range) (+32 is out of range) Intermediate overflows can be tolerated, as long as the final result is within the range that can be represented 29
30 Range of Values That Can Be Represented in Nbit 2 s Complement Value bit Representation Value bit Representation
31 Binary Codes Hexadecimal or binary numbers are not easily translated into humanunderstandable forms, e.g.: How old is a person born in ( ) 2? Is it any easier to understand as (7E3) 6? 3
32 Binary Codes Hexadecimal or binary numbers are not easily translated into humanunderstandable forms, e.g.: How old is a person born in ( ) 2? Is it any easier to understand as (7E3) 6? How about: ( ) BCD = () 2 x 3 + () () 2 + () 232
33 Binary Codes Typical binary counting order: 2 Transitions in multiple bits 3 may create systems issues: 4 Extra bit errors on communications links 5 Noise pulses in digital 6 systems 733
34 Binary Codes Typical binary counting order: 2 Transitions in multiple bits 3 may create systems issues: 4 Extra bit errors on communications links 5 Noise pulses in digital 6 systems 7 Gray code order: 2 3 Adjacent code words 4 differ in only one bit 5 position
35 Binary Codes Errors sometimes occur as data is being stored or transmitted. How can we design a system that is capable of responding to this possibility? Consider: Correct value: Result: 35
36 Binary Codes Errors sometimes occur as data is being stored or transmitted. How can we design a system that is capable of responding to this possibility? Consider: Correct value: Result: Add redundancy bits which convey no information, but protect other bits Correct value: Even Parity  even number of s sent Result: Parity Error odd number of s received Parity can be even or odd. Parity detect a single error in a protected block 36
37 Binary Storage and Registers register Sequential logic Memory Flipflop Combinatorial logic NOT AND OR 37
38 Binary Storage and Registers Sequential systems require that binary information be stored Storage is in multiples of bit Assume that a storage element holds a value ( or ) until it is changed by a strobe signal input bit storage write output 38
39 Binary Storage and Registers Sequential systems require that binary information be stored Storage is in multiples of bit Assume that a storage element holds a value ( or ) until it is changed by a strobe signal Multiple storage elements can be used in unison to form a register to store associated binary information, e.g., an Nbit number input bit storage bit storage bit storage bit storage bit storage bit storage write output 39
40 Binary Logic All possible combinatorial logic systems can be implemented with three functions: A B A B A B A AND B Binary Variables Logical Operations C D C D C D C OR D + Truth Tables E E E NOT(E) 4
41 Logic Levels Undefined input levels output V out Impossible output levels V out input V in V in 4
42 Summary Fundamental concepts of digital systems Binary codes, number systems, and arithmetic Boolean algebra Simplification of switching equations Digital device characteristics (e.g., TTL, CMOS)/design considerations Combinatoric logical design including LSI implementation Hazards, Races, and time related issues in digital design Flipflops and state memory elements Sequential logic analysis and design Synchronous vs. asynchronous design Counters, shift register circuits Memory and Programmable logic Minimization of sequential systems Introduction to Finite Automata 42
43 Homework due in Class 3 Problems 7, , 3, 2. Show all work 43
Chapter 7 Logic Circuits
Chapter 7 Logic Circuits Goal. Advantages of digital technology compared to analog technology. 2. Terminology of Digital Circuits. 3. Convert Numbers between Decimal, Binary and Other forms. 5. Binary
More informationCs302 Quiz for MID TERM Exam Solved
Question # 1 of 10 ( Start time: 01:30:33 PM ) Total Marks: 1 Caveman used a number system that has distinct shapes: 4 5 6 7 Question # 2 of 10 ( Start time: 01:31:25 PM ) Total Marks: 1 TTL based devices
More informationLecture 2 Review on Digital Logic (Part 1)
Lecture 2 Review on Digital Logic (Part 1) Xuan Silvia Zhang Washington University in St. Louis http://classes.engineering.wustl.edu/ese461/ Grading Engagement 5% Review Quiz 10% Homework 10% Labs 40%
More informationCOEN 312 DIGITAL SYSTEMS DESIGN  LECTURE NOTES Concordia University
1 OEN 312 DIGIAL SYSEMS DESIGN  LEURE NOES oncordia University hapter 6: Registers and ounters NOE: For more examples and detailed description of the material in the lecture notes, please refer to the
More informationDigital Electronics Final Examination. Part A
Digital Electronics Final Examination Part A Spring 2009 Student Name: Date: Class Period: Total Points: /50 Converted Score: /40 Page 1 of 13 Directions: This is a CLOSED BOOK/CLOSED NOTES exam. Select
More informationNumbers and Arithmetic
Numbers and Arithmetic See: P&H Chapter 2.4 2.6, 3.2, C.5 C.6 Hakim Weatherspoon CS 3410, Spring 2013 Computer Science Cornell University Big Picture: Building a Processor memory inst register file alu
More informationNumbers and Arithmetic
Numbers and Arithmetic See: P&H Chapter 2.4 2.6, 3.2, C.5 C.6 Hakim Weatherspoon CS 3410, Spring 2013 Computer Science Cornell University Big Picture: Building a Processor memory inst register file alu
More informationSample Test Paper  I
Scheme G Sample Test Paper  I Course Name : Computer Engineering Group Marks : 25 Hours: 1 Hrs. Q.1) Attempt any THREE: 09 Marks a) Define i) Propagation delay ii) Fanin iii) Fanout b) Convert the following:
More informationState and Finite State Machines
State and Finite State Machines See P&H Appendix C.7. C.8, C.10, C.11 Hakim Weatherspoon CS 3410, Spring 2013 Computer Science Cornell University Big Picture: Building a Processor memory inst register
More informationCOMBINATIONAL LOGIC FUNCTIONS
COMBINATIONAL LOGIC FUNCTIONS Digital logic circuits can be classified as either combinational or sequential circuits. A combinational circuit is one where the output at any time depends only on the present
More informationReg. No. Question Paper Code : B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER Second Semester. Computer Science and Engineering
Sp 6 Reg. No. Question Paper Code : 27156 B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2015. Second Semester Computer Science and Engineering CS 6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN (Common
More informationDigital Electronics Circuits 2017
JSS SCIENCE AND TECHNOLOGY UNIVERSITY Digital Electronics Circuits (EC37L) Lab incharge: Dr. Shankraiah Course outcomes: After the completion of laboratory the student will be able to, 1. Simplify, design
More information14:332:231 DIGITAL LOGIC DESIGN. Organizational Matters (1)
4:332:23 DIGITAL LOGIC DESIGN Ivan Marsic, Rutgers University Electrical & Computer Engineering Fall 23 Organizational Matters () Instructor: Ivan MARSIC Office: CoRE Building, room 7 Email: marsic@ece.rutgers.edu
More informationDIGITAL LOGIC CIRCUITS
DIGITAL LOGIC CIRCUITS Introduction Logic Gates Boolean Algebra Map Specification Combinational Circuits FlipFlops Sequential Circuits Memory Components Integrated Circuits Digital Computers 2 LOGIC GATES
More informationChapter 1. Binary Systems 11. Outline. ! Introductions. ! Number Base Conversions. ! Binary Arithmetic. ! Binary Codes. ! Binary Elements 12
Chapter 1 Binary Systems 11 Outline! Introductions! Number Base Conversions! Binary Arithmetic! Binary Codes! Binary Elements 12 3C Integration 傳輸與介面 IA Connecting 聲音與影像 Consumer Screen Phone Set Top
More informationLogic Simplification. Boolean Simplification Example. Applying Boolean Identities F = A B C + A B C + A BC + ABC. Karnaugh Maps 2/10/2009 COMP370 1
Digital Logic COMP370 Introduction to Computer Architecture Logic Simplification It is frequently possible to simplify a logical expression. This makes it easier to understand and requires fewer gates
More informationDesign of Sequential Circuits
Design of Sequential Circuits Seven Steps: Construct a state diagram (showing contents of flip flop and inputs with next state) Assign letter variables to each flip flop and each input and output variable
More informationState & Finite State Machines
State & Finite State Machines Hakim Weatherspoon CS 3410, Spring 2012 Computer Science Cornell University See P&H Appendix C.7. C.8, C.10, C.11 Stateful Components Until now is combinatorial logic Output
More informationENGIN 112 Intro to Electrical and Computer Engineering
ENGIN 112 Intro to Electrical and Computer Engineering Lecture 3 More Number Systems Overview Hexadecimal numbers Related to binary and octal numbers Conversion between hexadecimal, octal and binary Value
More informationBoolean Algebra and Digital Logic 2009, University of Colombo School of Computing
IT 204 Section 3.0 Boolean Algebra and Digital Logic Boolean Algebra 2 Logic Equations to Truth Tables X = A. B + A. B + AB A B X 0 0 0 0 3 Sum of Products The OR operation performed on the products of
More informationECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN. Week 9 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Week 9 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering TIMING ANALYSIS Overview Circuits do not respond instantaneously to input changes
More informationWORKBOOK. Try Yourself Questions. Electrical Engineering Digital Electronics. Detailed Explanations of
27 WORKBOOK Detailed Eplanations of Try Yourself Questions Electrical Engineering Digital Electronics Number Systems and Codes T : Solution Converting into decimal number system 2 + 3 + 5 + 8 2 + 4 8 +
More informationNUMBERS AND CODES CHAPTER Numbers
CHAPTER 2 NUMBERS AND CODES 2.1 Numbers When a number such as 101 is given, it is impossible to determine its numerical value. Some may say it is five. Others may say it is one hundred and one. Could it
More informationSIR C.R.REDDY COLLEGE OF ENGINEERING ELURU DIGITAL INTEGRATED CIRCUITS (DIC) LABORATORY MANUAL III / IV B.E. (ECE) : I  SEMESTER
SIR C.R.REDDY COLLEGE OF ENGINEERING ELURU 534 007 DIGITAL INTEGRATED CIRCUITS (DIC) LABORATORY MANUAL III / IV B.E. (ECE) : I  SEMESTER DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING DIGITAL
More informationKUMARAGURU COLLEGE OF TECHNOLOGY COIMBATORE
Estd1984 KUMARAGURU COLLEGE OF TECHNOLOGY COIMBATORE 641 006 QUESTION BANK UNIT I PART A ISO 9001:2000 Certified 1. Convert (100001110.010) 2 to a decimal number. 2. Find the canonical SOP for the function
More informationLOGIC GATES. Basic Experiment and Design of Electronics. Ho Kyung Kim, Ph.D.
Basic Eperiment and Design of Electronics LOGIC GATES Ho Kyung Kim, Ph.D. hokyung@pusan.ac.kr School of Mechanical Engineering Pusan National University Outline Boolean algebra Logic gates Karnaugh maps
More information14:332:231 DIGITAL LOGIC DESIGN. Why Binary Number System?
:33:3 DIGITAL LOGIC DESIGN Ivan Marsic, Rutgers University Electrical & Computer Engineering Fall 3 Lecture #: Binary Number System Complement Number Representation X Y Why Binary Number System? Because
More informationDigital Fundamentals
Digital Fundamentals Tenth Edition Floyd Chapter 9 Sections 91 thru 95 2009 Pearson Education, Upper 2008 Pearson Saddle River, Education NJ 07458. All Rights Reserved ET285 Agenda Week 2 Quiz 0: Covered
More informationBoolean Algebra. Digital Logic Appendix A. Postulates, Identities in Boolean Algebra How can I manipulate expressions?
Digital Logic Appendix A Gates Combinatorial Circuits Sequential Circuits Other operations NAND A NAND B = NOT ( A ANDB) = AB NOR A NOR B = NOT ( A ORB) = A + B Truth tables What is the result of the operation
More informationIntroduction to Digital Logic Missouri S&T University CPE 2210 Subtractors
Introduction to Digital Logic Missouri S&T University CPE 2210 Egemen K. Çetinkaya Egemen K. Çetinkaya Department of Electrical & Computer Engineering Missouri University of Science and Technology cetinkayae@mst.edu
More informationOutline. policies for the first part. with some potential answers... MCS 260 Lecture 10.0 Introduction to Computer Science Jan Verschelde, 9 July 2014
Outline 1 midterm exam on Friday 11 July 2014 policies for the first part 2 questions with some potential answers... MCS 260 Lecture 10.0 Introduction to Computer Science Jan Verschelde, 9 July 2014 Intro
More informationLecture A: Logic Design and Gates
Lecture A: Logic Design and Gates Syllabus My office hours 9.1510.35am T,Th or gchoi@ece.tamu.edu 333G WERC Text: Brown and Vranesic Fundamentals of Digital Logic,» Buy it.. Or borrow it» Other book:
More informationGates and FlipFlops
Gates and FlipFlops Chris Kervick (11355511) With Evan Sheridan and Tom Power December 2012 On a scale of 1 to 10, how likely is it that this question is using binary?...4? What s a 4? Abstract The operation
More informationSystems I: Computer Organization and Architecture
Systems I: Computer Organization and Architecture Lecture 6  Combinational Logic Introduction A combinational circuit consists of input variables, logic gates, and output variables. The logic gates accept
More informationTYPICAL QUESTIONS & ANSWERS
TYPICAL QUESTIONS & ANSWERS PART  I OJECTIVE TYPE QUESTIONS Each Question carries 2 marks. Choose correct or the best alternative in the following: Q.1 The NAN gate output will be low if the two inputs
More informationBoolean Algebra. Digital Logic Appendix A. Boolean Algebra Other operations. Boolean Algebra. Postulates, Identities in Boolean Algebra
Digital Logic Appendix A Gates Combinatorial Circuits Sequential Circuits George Boole ideas 1854 Claude Shannon, apply to circuit design, 1938 (piirisuunnittelu) Describe digital circuitry function programming
More informationIntroduction EE 224: INTRODUCTION TO DIGITAL CIRCUITS & COMPUTER DESIGN. Lecture 6: Sequential Logic 3 Registers & Counters 5/9/2010
EE 224: INTROUCTION TO IGITAL CIRCUITS & COMPUTER ESIGN Lecture 6: Sequential Logic 3 Registers & Counters 05/10/2010 Avinash Kodi, kodi@ohio.edu Introduction 2 A FlipFlop stores one bit of information
More informationHakim Weatherspoon CS 3410 Computer Science Cornell University
Hakim Weatherspoon CS 3410 Computer Science Cornell University The slides are the product of many rounds of teaching CS 3410 by Professors Weatherspoon, Bala, Bracy, and Sirer. memory inst 32 register
More informationof Digital Electronics
26 Digital Electronics 729 Digital Electronics 26.1 Analog and Digital Signals 26.3 Binary Number System 26.5 Decimal to Binary Conversion 26.7 Octal Number System 26.9 BinaryCoded Decimal Code (BCD Code)
More informationSequential Circuit Analysis
Sequential Circuit Analysis Last time we started talking about latches and flipflops, which are basic onebit memory units. Today we ll talk about sequential circuit analysis and design. First, we ll
More informationCSCI 2150 Intro to State Machines
CSCI 2150 Intro to State Machines Topic: Now that we've created flipflops, let's make stuff with them Reading: igital Fundamentals sections 6.11 and 9.4 (ignore the JK flipflop stuff) States Up until
More informationENGG 1203 Tutorial_9  Review. Boolean Algebra. Simplifying Logic Circuits. Combinational Logic. 1. Combinational & Sequential Logic
ENGG 1203 Tutorial_9  Review Boolean Algebra 1. Combinational & Sequential Logic 2. Computer Systems 3. Electronic Circuits 4. Signals, Systems, and Control Remark : Multiple Choice Questions : ** Check
More informationDigital Logic: Boolean Algebra and Gates. Textbook Chapter 3
Digital Logic: Boolean Algebra and Gates Textbook Chapter 3 Basic Logic Gates XOR CMPE12 Summer 2009 022 Truth Table The most basic representation of a logic function Lists the output for all possible
More informationEE260: Digital Design, Spring n Digital Computers. n Number Systems. n Representations. n Conversions. n Arithmetic Operations.
EE 260: Introduction to Digital Design Number Systems Yao Zheng Department of Electrical Engineering University of Hawaiʻi at Mānoa Overview n Digital Computers n Number Systems n Representations n Conversions
More informationhexadecimaltodecimal conversion
OTHER NUMBER SYSTEMS: octal (digits 0 to 7) group three binary numbers together and represent as base 8 3564 10 = 110 111 101 100 2 = (6X8 3 ) + (7X8 2 ) + (5X8 1 ) + (4X8 0 ) = 6754 8 hexadecimal (digits
More informationBinary addition (1bit) P Q Y = P + Q Comments Carry = Carry = Carry = Carry = 1 P Q
Digital Arithmetic In Chapter 2, we have discussed number systems such as binary, hexadecimal, decimal, and octal. We have also discussed sign representation techniques, for example, signbit representation
More informationCE1911 LECTURE FSM DESIGN PRACTICE DAY 1
REVIEW MATERIAL 1. Combinational circuits do not have memory. They calculate instantaneous outputs based only on current inputs. They implement basic arithmetic and logic functions. 2. Sequential circuits
More informationPropositional Logic. Logical Expressions. Logic Minimization. CNF and DNF. Algebraic Laws for Logical Expressions CSC 173
Propositional Logic CSC 17 Propositional logic mathematical model (or algebra) for reasoning about the truth of logical expressions (propositions) Logical expressions propositional variables or logical
More informationDIGITAL LOGIC CIRCUITS
DIGITAL LOGIC CIRCUITS Digital logic circuits BINARY NUMBER SYSTEM electronic circuits that handle information encoded in binary form (deal with signals that have only two values, and ) Digital. computers,
More informationFrom Sequential Circuits to Real Computers
1 / 36 From Sequential Circuits to Real Computers Lecturer: Guillaume Beslon Original Author: Lionel Morel Computer Science and Information Technologies  INSA Lyon Fall 2017 2 / 36 Introduction What we
More informationExam for Physics 4051, October 31, 2008
Exam for Physics 45, October, 8 5 points  closed book  calculators allowed  show your work Problem : (6 Points) The 4 bit shift register circuit shown in Figure has been initialized to contain the following
More informationELCT201: DIGITAL LOGIC DESIGN
ELCT2: DIGITAL LOGIC DESIGN Dr. Eng. Haitham Omran, haitham.omran@guc.edu.eg Dr. Eng. Wassim Alexan, wassim.joseph@guc.edu.eg Lecture 2 Following the slides of Dr. Ahmed H. Madian ذو الحجة 438 ه Winter
More informationLearning Objectives:
Learning Objectives: t the end of this topic you will be able to; draw a block diagram showing how type flipflops can be connected to form a synchronous counter to meet a given specification; explain
More informationModule 2. Basic Digital Building Blocks. Binary Arithmetic & Arithmetic Circuits Comparators, Decoders, Encoders, Multiplexors FlipFlops
Module 2 asic Digital uilding locks Lecturer: Dr. Yongsheng Gao Office: Tech 3.25 Email: Web: Structure: Textbook: yongsheng.gao@griffith.edu.au maxwell.me.gu.edu.au 6 lecturers 1 tutorial 1 laboratory
More informationUnit 3 Session  9 DataProcessing Circuits
Objectives Unit 3 Session  9 DataProcessing Design of multiplexer circuits Discuss multiplexer applications Realization of higher order multiplexers using lower orders (multiplexer trees) Introduction
More informationCprE 281: Digital Logic
CprE 28: Digital Logic Instructor: Alexander Stoytchev http://www.ece.iastate.edu/~alexs/classes/ Decoders and Encoders CprE 28: Digital Logic Iowa State University, Ames, IA Copyright Alexander Stoytchev
More informationAdders, subtractors comparators, multipliers and other ALU elements
CSE4: Components and Design Techniques for Digital Systems Adders, subtractors comparators, multipliers and other ALU elements Instructor: Mohsen Imani UC San Diego Slides from: Prof.Tajana Simunic Rosing
More informationEECS150  Digital Design Lecture 23  FFs revisited, FIFOs, ECCs, LSFRs. Crosscoupled NOR gates
EECS150  Digital Design Lecture 23  FFs revisited, FIFOs, ECCs, LSFRs April 16, 2009 John Wawrzynek Spring 2009 EECS150  Lec24blocks Page 1 Crosscoupled NOR gates remember, If both R=0 & S=0, then
More informationChapter 9 Asynchronous Sequential Logic
9.1 Introduction EEA051  Digital Logic 數位邏輯 Chapter 9 Asynchronous Sequential Logic 吳俊興高雄大學資訊工程學系 December 2004 Two major types of sequential circuits: depending on timing of their signals Asynchronous
More informationElectronics. Overview. Introducction to Synthetic Biology
Electronics Introducction to Synthetic iology E Navarro Montagud P Fernandez de Cordoba JF Urchueguía Overview Introduction oolean algebras Logical gates Representation of boolean functions Karnaugh maps
More informationLecture 10: Synchronous Sequential Circuits Design
Lecture 0: Synchronous Sequential Circuits Design. General Form Input Combinational Flipflops Combinational Output Circuit Circuit Clock.. Moore type has outputs dependent only on the state, e.g. ripple
More informationLaboratory Exercise #8 Introduction to Sequential Logic
Laboratory Exercise #8 Introduction to Sequential Logic ECEN 248: Introduction to Digital Design Department of Electrical and Computer Engineering Texas A&M University 2 Laboratory Exercise #8 1 Introduction
More informationBoolean Algebra and Digital Logic
All modern digital computers are dependent on circuits that implement Boolean functions. We shall discuss two classes of such circuits: Combinational and Sequential. The difference between the two types
More informationBinary logic consists of binary variables and logical operations. The variables are
1) Define binary logic? Binary logic consists of binary variables and logical operations. The variables are designated by the alphabets such as A, B, C, x, y, z, etc., with each variable having only two
More informationCombinational vs. Sequential. Summary of Combinational Logic. Combinational device/circuit: any circuit built using the basic gates Expressed as
Summary of Combinational Logic : Computer Architecture I Instructor: Prof. Bhagi Narahari Dept. of Computer Science Course URL: www.seas.gwu.edu/~bhagiweb/cs3/ Combinational device/circuit: any circuit
More informationConversions between Decimal and Binary
Conversions between Decimal and Binary Binary to Decimal Technique  use the definition of a number in a positional number system with base 2  evaluate the definition formula ( the formula ) using decimal
More informationCounting in Different Number Systems
Counting in Different Number Systems Base 1 (Decimal) is important because that is the base that we first learn in our culture. Base 2 (Binary) is important because that is the base used for computer codes
More informationDesign at the Register Transfer Level
Week7 Design at the Register Transfer Level Algorithmic State Machines Algorithmic State Machine (ASM) q Our design methodologies do not scale well to realworld problems. q 232  Logic Design / Algorithmic
More informationQuiz 2 Solutions Room 10 Evans Hall, 2:10pm Tuesday April 2 (Open Katz only, Calculators OK, 1hr 20mins)
UNIVERSITY OF CALIFORNIA AT BERKELEY ERKELEY DAVIS IRVINE LOS ANGELES RIVERSIDE SAN DIEGO SAN FRANCISCO SANTA BARBARA SANTA CRUZ Department of Electrical Engineering and Computer Sciences Quiz 2 Solutions
More informationRead this before starting!
Points missed: Student's Name: Total score: / points East Tennessee State University epartment of Computer and Information Sciences CSCI 25 (Tarnoff) Computer Organization TEST 2 for Spring Semester, 27
More informationDept. of ECE, CIT, Gubbi Page 1
Verification: 1) A.B = A + B 7404 7404 7404 A B A.B A.B 0 0 0 1 0 1 0 1 1 0 0 1 1 1 1 0 A B A B A + B 0 0 1 1 1 0 1 1 0 1 1 0 0 1 1 1 1 0 0 0 2) A+B = A. B 7404 7404 7404 A B A+B A+B 0 0 0 1 0 1 1 0 1
More informationContents. Chapter 3 Combinational Circuits Page 1 of 36
Chapter 3 Combinational Circuits Page of 36 Contents Combinational Circuits...2 3. Analysis of Combinational Circuits...3 3.. Using a Truth Table...3 3..2 Using a Boolean Function...6 3.2 Synthesis of
More informationReview. EECS Components and Design Techniques for Digital Systems. Lec 06 Minimizing Boolean Logic 9/ Review: Canonical Forms
Review EECS 150  Components and Design Techniques for Digital Systems Lec 06 Minimizing Boolean Logic 9/1604 David Culler Electrical Engineering and Computer Sciences University of California, Berkeley
More informationVidyalankar S.E. Sem. III [INFT] Analog and Digital Circuits Prelim Question Paper Solution
. (a). (b) S.E. Sem. III [INFT] Analog and Digital Circuits Prelim Question Paper Solution Practical Features of OpAmp (A 74) i) Large voltage gain (of the order of 2 0 5 ) ii) Very high input resistance
More informationUNIT 8A Computer Circuitry: Layers of Abstraction. Boolean Logic & Truth Tables
UNIT 8 Computer Circuitry: Layers of bstraction 1 oolean Logic & Truth Tables Computer circuitry works based on oolean logic: operations on true (1) and false (0) values. ( ND ) (Ruby: && ) 0 0 0 0 0 1
More informationDecoding A Counter. svbitec.wordpress.com 1
ecoding A ounter ecoding a counter involves determining which state in the sequence the counter is in. ifferentiate between activehigh and activelow decoding. ActiveHIGH decoding: output HIGH if the
More informationDigital Electronics Sequential Logic
/5/27 igital Electronics Sequential Logic r. I. J. Wassell Sequential Logic The logic circuits discussed previously are known as combinational, in that the output depends only on the condition of the latest
More information/ M Morris Mano Digital Design Ahmad_911@hotmailcom / / / / wwwuqucscom Binary Systems Introduction  Digital Systems  The Conversion Between Numbering Systems  From Binary To Decimal  Octet To Decimal
More informationShift Register Counters
Shift Register Counters Shift register counter: a shift register with the serial output connected back to the serial input. They are classified as counters because they give a specified sequence of states.
More informationELCT201: DIGITAL LOGIC DESIGN
ELCT2: DIGITL LOGIC DESIGN Dr. Eng. Haitham Omran, haitham.omran@guc.edu.eg Dr. Eng. Wassim lexan, wassim.joseph@guc.edu.eg Lecture Following the slides of Dr. hmed H. Madian ذو الحجة 438 ه Winter 27 2
More informationCombinational Logic. By : Ali Mustafa
Combinational Logic By : Ali Mustafa Contents Adder Subtractor Multiplier Comparator Decoder Encoder Multiplexer How to Analyze any combinational circuit like this? Analysis Procedure To obtain the output
More informationCSE 20. Lecture 4: Introduction to Boolean algebra. CSE 20: Lecture4
CSE 20 Lecture 4: Introduction to Boolean algebra Reminder First quiz will be on Friday (17th January) in class. It is a paper quiz. Syllabus is all that has been done till Wednesday. If you want you may
More informationFloating Point Representation and Digital Logic. Lecture 11 CS301
Floating Point Representation and Digital Logic Lecture 11 CS301 Administrative Daily Review of today s lecture w Due tomorrow (10/4) at 8am Lab #3 due Friday (9/7) 1:29pm HW #5 assigned w Due Monday 10/8
More informationL2: Combinational Logic Design (Construction and Boolean Algebra)
L2: Combinational Logic Design (Construction and Boolean Algebra) Acknowledgements: Lecture material adapted from Chapter 2 of R. Katz, G. Borriello, Contemporary Logic Design (second edition), Pearson
More informationAdvanced Boolean Logic and Applications to Control Systems
Advanced Boolean Logic and Applications to Control Systems Course No: E00 Credit: PDH Jeffrey Cwalinski, P.E. Continuing Education and Development, Inc. 9 Greyridge Farm Court Stony Point, NY 0980 P:
More informationChapter 5. Digital systems. 5.1 Boolean algebra Negation, conjunction and disjunction
Chapter 5 igital systems digital system is any machine that processes information encoded in the form of digits. Modern digital systems use binary digits, encoded as voltage levels. Two voltage levels,
More informationIntroduction to Karnaugh Maps
Introduction to Karnaugh Maps Review So far, you (the students) have been introduced to truth tables, and how to derive a Boolean circuit from them. We will do an example. Consider the truth table for
More informationLecture 14: State Tables, Diagrams, Latches, and Flip Flop
EE210: Switching Systems Lecture 14: State Tables, Diagrams, Latches, and Flip Flop Prof. YingLi Tian Nov. 6, 2017 Department of Electrical Engineering The City College of New York The City University
More informationSpiral 1 / Unit 5. Karnaugh Maps
. Spiral / Unit Karnaugh Maps . Outcomes I know the difference between combinational and sequential logic and can name examples of each. I understand latency, throughput, and at least technique to improve
More informationOutcomes. Spiral 1 / Unit 5. Logic Function Synthesis KARNAUGH MAPS. Karnaugh Maps
. . Spiral / Unit Mark Redekopp Outcomes I know the difference between combinational and sequential logic and can name examples of each. I understand latency, throughput, and at least technique to improve
More informationWeekI. Combinational Logic & Circuits
WeekI Combinational Logic & Circuits Overview Binary logic operations and gates Switching algebra Algebraic Minimization Standard forms Karnaugh Map Minimization Other logic operators IC families and
More informationDIGITAL ELECTRONICS & it0203 Semester 3
DIGITAL ELECTRONICS & it0203 Semester 3 P.Rajasekar & C.M.T.Karthigeyan Asst.Professor SRM University, Kattankulathur School of Computing, Department of IT 8/22/2011 1 Disclaimer The contents of the slides
More information6 Synchronous State Machine Design
Design of synchronous counters. Based on the description of the problem, determine the required number n of the FFs  the smallest value of n is such that the number of states N 2 n and the desired counting
More informationCSC258: Computer Organization. Digital Logic: Transistors and Gates
CSC258: Computer Organization Digital Logic: Transistors and Gates 1 PreClass Review 1. What are the largest (positive) and smallest (negative) numbers that can be represented using 4 bit 2 s complement?
More informationThe Karnaugh Map COE 202. Digital Logic Design. Dr. Muhamed Mudawar King Fahd University of Petroleum and Minerals
The Karnaugh Map COE 202 Digital Logic Design Dr. Muhamed Mudawar King Fahd University of Petroleum and Minerals Presentation Outline Boolean Function Minimization The Karnaugh Map (KMap) Two, Three,
More informationEECS150  Digital Design Lecture 18  Counters
EECS150  Digital Design Lecture 18  Counters October 24, 2002 John Wawrzynek Fall 2002 EECS150  Lec18counters Page 1 Counters Special sequential circuits (FSMs) that sequence though a set outputs.
More informationFYSE420 DIGITAL ELECTRONICS
FYSE42 IGITAL ELECTRONICS Lecture 4 [] [2] [3] IGITAL LOGIC CIRCUIT ANALYSIS & ESIGN Nelson, Nagle, Irvin, Carrol ISBN 34638948 IGITAL ESIGN Morris Mano Fourth edition ISBN 3989243 igital esign Principles
More informationPart 1: Digital Logic and Gates. Analog vs. Digital waveforms. The digital advantage. In real life...
Part 1: Digital Logic and Gates Analog vs Digital waveforms An analog signal assumes a continuous range of values: v(t) ANALOG A digital signal assumes discrete (isolated, separate) values Usually there
More informationCprE 281: Digital Logic
CprE 281: Digital Logic Instructor: Alexander Stoytchev http://www.ece.iastate.edu/~alexs/classes/ NAND and NOR Logic Networks CprE 281: Digital Logic Iowa State University, Ames, IA Copyright Alexander
More informationDIGITAL LOGIC DESIGN
DIGITAL LOGIC DESIGN NUMBERS SYSTEMS AND CODES Any number in one base system can be converted into another base system Types 1) decimal to any base 2) Any base to decimal 3) Any base to Any base Complements
More information