Chapter Three. Digital Components


 Frank Page
 4 years ago
 Views:
Transcription
1 Chapter Three 3.1. Combinational Circuit A combinational circuit is a connected arrangement of logic gates with a set of inputs and outputs. The binary values of the outputs are a function of the binary combination of the inputs at any given time. Figure 3.1 shows the general block diagram of a combinational circuit. A combinational circuit transforms binary information from the given input data to the required output data. In digital computers, combinational circuits are used to generate binary control decisions and providing digital components required for data processing. A combinational circuit is described by a truth table showing the binary relationship between the ninput variables and the moutput variables. In addition, the combinational circuit is specified with m Boolean functions, one for each output variable. Each output function is expressed in terms of the ninput variables. The design procedure of a Combinational Circuit is summarized in the following steps. 1. State the problem. 2. Assign letter symbols for each of the input and output variables. 3. Derive the truth table that describes the relationship between the inputs and outputs. 4. Obtain the simplified Boolean functions for each output. 5. Draw the logical diagram Yacoup K. Hanna
2 Adders HalfAdder A halfadder is a combinational circuit that performs the arithmetic addition of two bits. The input variable of the halfadder called the augend and addend bits. The output variables called Sum and Carry. The reason for specifying two output variables, since the sum of 1+1 is the binary 10, which need two bits. Recall the basic rules for binary addition as shown below. We assign symbols A and B to the two input variables Augend and Addend, S and C for the two outputs Sum and Carry. The truth table of the halfadder is as shown in table 3.1. Table 3.1 The Boolean functions for the two outputs can be obtained directly from the truth table as follows: Figure 3.2 shows the logical diagram of the halfadder and Figure 3.3 shows the logical symbol of the halfadder Yacoup K. Hanna
3 FullAdder A FullAdder is a combinational circuit that forms the arithmetic sum of three input bits. It consists of three inputs and two outputs. The first two input variables, denoted by A and B, represent the two significant bits to be added, while the third input C, represent the carry from the previous lower significant position. The number of outputs must be two, since the arithmetic sum of three binary bits ranges in value from 0 to 3, and because 2 and 3 in binary is represented by two bits, therefore two outputs are needed. The two outputs are designated by the variables S for sum and CO for carry. The truth table of the Falladder will be as shown in table 3.2. Table 3.2 The Karnaugh maps shown in figure 3.4 are used to find logical expressions for the two outputs S and CO Yacoup K. Hanna
4 Figure 3.5 shows the logical diagram of the Falladder. Figure 3.6 shows the logical symbol of the Falladder. Homework For the fulladder of figure 3.5, determine the logic state (1 or 0) at each gate output for the following inputs: 1. A =1, B =1, and C =1 2. A = 0, B =1, and C=1 3. A = 0, B =1, and C= Yacoup K. Hanna
5 FourBit Parallel Adders Figure 3.7 shows a FourBit binary parallel adder. The FourBit binary parallel adder works as follows:  1. The LSB s in each binary number added go into the topmost full adder. The carry must be connected to state 0 (i.e. connected to ground) for the first fulladder. 2. The higheradder bits are applied to the successively higherorder adders (bottommost full adder). 3. The carry output of each adder is connected to the carry input of the next higherorder adder. 4. The output is S4 S3 S2 S1 S Yacoup K. Hanna
6 Comparators The basic function of a comparator is to compare the magnitudes of two quantities and decides either as equal or different quantities. Assuming two binary numbers A and B to be compared, a comparator determines whether A > B, B > A, or A = B. To determine the inequality of the two numbers A and B, first, the highest order bit in each number is examined through the following conditions:  1. If A3=1 and B3= 0, then the binary number A is greater than B. 2. If A3=0 and B3= 1, then the binary number A is less than B. 3. If A3=B3, then we must examine the next lower bit position for inequality. In order to understand the logic circuitry of the comparator, consider the logical circuit of a fourbit comparator shown in figure 4.8. For our purpose, we will use two 4bit binary numbers A and B with their general form A3A2A1A0 and B3B2B1B0 respectively. The A = B condition is determined by gates G1, G2, G3, G4, and G5. The outputs of the XNOR gates G1, G2, G3, and G4 are ANDed by gate G5 to produce A = B. The outputs of gates G1, G2, G3, and G4 are 1 if and only if the corresponding bits of the binary numbers A and B in a specified position are the same. The A > B condition is determined by gates G6, G7, G8, G9, and G10. The outputs of gates G6, G7, G8, and G9 are ORed by gate G10 to produce A > B. The outputs of gates G6, G7, G8, and G9 are 1, when the bit of the binary number A in a specified position is 1, while the corresponding bit of the binary number B is 0. The A < B condition is determined by gates G11, G12, G13, G14, and G15. The outputs of gates G11, G12, G13, and G14 are ORed by gate G15 to produce A < B. The outputs of gates G11, G12, G13, and G14 are 1, when the bit of the binary number B in a specified position is 1, while the corresponding bit of the binary number A is 0. Note. The output of G1 is connected to inputs of gates G7, G8, and G9, also it is connected to the inputs of gates G12, G13, and G14. This connection provides a priority inhibit so that if the proper inequality occurs in bits A3 and B3 (A3 B3), the lowerorder bit checks will be inhibited. A priority inhibit is also provided by 646 Yacoup K. Hanna
7 gate G2 to gates G8, G9, G13, and G14, and by gate G3 to gates G9 and G14. Figure 3.8 Figure 3.9 shows the logic symbol for a fourbit comparator. Homework Analyze the 4bit comparator operation shown in figure 3.8 for the two numbers A3A2A1A0 = 0111 and B3B2B1B0 = Yacoup K. Hanna
8 Decoders A decoder is a combinational circuit that converts binary information from the n coded inputs to a maximum of 2 n unique outputs. The basic function of decoder is to detect the presence of a specified combination of bits (code) on its inputs and to indicate that presence by a specified output level. Generally a decoder has n input lines to handle n bits and from one to 2 n output lines to indicate the presence of one or more nbit combinations to4line Decoder Figure 3.10 shows a 2to4line decoder with an enable input constructed with NAND gates. The decoder is enabled when E is equal to 0 and disabled when E is equal to 1. Table 3.3 shows the 2to4line decoder truth table. As indicated by the truth table, only one output is equal to 0 at any given time; the other three outputs are equal to 1. The output whose value is equal to 0 represents the equivalent binary number in inputs A1 and A0. When the circuit is disabled (i.e. E=1), no output is selected and all outputs are equal to 1. Figure 3.11 shows the logic symbol of a 2to4line decoder Yacoup K. Hanna
9 Homework 1. Using NOR gates only, draw a logic diagram of a 2to4line decoder. Include an enable input. 2. Modify the decoder of figure 4.10 so that the circuit is enabled when E = 1 and disabled when E = 0. List the modified truth table to8line Decoder Figure 3.12 shows a 3to8line decoder with an enable input E constructed with AND gates. The decoder is enabled when E is equal to 1 and disabled when E is equal to 0. Table 3.4 shows the 3to8line decoder truth table. As indicated by the truth table, only one output is equal to 1 at any given time; the other seven outputs are equal to 0. The output whose value is equal to 1 represents the equivalent binary number in inputs A2, A1 and A0. When the circuit is disabled (i.e. E=0), no output is selected and all outputs are equal to 0. Notice that; in this example, the enable input is activated with 1 rather than 0 as in the example of 2to4 line decoder. A particular application of this decoder is a binarytooctal system conversion. Figure Yacoup K. Hanna
10 Decoder Expansion Sometime a certainsize decoder is needed but only smaller sizes of decoders are available, in this case we combine two or more decoders with enable inputs to form a larger decoder. For example, if a 6to64line decoder is needed, it is possible to construct this decoder using four 4to16line decoders. Figure 3.13 shows how a 3to8line decoder is implemented using two 2to4line decoders. The two least significant bits of the input are connected to both decoders. The most significant bit is connected to the enable input of one decoder and through an inverter to the enable input of the other decoder. It is assumed that each decoder is enabled when its E input is equal to 1 and disabled when E input is equal to 0. In this example when A2 = 0, the upper decoder is enabled and the lower is disabled and therefore the lower decoder outputs become inactive with all outputs at 0. The outputs of the upper decoder generate outputs D0 to D3, depending on the values of A1 and A0 (while A2 = 0). When A2 = 1, the lower decoder is enabled and the upper decoder is disabled. The lower decoder output generates the binary equivalent D4 to D7, depending on the values of A1 and A0 (while A2 = 1). Homework Construct a 5to32line decoder with four 3to8line decoders with enable and one 2to4line decoder. Use block diagrams only Yacoup K. Hanna
11 BCDtoDecimal Decoder Frequently this decoder is called a 4lineto10line decoder. The BCDtoDecimal Decoder converts each BCD code word into one of ten possible decimal digit indications. Table 3.5 shows a list of the ten BCD code words and their corresponding decoding functions. Figure 3.14 shows the logic diagram of the BCDtoDecimal Decoder. Figure 3.15 shows the logic symbol of the BCDtoDecimal Decoder (the 7442A integrated circuit) Yacoup K. Hanna
12 BCDtoSevenSegment Decoder The BCDtoSevenSegment Decoder has it is inputs the BCD code and provides outputs to energize SevenSegment display devices to produce a decimal readout. Figure 3.16 shows the SevenSegment display format in which it composed of seven elements or segments. For example to produce 2, segments a, b, g, e, and d are energized; to produce 4, segments f, g, b, and c are energized; to produce 8, all the seven segments are energized, and so on. Table 3.6 shows the activated segments for each of the ten decimal digits. Table 3.7 shows the truth table of the BCDtoSeven Segment Decoder. The SOP expression for each segment can be determined by using of a K. map. For example, the SOP expression for segment Yacoup K. Hanna
13 a is computed as shown in figure 3.17, and implemented as shown in figure In the same way, one can find the simplified logical expression for the remaining six segments with the logical diagram for each (Homework). Figure 3.19 shows the logical symbol of the complete sevensegment decoder Encoder An Encoder is a combinational logic circuit that essentially performs a reverse decoder function. Encoding symbols and alphabetic characters is achieved by means of encoders Yacoup K. Hanna
14 In general, encoder accepts an active level on one of its inputs representing a digit, such as a decimal or octal digit, and converts it to a coded output, such as binary or BCD. The following examples illustrate some type of encoders. Decimal to BCD Encoder This is a 10lineto4line encoder, where the 10 input represents the 10 decimal digits (0, 1, 2, 3, 4, 5, 6, 7, 8, and 9) and the 4 outputs represent their corresponding BCD code as shown in figure Table 3.8 shows the BCD code corresponding to each decimal digit. The relationship between each BCD bit and the ten decimal digits can be determined from table 3.8 as follows:  1. A3 is 1 for decimal digits 8 or 9. A3 = A2 is 1 for decimal digits 4 or 5 or 6 or 7. A2 = A1 is 1 for decimal digits 2 or 3 or 6 or 7. A1 = A0 is 1 for decimal digits 1 or 3 or 5 or 7 or 9. A0 = Yacoup K. Hanna
15 The basic encoder logic diagram resulting from the above expressions is a matter of ORing the appropriate decimal digit input lines to form each BCD output. Figure 3.21 shows the basic logic diagram of a decimaltobcd Encoder. Note. A 0 digit input is not needed because the BCD outputs are all LOW when there are no HIGH inputs. The DecimaltoBCD encoder is operates as follows:  1. When HIGH level appears on one of the decimal digit input lines, the appropriate levels corresponding to that decimal digit occurs on the four BCD output lines. 2. When there are no HIGH inputs appears on any decimal digit input lines (i.e. 0decimal digit assumed), the BCD outputs are all LOW level, which corresponds to decimal digit 0. Example. If input line 7 is HIGH (assuming all other input lines are LOW), this produce a HIGH on outputs A0, A1, and A2 and LOW output on A3., which is the BCD code (0111) for decimal digit Code Converters Two type of code converters will be explained in this section using combinational logic circuits, these code converters are: Yacoup K. Hanna
COMBINATIONAL LOGIC CIRCUITS
COMBINATIONAL LOGIC CIRCUITS 4.1 INTRODUCTION The digital system consists of two types of circuits, namely: (i) Combinational circuits and (ii) Sequential circuits A combinational circuit consists of logic
More informationCombinational Circuits
Combinational Circuits Combinational circuit consists of an interconnection of logic gates They react to their inputs and produce their outputs by transforming binary information n input binary variables
More information1. Mark the correct statement(s)
1. Mark the correct statement(s) 1.1 A theorem in Boolean algebra: a) Can easily be proved by e.g. logic induction b) Is a logical statement that is assumed to be true, c) Can be contradicted by another
More informationECE 2020B Fundamentals of Digital Design Spring problems, 6 pages Exam Two Solutions 26 February 2014
Problem 1 (4 parts, 21 points) Encoders and Pass Gates Part A (8 points) Suppose the circuit below has the following input priority: I 1 > I 3 > I 0 > I 2. Complete the truth table by filling in the input
More informationObjectives: 1. Design procedure. 2. Fundamental circuits. 1. Design procedure
Objectives: 1. Design procedure. 2. undamental circuits. 1. Design procedure Design procedure has five steps: o Specification. o ormulation. o Optimization. o Technology mapping. o Verification. Specification:
More informationChapter 4. Combinational Logic
Chapter 4. Combinational Logic Tong In Oh 1 4.1 Introduction Combinational logic: Logic gates Output determined from only the present combination of inputs Specified by a set of Boolean functions Sequential
More informationIT 201 Digital System Design Module II Notes
IT 201 Digital System Design Module II Notes BOOLEAN OPERATIONS AND EXPRESSIONS Variable, complement, and literal are terms used in Boolean algebra. A variable is a symbol used to represent a logical quantity.
More informationBoolean Analysis of Logic Circuits
Course: B.Sc. Applied Physical Science (Computer Science) Year & Sem.: IInd Year, Sem  IIIrd Subject: Computer Science Paper No.: IX Paper Title: Computer System Architecture Lecture No.: 7 Lecture Title:
More informationCombinational Logic with MSI and LSI
1010101010101010101010101010101010101010101010101010101010101010101010101010101010 1010101010101010101010101010101010101010101010101010101010101010101010101010101010 1010101010101010101010101010101010101010101010101010101010101010101010101010101010
More informationECE 2020B Fundamentals of Digital Design Spring problems, 6 pages Exam Two 26 February 2014
Instructions: This is a closed book, closed note exam. Calculators are not permitted. If you have a question, raise your hand and I will come to you. Please work the exam in pencil and do not separate
More informationBinary Addition. Add the binary numbers and and show the equivalent decimal addition.
Binary Addition The rules for binary addition are 0 + 0 = 0 Sum = 0, carry = 0 0 + 1 = 0 Sum = 1, carry = 0 1 + 0 = 0 Sum = 1, carry = 0 1 + 1 = 10 Sum = 0, carry = 1 When an input carry = 1 due to a previous
More informationLogic design Ibn Al Haitham collage /Computer science Eng. Sameer
DEMORGAN'S THEOREMS One of DeMorgan's theorems stated as follows: The complement of a product of variables is equal to the sum of the complements of the variables. DeMorgan's second theorem is stated as
More informationLSN 4 Boolean Algebra & Logic Simplification. ECT 224 Digital Computer Fundamentals. Department of Engineering Technology
LSN 4 Boolean Algebra & Logic Simplification Department of Engineering Technology LSN 4 Key Terms Variable: a symbol used to represent a logic quantity Compliment: the inverse of a variable Literal: a
More informationDepartment of Electrical and Computer Engineering University of Wisconsin  Madison. ECE/CS 352 Digital System Fundamentals.
Department of Electrical and Computer Engineering University of Wisconsin  Madison ECE/C 352 Digital ystem Fundamentals Quiz #2 Thursday, March 7, 22, 7:158:3PM 1. (15 points) (a) (5 points) NAND, NOR
More informationUNIT V COMBINATIONAL LOGIC DESIGN
UNIT V COMBINATIONAL LOGIC DESIGN NOTE: This is UNITV in JNTUK and UNITIII and HALF PART OF UNITIV in JNTUA SYLLABUS (JNTUK)UNITV: Combinational Logic Design: Adders & Subtractors, Ripple Adder, Look
More informationMidterm Exam Review. CS 2420 :: Fall 2016 Molly O'Neil
Midterm Exam Review CS 2420 :: Fall 2016 Molly O'Neil Midterm Exam Thursday, October 20 In class, pencil & paper exam Closed book, closed notes, no cell phones or calculators, clean desk 20% of your final
More informationLecture (03) Binary Codes Registers and Logic Gates
Lecture (03) Binary Codes Registers and Logic Gates By: Dr. Ahmed ElShafee Binary Codes Digital systems use signals that have two distinct values and circuit elements that have two stable states. binary
More informationLOGIC CIRCUITS. Kirti P_Didital Design 1
LOGIC CIRCUITS Kirti P_Didital Design 1 Introduction The digital system consists of two types of circuits, namely (i) Combinational circuits and (ii) Sequential circuit A combinational circuit consists
More informationComputer Logical Organization Tutorial
Computer Logical Organization Tutorial COMPUTER LOGICAL ORGANIZATION TUTORIAL Simply Easy Learning by tutorialspoint.com tutorialspoint.com i ABOUT THE TUTORIAL Computer Logical Organization Tutorial Computer
More informationDIGITAL ELECTRONICS. P41l 3 HOURS
UNIVERSITY OF SWAZILAND FACUL TY OF SCIENCE AND ENGINEERING DEPARTMENT OF PHYSICS MAIN EXAMINATION 2015/16 TITLE OF PAPER: COURSE NUMBER: TIME ALLOWED: INSTRUCTIONS: DIGITAL ELECTRONICS P41l 3 HOURS ANSWER
More informationDLD VIDYA SAGAR P. potharajuvidyasagar.wordpress.com. Vignana Bharathi Institute of Technology UNIT 3 DLD P VIDYA SAGAR
DLD UNIT III Combinational Circuits (CC), Analysis procedure, Design Procedure, Combinational circuit for different code converters and other problems, Binary Adder Subtractor, Decimal Adder, Binary Multiplier,
More informationCO Computer Architecture and Programming Languages CAPL. Lecture 9
CO20320241 Computer Architecture and Programming Languages CAPL Lecture 9 Dr. Kinga Lipskoch Fall 2017 A Fourbit Number Circle CAPL Fall 2017 2 / 38 Functional Parts of an ALU CAPL Fall 2017 3 / 38 Addition
More informationR07. Code No: V0423. II B. Tech II Semester, Supplementary Examinations, April
SET  1 II B. Tech II Semester, Supplementary Examinations, April  2012 SWITCHING THEORY AND LOGIC DESIGN (Electronics and Communications Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions
More informationCONTENTS CHAPTER 1: NUMBER SYSTEM. Foreword...(vii) Preface... (ix) Acknowledgement... (xi) About the Author...(xxiii)
CONTENTS Foreword...(vii) Preface... (ix) Acknowledgement... (xi) About the Author...(xxiii) CHAPTER 1: NUMBER SYSTEM 1.1 Digital Electronics... 1 1.1.1 Introduction... 1 1.1.2 Advantages of Digital Systems...
More informationECE 2030B 1:00pm Computer Engineering Spring problems, 5 pages Exam Two 10 March 2010
Instructions: This is a closed book, closed note exam. Calculators are not permitted. If you have a question, raise your hand and I will come to you. Please work the exam in pencil and do not separate
More informationGet Free notes at ModuleI One s Complement: Complement all the bits.i.e. makes all 1s as 0s and all 0s as 1s Two s Complement: One s complement+1 SIGNED BINARY NUMBERS Positive integers (including zero)
More informationECE 2030D Computer Engineering Spring problems, 5 pages Exam Two 8 March 2012
Instructions: This is a closed book, closed note exam. Calculators are not permitted. If you have a question, raise your hand and I will come to you. Please work the exam in pencil and do not separate
More informationDIGITAL SYSTEM DESIGN
DIGITAL SYSTEM DESIGN UNIT I: Introduction to Number Systems and Boolean Algebra Digital and Analog Basic Concepts, Some history of Digital SystemsIntroduction to number systems, Binary numbers, Number
More informationThis tutorial gives a complete understanding on Computer Logical Organization starting from basic computer overview till its advanced architecture.
About the Tutorial Computer Logical Organization refers to the level of abstraction above the digital logic level, but below the operating system level. At this level, the major components are functional
More informationChapter 2. Boolean Expressions:
Chapter 2 Boolean Expressions: A Boolean expression or a function is an expression which consists of binary variables joined by the Boolean connectives AND and OR along with NOT operation. Any Boolean
More informationB.Tech II Year I Semester (R13) Regular Examinations December 2014 DIGITAL LOGIC DESIGN
B.Tech II Year I Semester () Regular Examinations December 2014 (Common to IT and CSE) (a) If 1010 2 + 10 2 = X 10, then X is  Write the first 9 decimal digits in base 3. (c) What is meant by don
More informationModule 10. Encoder. Table of Contents
1 Module 10 Encoder Table of Contents 1. Introduction 2. Code converters 3. Basics of Encoder 3.1 Linear encoders 3.1.1 Octal to binary encoder 3.1.2 Decimal to BCD encoder 3.1.3 Hexadecimal to binary
More informationDigital Fundamentals
Digital Fundamentals Tenth Edition Floyd Chapter 2 2009 Pearson Education, Upper 2008 Pearson Saddle River, Education NJ 07458. All Rights Reserved Decimal Numbers The position of each digit in a weighted
More informationCombinational Logic. Prof. Wangrok Oh. Dept. of Information Communications Eng. Chungnam National University. Prof. Wangrok Oh(CNU) 1 / 93
Combinational Logic Prof. Wangrok Oh Dept. of Information Communications Eng. Chungnam National University Prof. Wangrok Oh(CNU) / 93 Overview Introduction 2 Combinational Circuits 3 Analysis Procedure
More informationII/IV B.Tech (Regular/Supplementary) DEGREE EXAMINATION. Answer ONE question from each unit.
Hall Ticket Number: 14CS IT303 November, 2017 Third Semester Time: Three Hours Answer Question No.1 compulsorily. II/IV B.Tech (Regular/Supplementary) DEGREE EXAMINATION Common for CSE & IT Digital Logic
More informationUNIT II  COMBINATIONAL LOGIC Part A 2 Marks. 1. Define Combinational circuit A combinational circuit consist of logic gates whose outputs at anytime are determined directly from the present combination
More informationNH 67, Karur Trichy Highways, Puliyur C.F, Karur District UNITII COMBINATIONAL CIRCUITS
NH 67, Karur Trichy Highways, Puliyur C.F, 639 114 Karur District DEPARTMENT OF ELETRONICS AND COMMUNICATION ENGINEERING COURSE NOTES SUBJECT: DIGITAL ELECTRONICS CLASS: II YEAR ECE SUBJECT CODE: EC2203
More informationCSE303 Logic Design II Laboratory 01
CSE303 Logic Design II Laboratory 01 # Student ID Student Name Grade (10) 1 Instructor signature 2 3 4 5 Delivery Date 1 / 15  Experiment 01 (Half adder) Objectives In the first experiment, a half adder
More informationChapter 4: Combinational Logic
Chapter 4: Combinational Logic Combinational Circuit Design Analysis Procedure (Find out nature of O/P) Boolean Expression Approach Truth Table Approach Design Procedure Example : BCD to Excess3 code
More informationCombinational Logic II
Combinational Logic II Ranga Rodrigo July 26, 2009 1 Binary AdderSubtractor Digital computers perform variety of information processing tasks. Among the functions encountered are the various arithmetic
More informationMODULE 5  COMBINATIONAL LOGIC
Introduction to Digital Electronics Module 5: Combinational Logic 1 MODULE 5  COMBINATIONAL LOGIC OVERVIEW: For any given combination of input binary bits or variables, the logic will have a specific
More informationBINARY SYSTEM. Binary system is used in digital systems because it is:
CHAPTER 2 CHAPTER CONTENTS 2.1 Binary System 2.2 Binary Arithmetic Operation 2.3 Signed & Unsigned Numbers 2.4 Arithmetic Operations of Signed Numbers 2.5 Hexadecimal Number System 2.6 Octal Number System
More informationCombinational Circuits
Combinational Circuits Jason Filippou CMSC250 @ UMCP 06022016 ason Filippou (CMSC250 @ UMCP) Circuits 06022016 1 / 1 Outline ason Filippou (CMSC250 @ UMCP) Circuits 06022016 2 / 1 Hardware design
More informationENEL 353: Digital Circuits Midterm Examination
NAME: SECTION: L01: Norm Bartley, ST 143 L02: Steve Norman, ST 145 When you start the test, please repeat your name and section, and add your U of C ID number at the bottom of the last page. Instructions:
More informationCombinational Logic Circuits
Combinational Logic Circuits By Dr. M. Hebaishy Digital Logic Design Ch Rem.!) Types of Logic Circuits Combinational Logic Memoryless Outputs determined by current values of inputs Sequential Logic Has
More informationDigital Fundamentals. CHAPTER 2 Number Systems, Operations, and Codes
Digital Fundamentals CHAPTER 2 Number Systems, Operations, and Codes Decimal Numbers The decimal number system has ten digits: 0, 1, 2, 3, 4, 5, 6, 7, 8, and 9 The decimal numbering system has a base of
More informationCode No: R Set No. 1
Code No: R059210504 Set No. 1 II B.Tech I Semester Regular Examinations, November 2006 DIGITAL LOGIC DESIGN ( Common to Computer Science & Engineering, Information Technology and Computer Science & Systems
More informationCode No: R Set No. 1
Code No: R059210504 Set No. 1 II B.Tech I Semester Supplementary Examinations, February 2007 DIGITAL LOGIC DESIGN ( Common to Computer Science & Engineering, Information Technology and Computer Science
More informationEE 8351 Digital Logic Circuits Ms.J.Jayaudhaya, ASP/EEE
EE 8351 Digital Logic Circuits Ms.J.Jayaudhaya, ASP/EEE 1 Logic circuits for digital systems may be combinational or sequential. A combinational circuit consists of input variables, logic gates, and output
More informationChapter 2: Combinational Systems
Uchechukwu Ofoegbu Chapter 2: Combinational Systems Temple University Adapted from Alan Marcovitz s Introduction to Logic and Computer Design Riddle Four switches can be turned on or off. One is the switch
More informationSection 001. Read this before starting!
Points missed: Student's Name: Total score: / points East Tennessee State University Department of Computer and Information Sciences CSCI 25 (Tarnoff) Computer Organization TEST 2 for Fall Semester, 25
More informationD I G I T A L C I R C U I T S E E
D I G I T A L C I R C U I T S E E Digital Circuits Basic Scope and Introduction This book covers theory solved examples and previous year gate question for following topics: Number system, Boolean algebra,
More informationCh. 5 : Boolean Algebra &
Ch. 5 : Boolean Algebra & Reduction elektronik@fisika.ui.ac.id Objectives Should able to: Write Boolean equations for combinational logic applications. Utilize Boolean algebra laws and rules for simplifying
More informationAssignment (36) Boolean Algebra and Logic Simplification  General Questions
Assignment (36) Boolean Algebra and Logic Simplification  General Questions 1. Convert the following SOP expression to an equivalent POS expression. 2. Determine the values of A, B, C, and D that make
More informationHow a Digital Binary Adder Operates
Overview of a Binary Adder How a Digital Binary Adder Operates By: Shawn R Moser A binary adder is a digital electronic component that is used to perform the addition of two binary numbers and return the
More informationSlide Set 5. for ENEL 353 Fall Steve Norman, PhD, PEng. Electrical & Computer Engineering Schulich School of Engineering University of Calgary
Slide Set 5 for ENEL 353 Fall 207 Steve Norman, PhD, PEng Electrical & Computer Engineering Schulich School of Engineering University of Calgary Fall Term, 207 SN s ENEL 353 Fall 207 Slide Set 5 slide
More informationDIGITAL ARITHMETIC: OPERATIONS AND CIRCUITS
C H A P T E R 6 DIGITAL ARITHMETIC: OPERATIONS AND CIRCUITS OUTLINE 6 Binary Addition 62 Representing Signed Numbers 63 Addition in the 2 s Complement System 64 Subtraction in the 2 s Complement
More informationChapter 3. Boolean Algebra and Digital Logic
Chapter 3 Boolean Algebra and Digital Logic Chapter 3 Objectives Understand the relationship between Boolean logic and digital computer circuits. Learn how to design simple logic circuits. Understand how
More information2. (a) Compare the characteristics of a floppy disk and a hard disk. (b) Discuss in detail memory interleaving. [8+7]
Code No: A109211202 R09 Set No. 2 1. (a) Explain the purpose of the following registers: i. IR ii. PC iii. MDR iv. MAR. (b) Explain with an example the steps in subtraction of two ndigit unsigned numbers.
More informationDIGITAL CIRCUIT LOGIC UNIT 7: MULTILEVEL GATE CIRCUITS NAND AND NOR GATES
DIGITAL CIRCUIT LOGIC UNIT 7: MULTILEVEL GATE CIRCUITS NAND AND NOR GATES 1 iclicker Question 13 Considering the KMap, f can be simplified as (2 minutes): A) f = b c + a b c B) f = ab d + a b d AB CD
More informationSummary. Boolean Addition
Summary Boolean Addition In Boolean algebra, a variable is a symbol used to represent an action, a condition, or data. A single variable can only have a value of or 0. The complement represents the inverse
More informationELCT 501: Digital System Design
ELCT 501: Digital System Lecture 4: CAD tools (Continued) Dr. Mohamed Abd El Ghany, Basic VHDL Concept Via an Example Problem: write VHDL code for 1bit adder 4bit adder 2 1bit adder Inputs: A (1 bit)
More informationCHW 261: Logic Design
CHW 261: Logic Design Instructors: Prof. Hala Zayed Dr. Ahmed Shalaby http://www.bu.edu.eg/staff/halazayed14 http://bu.edu.eg/staff/ahmedshalaby14# Slide 1 Slide 2 Slide 3 Digital Fundamentals CHAPTER
More informationMULTIMEDIA COLLEGE JALAN GURNEY KIRI KUALA LUMPUR
STUDENT IDENTIFICATION NO MULTIMEDIA COLLEGE JALAN GURNEY KIRI 54100 KUALA LUMPUR SECOND SEMESTER FINAL EXAMINATION, 2013/2014 SESSION ITC2223 COMPUTER ORGANIZATION & ARCHITECTURE DSEWEF 1/13 18 FEBRUARY
More informationKorea University of Technology and Education
MEC52 디지털공학 Binary Systems JeeHwan Ryu School of Mechanical Engineering Binary Numbers a 5 a 4 a 3 a 2 a a.a  a 2 a 3 base or radix = a n r n a n r n...a 2 r 2 a ra a  r  a 2 r 2...a m r m
More informationThe Gray Code. Script
Course: B.Sc. Applied Physical Science (Computer Science) Year & Sem.: IInd Year, Sem  IIIrd Subject: Computer Science Paper No.: IX Paper Title: Computer System Architecture Lecture No.: 9 Lecture Title:
More informationContents. Chapter 3 Combinational Circuits Page 1 of 34
Chapter 3 Combinational Circuits Page of 34 Contents Contents... 3 Combinational Circuits... 2 3. Analysis of Combinational Circuits... 2 3.. Using a Truth Table... 2 3..2 Using a Boolean unction... 4
More informationChapter 3 Part 2 Combinational Logic Design
University of Wisconsin  Madison ECE/Comp Sci 352 Digital Systems Fundamentals Kewal K. Saluja and Yu Hen Hu Spring 2002 Chapter 3 Part 2 Combinational Logic Design Originals by: Charles R. Kime and Tom
More informationENDTERM EXAMINATION
(Please Write your Exam Roll No. immediately) ENDTERM EXAMINATION DECEMBER 2006 Exam. Roll No... Exam Series code: 100919DEC06200963 Paper Code: MCA103 Subject: Digital Electronics Time: 3 Hours Maximum
More informationExperiment 4 Boolean Functions Implementation
Experiment 4 Boolean Functions Implementation Introduction: Generally you will find that the basic logic functions AND, OR, NAND, NOR, and NOT are not sufficient to implement complex digital logic functions.
More informationInjntu.com Injntu.com Injntu.com R16
1. a) What are the three methods of obtaining the 2 s complement of a given binary (3M) number? b) What do you mean by Kmap? Name it advantages and disadvantages. (3M) c) Distinguish between a halfadder
More informationHours / 100 Marks Seat No.
17333 13141 3 Hours / 100 Seat No. Instructions (1) All Questions are Compulsory. (2) Answer each next main Question on a new page. (3) Illustrate your answers with neat sketches wherever necessary. (4)
More informationDec Hex Bin ORG ; ZERO. Introduction To Computing
Dec Hex Bin 0 0 00000000 ORG ; ZERO Introduction To Computing OBJECTIVES this chapter enables the student to: Convert any number from base 2, base 10, or base 16 to any of the other two bases. Add and
More informationAddition and multiplication
Addition and multiplication Arithmetic is the most basic thing you can do with a computer, but it s not as easy as you might expect! These next few lectures focus on addition, subtraction, multiplication
More informationKING FAHD UNIVERSITY OF PETROLEUM & MINERALS COMPUTER ENGINEERING DEPARTMENT
KING FAHD UNIVERSITY OF PETROLEUM & MINERALS COMPUTER ENGINEERING DEPARTMENT COE 202: Digital Logic Design Term 162 (Spring 2017) Instructor: Dr. Abdulaziz Barnawi Class time: U.T.R.: 11:0011:50AM Class
More informationthat system. weighted value associated with it. numbers. a number. the absence of a signal. MECH 1500 Quiz 2 Review Name: Class: Date:
Name: Class: Date: MECH 1500 Quiz 2 Review True/False Indicate whether the statement is true or false. 1. The decimal system uses the number 9 as its base. 2. All digital computing devices perform operations
More informationChap.3 3. Chap reduces the complexity required to represent the schematic diagram of a circuit Library
3.1 Combinational Circuits 2 Chap 3. logic circuits for digital systems: combinational vs sequential Combinational Logic Design Combinational Circuit (Chap 3) outputs are determined by the present applied
More informationChapter 4. Combinational Logic. Dr. AbuArqoub
Chapter 4 Combinational Logic Introduction N Input Variables Combinational Logic Circuit M Output Variables 2 Design Procedure The problem is stated 2 The number of available input variables & required
More informationDate Performed: Marks Obtained: /10. Group Members (ID):. Experiment # 04. Boolean Expression Simplification and Implementation
Name: Instructor: Engr. Date Performed: Marks Obtained: /10 Group Members (ID):. Checked By: Date: Experiment # 04 Boolean Expression Simplification and Implementation OBJECTIVES: To understand the utilization
More informationDigital logic fundamentals. Question Bank. Unit I
Digital logic fundamentals Question Bank Subject Name : Digital Logic Fundamentals Subject code: CA102T Staff Name: R.Roseline Unit I 1. What is Number system? 2. Define binary logic. 3. Show how negative
More informationCOLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING QUESTION BANK SUBJECT CODE & NAME: EC 1312 DIGITAL LOGIC CIRCUITS UNIT I
KINGS COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING QUESTION BANK SUBJECT CODE & NAME: EC 1312 DIGITAL LOGIC CIRCUITS YEAR / SEM: III / V UNIT I NUMBER SYSTEM & BOOLEAN ALGEBRA
More information2008 The McGrawHill Companies, Inc. All rights reserved.
28 The McGrawHill Companies, Inc. All rights reserved. 28 The McGrawHill Companies, Inc. All rights reserved. All or Nothing Gate Boolean Expression: A B = Y Truth Table (ee next slide) or AB = Y 28
More informationChapter 4 Arithmetic Functions
Logic and Computer Design Fundamentals Chapter 4 Arithmetic Functions Charles Kime & Thomas Kaminski 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Overview Iterative combinational
More informationCode No: R Set No. 1
Code No: R059210504 Set No. 1 II B.Tech I Semester Regular Examinations, November 2007 DIGITAL LOGIC DESIGN ( Common to Computer Science & Engineering, Information Technology and Computer Science & Systems
More informationCS6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN Lecture Notes
CS6201 DIGITAL PRINCIPLES AND SYSTEM DESIGN Lecture Notes 1.1 Introduction: UNIT I BOOLEAN ALGEBRA AND LOGIC GATES Like normal algebra, Boolean algebra uses alphabetical letters to denote variables. Unlike
More informationUPY14602DIGITAL ELECTRONICS AND MICROPROCESSORS Lesson Plan
UPY14602DIGITAL ELECTRONICS AND MICROPROCESSORS Lesson Plan UNIT I  NUMBER SYSTEMS AND LOGIC GATES Introduction to decimal Binary Octal Hexadecimal number systemsinter conversionsbcd code Excess
More informationScheme G. Sample Test PaperI
Sample Test PaperI Marks : 25 Times:1 Hour 1. All questions are compulsory. 2. Illustrate your answers with neat sketches wherever necessary. 3. Figures to the right indicate full marks. 4. Assume suitable
More informationDigital Techniques. Lecture 1. 1 st Class
Digital Techniques Lecture 1 1 st Class Digital Techniques Digital Computer and Digital System: Digital computer is a part of digital system, it based on binary system. A block diagram of digital computer
More informationLecture 6: Signed Numbers & Arithmetic Circuits. BCD (Binary Coded Decimal) Points Addressed in this Lecture
Points ddressed in this Lecture Lecture 6: Signed Numbers rithmetic Circuits Professor Peter Cheung Department of EEE, Imperial College London (Floyd 2.52.7, 6.16.7) (Tocci 6.16.11, 9.19.2, 9.4) Representing
More informationPhiladelphia University Student Name: Student Number:
Philadelphia University Student Name: Student Number: Faculty of Engineering Serial Number: Final Exam, First Semester: 2018/2019 Dept. of Computer Engineering Course Title: Logic Circuits Date: 03/01/2019
More informationReview of Number Systems
Review of Number Systems The study of number systems is important from the viewpoint of understanding how data are represented before they can be processed by any digital system including a digital computer.
More informationComputer Arithmetic andveriloghdl Fundamentals
Computer Arithmetic andveriloghdl Fundamentals Joseph Cavanagh Santa Clara University California, USA ( r ec) CRC Press vf J TayiorS«. Francis Group ^"*" "^ Boca Raton London New York CRC Press is an imprint
More informationLecture 1: VHDL Quick Start. Digital Systems Design. Fall 10, Dec 17 Lecture 1 1
Lecture 1: VHDL Quick Start Digital Systems Design Fall 10, Dec 17 Lecture 1 1 Objective Quick introduction to VHDL basic language concepts basic design methodology Use The Student s Guide to VHDL or The
More informationDE Solution Set QP Code : 00904
DE Solution Set QP Code : 00904 1. Attempt any three of the following: 15 a. Define digital signal. (1M) With respect to digital signal explain the terms digits and bits.(2m) Also discuss active high and
More informationR a) Simplify the logic functions from binary to seven segment display code converter (8M) b) Simplify the following using Tabular method
SET  1 1. a) Convert the decimal number 250.5 to base 3, base 4 b) Write and prove demorgan laws c) Implement two input EXOR gate from 2 to 1 multiplexer (3M) d) Write the demerits of PROM (3M) e) What
More informationEEE130 Digital Electronics I Lecture #4_1
EEE130 Digital Electronics I Lecture #4_1  Boolean Algebra and Logic Simplification  By Dr. Shahrel A. Suandi 46 Standard Forms of Boolean Expressions There are two standard forms: Sumofproducts form
More information4. Write a sumofproducts representation of the following circuit. Y = (A + B + C) (A + B + C)
COP 273, Winter 26 Exercises 2  combinational logic Questions. How many boolean functions can be defined on n input variables? 2. Consider the function: Y = (A B) (A C) B (a) Draw a combinational logic
More information4 KARNAUGH MAP MINIMIZATION
4 KARNAUGH MAP MINIMIZATION A Karnaugh map provides a systematic method for simplifying Boolean expressions and, if properly used, will produce the simplest SOP or POS expression possible, known as the
More informationDigital Fundamentals
Digital Fundamentals Tenth Edition Floyd Chapter 1 Modified by Yuttapong Jiraraksopakun Floyd, Digital Fundamentals, 10 th 2008 Pearson Education ENE, KMUTT ed 2009 Analog Quantities Most natural quantities
More informationAustin Herring Recitation 002 ECE 200 Project December 4, 2013
1. Fastest Circuit a. How Design Was Obtained The first step of creating the design was to derive the expressions for S and C out from the given truth tables. This was done using Karnaugh maps. The Karnaugh
More information