Chap.3 3. Chap reduces the complexity required to represent the schematic diagram of a circuit Library


 Quentin Johnathan Franklin
 3 years ago
 Views:
Transcription
1 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 inputs performs an operation, which can be specified logically by a set of Boolean expressions Spring 2003 Sequential Circuit (Chap 4) logic gates + storage elements (called flipflops) outputs are a function of the inputs & bit values in the storage elements (state of storage elements is a function of previous inputs) output depends on the present values of inputs & past inputs 3.1 Combinational Circuits Design Topics 4 Combinational Circuit (Fig 3.1) Design Hierarchy consist of input/output variables, logic gates, & interconnections n inputs: 2 n possible combinations m outputs: circuit can be described by m Boolean expressions logic gate transforms binary information from input to outputs a circuit may be specified by a symbol showing inputs, outputs, & a description defining exactly how it operates ninputs moutputs a circuit is composed of logic gates that are interconnected (in terms of implementation) Combinational Circuit a single VLSI processor contains several million gates approach divide & conquer the circuit is broken up into pieces (blocks) Schematic: logic diagram Design Topics 6 primitive blocks: NAND gates predefined blocks leaves lower level of design hierarchy reusable blocks Instance Use of blocks Focus reusable blocks Hierarchical Design fundamental blocks predefined collection of interconnected gates 1. reduces the complexity required to represent the schematic diagram of a circuit Library 2. ends at a set of "leaves" (consisting of AND gates) elementary digital components 3. reuse of blocks
2 3.2 Design Topics 7 8 Functional Blocks predefined, reusable blocks that typically lie in the lower levels of logic design hierarchies provide functions that are broadly useful in digital design available for decades in MSI circuits TopDown Design functional blocks: Ch 5, Ch 6 (cf) bottom up ComputerAided Design Schematic Capture, Library HDL (hardware description language) Verification logic simulator Logic Synthesizer Physical area, delay HDL (hardware description languages) Deacribes hardware structure and behavior VHDL (Very High Speed Integrated Circuits Hardware Description Language) Verilog : Cadence Design Systems, Inc. Feature Programming Language Parallel operation contrary to conventional serial operation Structural description Alternative to schematic: lowlevel description Behavioral description highlevel description Logic Synthesis: RTL(Register transfer level) 9 Logic Synthesis 10 Sequence of Process Analysis Elaboration simulation initialization Testbench: describes H/W and S/W that applies input to the DUT(device under test) and analyzes the outputs for correctness. Logic Synthesis Translation Optimization technology mapping FPGA( field programmable gate array ) 3.3 Analysis Procedure for Combinational Circuit Determining the function that the circuit implements 1) make sure that the circuit is combinational, not sequential 11 no feedback or storage elements 2) obtain the output Boolean functions or the truth table & interpret the operation of the circuit Derivation of Boolean Functions to obtain the output Boolean functions from a logic diagram 1) label all gate outputs that are a function only of input variables or their complements & determine the Boolean functions for each gate 2) label the gates that are a function of input variables and previously labeled gates & find Boolean functions for each gate 3) repeat (2) until the outputs of the circuits are obtained Ex) 3.3 Analysis Procedure 4 inputs, A, B, C, D; 2 outputs, F 1, F 2 T 1 = B' C; T 2 = A' B T 3 = A + T 1 = A + B' C T 4 = T 2 D = (A' B) D = A'BD' +AD +B'D T 5 = T 2 + D = A'B + D So, F 2 = T 5 = T 2 + D = A'B + D F 1 = T 3 + T 4 = A + B'C + A'BD' +AD + B'D = A(1+D) + B'C + A BD' + B'D = A+A BD +B C+B D=A+BD +B C+B D 12
3 3.3 Analysis Procedure Analysis Procedure 14 Derivation of the Truth Table from the Logic Diagram Ex) binary adder a straightforward process 1) Determine no of input variables in the circuit For n inputs, list 2 n (0(2 n 1)) binary numbers 2) Label the outputs of selected gates 3) Obtain the truth table for the outputs of those gates 4) Proceed to obtain the truth table for the outputs of gates 3 inputs, X, Y, Z; 2 outputs C, S (00 ~ 11) C is 1 if XY, XZ, or YZ = 11; C is 0 otherwise 3.3 Analysis Procedure Design Procedure 16 Logic Simulation  ViewDraw & ViewTrace Procedure to design combinational circuits 1) Determine required number of inputs & outputs & assign a letter symbol to each 2) Derive the truth table 3) Obtain simplified Boolean functions for each output 4) Draw the logic diagram 5) Verify the correctness of the design Truth Table n input variables: 2 n binary numbers output functions give the exact definition of comb circuit. Output functions are simplified by method, such as algebraic manipulation, map method, computer programs 3.4 Design Procedure Design Procedure 18 Ex 3.1) Design a combinational circuit with 3 inputs and 1 output Output is 1 when input is less than 3(011), otherwise 0. Code Converter a circuit that translates info from one binary code to another Ex 3.2) BCD to Excess3 Code Converter Excess3 code: decimal digit + 3 desirable to implementing decimal subtraction (Don't care conditions!!)
4 3.4 Design Procedure Design Procedure 20 twolevel ANDOR logic diagram W = A + BC + BD = A + B(C + D) X = B'C + B'D + BC'D' = B'(C + D) + BC'D' Y = CD + C'D' = (C D)' Z = D' Logic Diagram 3.4 Design Procedure Decoders 22 Ex3.3) BCD to SevenSegment Decoder LED (light emitting diodes), or LCD (liquid crystal display) accept a decimal digit in BCD & generate the appropriate outputs Decoders a binary code of n bits represents 2 n distinct elements convert binary info of n coded inputs to 2 n (max) unique outputs outputs (a, b, c, d, e, f, g) 7 fourvariable maps ntomline decoders (m < 2 n ) generate 2 n (or fewer) minterms of n input variables 3to8line decoder (3 inputs & 8 outputs) 3.5 Decoders Decoders 24 Ex) binarytooctal conversion 2to4line decoder with enable input constructed with NAND instead of AND gates operates with comp outputs and comp enable E
5 3.5 Decoders Decoders 26 Decoder Expansion combine two or more small decoder w/ enable inputs form a larger decoder 3to8line decoder with two 2to4line decoders Combinational Circuit Implementation a decoder provides 2 n minterms of n input variables since Boolean functions are expressed as a sum of minterms, one can use a decoder(minterms) and OR(sum) gates ninputs, moutputs combi. logic : nx2 n decoder + mor gates Ex 3.4) a binary adder S(X,Y,Z) = Σ m(1,2,4,7); C(X,Y,Z) = Σ m(3,5,6,7) if A 2 =0, upper is enabled; if A 2 =1, lower is enabled. 3.6 Encoders Encoders 28 perform the inverse operation of a decoder 2 n (or less) input lines and n output lines Octaltobinary encoder implemented with 3 4input OR gates only one input can be active at any given time more than 2 inputs are active undefined! priority for inputs Priority Encoder 2 or more inputs are equal to 1 at the same time, an input with the highest priority will take precedence valid A 0 = D 1 + D 3 + D 5 + D 7 ; A 1 = D 2 + D 3 + D 6 + D 7 ; A 2 = D 4 + D 5 + D 6 + D 7 ; 3.6 Encoders Multiplexers(MUX) 30 selects binary information from one of many input lines, and directs it to a single output line Normally, 2 n input lines and n selection variables 4to1line multiplexer A 1 = D 2 + D 3 V = D 0 + D 1 + D 2 + D 3 A 0 = D 3 + D 1 D 2 ' selection inputs called data selector or MUX 2 n to1line multiplexer is constructed from nto2 n decoder by adding 2 n input lines
6 Multiplexers 32 Quadruple 2to1 Line Multiplexer common selection & enable lines to select multibits 3.7 Multiplexers Multiplexers 34 Combinational Circuit Implementation a decoder can be used to implement Boolean Functions by employing external OR gates the minterms of a function are generated in a multiplexer by the circuit associated with the selection inputs n variables with a multiplexer with n1 selection inputs Ex) F(X,Y,Z) = m(1,2,6,7)  implemented with a 4to1line multiplexer first (n1) variables > selection inputs remaining 1 variable > data inputs  any Boolean function of n variables can be implemented with a multiplexer with n1 selection inputs and 2 n1 data inputs 3.7 Multiplexers Multiplexers 36 Ex) F(A,B,C,D) = Σ m(1,3,4,11,12,13,14,15) Demultiplexer perform the inverse operation of a multiplexer receives information from a single line and transmits it to one of 2 n possible output lines 1to4line demultiplexer the input E has a path to all 4 outputs, selected by two selection lines S1 and S0 a decoder with enable input is referred to as decoder /demultiplexer identical to a 2to4 line decoder with enable input
7 3.8 Binary Adders Binary Adders 38 Arithmetic Circuit Addition of 3 binary inputs, 'Full Adder' a combinational circuit for arithmetic operations such as addition, subtraction, multiplication, and division with binary numbers or decimal numbers in a binary code Addition of 2 binary inputs, 'Half Adder 0+0=0, 0+1=1, 1+0=1, 1+1 = 10 S = X'Y + XY' = X Y; C = XY Logic Diagram of Full Adder Binary Ripple Carry Adder 3.8 Binary Adders sum of two nbit binary numbers in parallel 39 c s i s i s HA c x i HA y c c i + 1 i 40 4bit parallel adder A = 1011, B = 0011 (a) Block diagram c i s i x i y i c i + 1 (b) Detailed diagram A decomposed implementation of the fulladder circuit 3.8 Binary Adders 41 x 1 y 1 x 0 y 0 42 Carry Lookahead Adder The ripple carry adder has a long circuit delay the longest delay: (2n + 2) gate delay Carry Lookahead Adder reduced delay at the price of complex hardware c 2 g 1 p 1 c 1 g 0 p 0 c 0 a new logic hierarchy PFA : partial full adder P i : propagate function P i = A i B i G i : generate function Stage 1 Stage 0 G i = A i B i s 1 s 0 A ripplecarry adder with generate/propagate signals
8 Gate Delay of 4bits 4 Ripple Carry Adder 43 x 1 y 1 x 0 y 0 44 x 0 y 0 g 1 p 1 g 0 p 0 c 0 c 2 c 1 C1 : 3 gate delay S0 : 2 C2 : 5 S1 : 4 C3 : 7 S2 : 6 C4 : 9 S3 : 8 In general, for n, Cn : 2n+1 Sn1 : 2n s 1 Figure 5.16 The first two stages of a carrylookahead adder s Binary Adders Development of Carry Lookahead Adder C 2 =G 1 +P1(G0+P0C0) C 3 =G2+P2(G1+P1(G0+P0C0)) =G2+P2G1+P2P1G0+P2P1P0C0 Group propagation ftn P 03 =P3P2P1P0 Group generate ftn G 03 =G3+P3G2+P3P2G1+P3P2P1G x y x 15 8 y 15 8 x 7 0 y 7 0 c 32 Block c 24 c Block c 8 Block 0 c 0 s s 15 8 s 7 0 A hierarchical carrylookahead adder with ripplecarry between blocks
9 x y x 15 8 y 15 8 x 7 0 y Binary Subtraction 50 P 3 G 3 Block 3 s c 24 P 1 G 1 Block 1 s 15 8 P 0 G 0 Block 0 s 7 0 c 0 Subtraction MN= M=Minuend N=Subtrahend 1 c 32 c 16 Secondlevel lookahead A hierarchical carrylookahead adder c 8 a borrow occurs into the most significant position(end borrow occurs) M  N ==> M  N + 2 n ==> 2 n (MN + 2 n ) = N  M 1) Subtract the subtrahend N from the minuend M 2) If no end borrow occurs, then M > N 3) If an end borrow occurs, then NM is subtracted from 2 n & minus sign is appended to the result Subtraction of a binary number from 2 n "2's complement form" 3.9 Binary Subtraction Binary Subtraction 52 Ex 3.5) Complements 2 types: radix complement: r's complement diminished radix complement: (r1)'s complement 2's & 1's for binary numbers 10's & 9's for decimal numbers 1's complement of N (binary number): (2 n 1) N 1's comp of ==> 's comp of ==> Binary Subtraction Binary Subtraction 54 2's complement of N: 2 n  N for N!= 0, 0 for N = 0 add 1 to the 1's complement 2's comp of ==> ==> leaving all least significant 0's and the first unchanged then replacing 1's with 0's, 0's with 1's in all other higher significant bits 2's comp of ==> 's complement of N is 2 n N & the complement of the complement is 2 n (2 n N) = N Subtraction with Complements (M  N) 1) add 2's comp of the subtrahend N to the minuend M M + (2 n N) = M  N + 2 n 2) if M > N, the end carry is discarded 3) if M < N, the result is 2 n (N M) no end carry take the 2's complement of the sum & place a minus sign, i.e. ( 2 n (2 n (NM))) avoid overflow problem to accomodate the sum
10 3.10 Binary AdderSubtractors Binary AdderSubtractors 56 Signed Binary Numbers sign bit(=msb, most significant bit) 0 for positive numbers 1 for negative numbers 9 (=1001) using 8 bits signedmagnitude representation: signed 1's complement representation: signed 2's complement representation: A  B = A + (B) in 2's complement form with exclusiveor gate (B 0=B; B 1=B') adder if S = 0; subtractor if S = 1 4bit signed binary number (positive numbers are identical) signedmagnitude 7 ~ 1, 0, 0, 1 ~ 7 (2 zeros) signed 1's comp 7 ~ 1, 0, 0, 1 ~ 7 (2 zeros) signed 2's comp 8 ~ 1, 0, 1 ~ 7 signed 1's comp : useful as a logical operation signed 2's comp : popular in use 3.10 Binary AdderSubtractors Binary AdderSubtractors 58 8bits Signed Binary Addition using 2 s complement 8bits Signed Binary subtraction using 2 s complement + Signed Binary Number 3.10 Binary AdderSubtractors 59 Overflow Detection Logic 60 Overflow
11 3.11 Binary Multipliers Binary Multipliers 62 a 2Bit by 2Bit Binary Multiplier a 4Bit by 3Bit Binary Multiplier B 3 B 2 B 1 B 0 x A 2 A 1 A A 0 B 3 A 0 B 2 A 0 B 1 A 0 B 0 A 1 B 3 A 1 B 2 A 1 B 1 A 1 B 0 A 2 B 3 A 2 B 2 A 2 B 1 A 2 B Decimal Arithmetic (BCD Adder) Decimal Arithmetic 64 0~9 ( 0000 ~ 1001), 1010, 1011, 1100, 1101, 1110, Ex) = B 16 error!!!! = 11 BCD ok C Sum BCD Adder binary numbers 1010 ~ 1111 need to correct 1010, 1011, 1100, 1101, 1110, 1111 if C = K + Z 1 Z 3 + Z 2 Z 3, add 0110 to the binary sum to add two n decimal digits needs n BCD adders 3.12 Decimal Arithmetic Use of Complements in Decimal 9's complement if is = 's complement if is = 's complement if is Structural Desc of 2to2 to4 4 Line Decoder 66 no end carry (10 s complement of 30718) =
12 Structural Desc of 4to4 to1 1 Line MUX 67 Dataflow Desc of 2to2 to4 4 Line Decoder 68 Dataflow Desc of 4to4 to1 1 Line MUX 69 Dataflow Desc of 4to4 to1 1 MUX 70 Structural/Dataflow Desc of 4bits 4 Full Adder 71 Structural/Dataflow Desc of 4bits 4 Full Adder 72
13 Structural/Dataflow Desc of 4bits 4 Full Adder 73 Behavioral Desc of 4bit 4 Full Adder 74
Chapter 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 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 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 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 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 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 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 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 informationCOMBINATIONAL 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 informationChapter 3: part 3 Binary Subtraction
Chapter 3: part 3 Binary Subtraction Iterative combinational circuits Binary adders Half and full adders Ripple carry and carry lookahead adders Binary subtraction Binary addersubtractors Signed binary
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 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 informationSUBJECT CODE: IT T35 DIGITAL SYSTEM DESIGN YEAR / SEM : 2 / 3
UNIT  I PART A (2 Marks) 1. Using Demorgan s theorem convert the following Boolean expression to an equivalent expression that has only OR and complement operations. Show the function can be implemented
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 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 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 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 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 informationQUESTION BANK FOR TEST
CSCI 2121 Computer Organization and Assembly Language PRACTICE QUESTION BANK FOR TEST 1 Note: This represents a sample set. Please study all the topics from the lecture notes. Question 1. Multiple Choice
More informationVALLIAMMAI ENGINEERING COLLEGE. SRM Nagar, Kattankulathur DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING EC6302 DIGITAL ELECTRONICS
VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur603 203 DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING EC6302 DIGITAL ELECTRONICS YEAR / SEMESTER: II / III ACADEMIC YEAR: 20152016 (ODD
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 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 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 informationComputer Sc. & IT. Digital Logic. Computer Sciencee & Information Technology. 20 Rank under AIR 100. Postal Correspondence
GATE Postal Correspondence Computer Sc. & IT 1 Digital Logic Computer Sciencee & Information Technology (CS) 20 Rank under AIR 100 Postal Correspondence Examination Oriented Theory, Practice Set Key concepts,
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 informationSIDDHARTH GROUP OF INSTITUTIONS :: PUTTUR Siddharth Nagar, Narayanavanam Road QUESTION BANK (DESCRIPTIVE)
SIDDHARTH GROUP OF INSTITUTIONS :: PUTTUR Siddharth Nagar, Narayanavanam Road 517583 QUESTION BANK (DESCRIPTIVE) Subject with Code : STLD(16EC402) Year & Sem: IIB.Tech & ISem Course & Branch: B.Tech
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 informationCOPYRIGHTED MATERIAL INDEX
INDEX Absorption law, 31, 38 Acyclic graph, 35 tree, 36 Addition operators, in VHDL (VHSIC hardware description language), 192 Algebraic division, 105 AND gate, 48 49 Antisymmetric, 34 Applicable input
More informationCombinational Circuit Design
Modeling Combinational Circuits with Verilog Prof. ChienNan Liu TEL: 342275 ext:34534 Email: jimmy@ee.ncu.edu.tw 3 Combinational Circuit Design Outputs are functions of inputs inputs Combinational Circuit
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 informationHANSABA COLLEGE OF ENGINEERING & TECHNOLOGY (098) SUBJECT: DIGITAL ELECTRONICS ( ) Assignment
Assignment 1. What is multiplexer? With logic circuit and function table explain the working of 4 to 1 line multiplexer. 2. Implement following Boolean function using 8: 1 multiplexer. F(A,B,C,D) = (2,3,5,7,8,9,12,13,14,15)
More informationDigital Systems and Binary Numbers
Digital Systems and Binary Numbers Mano & Ciletti Chapter 1 By Suleyman TOSUN Ankara University Outline Digital Systems Binary Numbers NumberBase Conversions Octal and Hexadecimal Numbers Complements
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 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 informationwww.vidyarthiplus.com Question Paper Code : 31298 B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2013. Third Semester Computer Science and Engineering CS 2202/CS 34/EC 1206 A/10144 CS 303/080230012DIGITAL
More informationChapter 1. Digital Systems and Binary Numbers
Chapter 1. Digital Systems and Binary Numbers Tong In Oh 1 1.1 Digital Systems Digital age Characteristic of digital system Generality and flexibility Represent and manipulate discrete elements of information
More informationR10. II B. Tech I Semester, Supplementary Examinations, May
SET  1 1. a) Convert the following decimal numbers into an equivalent binary numbers. i) 53.625 ii) 4097.188 iii) 167 iv) 0.4475 b) Add the following numbers using 2 s complement method. i) 48 and +31
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 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 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 informationPrinciples of Computer Architecture. Chapter 3: Arithmetic
31 Chapter 3  Arithmetic Principles of Computer Architecture Miles Murdocca and Vincent Heuring Chapter 3: Arithmetic 32 Chapter 3  Arithmetic 3.1 Overview Chapter Contents 3.2 Fixed Point Addition
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 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 7 Arithmetic Circuits Design and Implementation
Experiment 7 Arithmetic Circuits Design and Implementation Introduction: Addition is just what you would expect in computers. Digits are added bit by bit from right to left, with carries passed to the
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 informationCombinational Logic with MSI and LSI
1010101010101010101010101010101010101010101010101010101010101010101010101010101010 1010101010101010101010101010101010101010101010101010101010101010101010101010101010 1010101010101010101010101010101010101010101010101010101010101010101010101010101010
More informationSIR C.R.REDDY COLLEGE OF ENGINEERING, ELURU DEPARTMENT OF INFORMATION TECHNOLOGY LESSON PLAN
SIR C.R.REDDY COLLEGE OF ENGINEERING, ELURU DEPARTMENT OF INFORMATION TECHNOLOGY LESSON PLAN SUBJECT: CSE 2.1.6 DIGITAL LOGIC DESIGN CLASS: 2/4 B.Tech., I SEMESTER, A.Y.201718 INSTRUCTOR: Sri A.M.K.KANNA
More informationDHANALAKSHMI SRINIVASAN COLLEGE OF ENGINEERING AND TECHNOLOGY
DHANALAKSHMI SRINIVASAN COLLEGE OF ENGINEERING AND TECHNOLOGY Dept/Sem: II CSE/03 DEPARTMENT OF ECE CS8351 DIGITAL PRINCIPLES AND SYSTEM DESIGN UNIT I BOOLEAN ALGEBRA AND LOGIC GATES PART A 1. How many
More informationNH 67, Karur Trichy Highways, Puliyur C.F, Karur District DEPARTMENT OF INFORMATION TECHNOLOGY CS 2202 DIGITAL PRINCIPLES AND SYSTEM DESIGN
NH 67, Karur Trichy Highways, Puliyur C.F, 639 114 Karur District DEPARTMENT OF INFORMATION TECHNOLOGY CS 2202 DIGITAL PRINCIPLES AND SYSTEM DESIGN UNIT 2 COMBINATIONAL LOGIC Combinational circuits Analysis
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 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 informationCombinational Logic Use the Boolean Algebra and the minimization techniques to design useful circuits No feedback, no memory Just n inputs, m outputs
Combinational Logic Use the Boolean Algebra and the minimization techniques to design useful circuits No feedback, no memory Just n inputs, m outputs and an arbitrary truth table Analysis Procedure We
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 informationNumber System. Introduction. Decimal Numbers
Number System Introduction Number systems provide the basis for all operations in information processing systems. In a number system the information is divided into a group of symbols; for example, 26
More information10EC33: DIGITAL ELECTRONICS QUESTION BANK
10EC33: DIGITAL ELECTRONICS Faculty: Dr.Bajarangbali E Examination QuestionS QUESTION BANK 1. Discuss canonical & standard forms of Boolean functions with an example. 2. Convert the following Boolean function
More informationBoolean Algebra and Logic Gates
Boolean Algebra and Logic Gates Binary logic is used in all of today's digital computers and devices Cost of the circuits is an important factor Finding simpler and cheaper but equivalent circuits can
More information2.1 Binary Logic and Gates
1 EED2003 Digital Design Presentation 2: Boolean Algebra Asst. Prof.Dr. Ahmet ÖZKURT Asst. Prof.Dr Hakkı T. YALAZAN Based on the Lecture Notes by Jaeyoung Choi choi@comp.ssu.ac.kr Fall 2000 2.1 Binary
More informationChapter 3 Part 2 Combinational Logic Design
University of Wisconsin  Madison EE/omp ci 352 Digital ystems Fundamentals Kewal K. aluja and u Hen Hu pring 2002 hapter 3 Part 2 ombinational Logic Design Originals by: harles R. Kime and Tom Kamisnski
More information3. The high voltage level of a digital signal in positive logic is : a) 1 b) 0 c) either 1 or 0
1. The number of level in a digital signal is: a) one b) two c) four d) ten 2. A pure sine wave is : a) a digital signal b) analog signal c) can be digital or analog signal d) neither digital nor analog
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 informationFundamentals of Computer Systems
Fundamentals of Computer Systems Combinational Logic Martha. Kim Columbia University Spring 6 / Combinational Circuits Combinational circuits are stateless. Their output is a function only of the current
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 Design. Verilo. and. Fundamentals. fit HDL. Joseph Cavanagh. CRC Press Taylor & Francis Group Boca Raton London New York
Digital Design and Verilo fit HDL Fundamentals Joseph Cavanagh Santa Clara University California, USA CRC Press Taylor & Francis Group Boca Raton London New York CRC Press is an imprint of the Taylor &
More informationLOGIC DESIGN. Dr. Mahmoud Abo_elfetouh
LOGIC DESIGN Dr. Mahmoud Abo_elfetouh Course objectives This course provides you with a basic understanding of what digital devices are, how they operate, and how they can be designed to perform useful
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 informationVALLIAMMAI ENGINEERING COLLEGE
VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur 603 203 DEPARTMENT OF INFORMATION TECHNOLOGY & COMPUTER SCIENCE AND ENGINEERING QUESTION BANK II SEMESTER CS6201 DIGITAL PRINCIPLE AND SYSTEM DESIGN
More informationCS8803: Advanced Digital Design for Embedded Hardware
CS883: Advanced Digital Design for Embedded Hardware Lecture 2: Boolean Algebra, Gate Network, and Combinational Blocks Instructor: Sung Kyu Lim (limsk@ece.gatech.edu) Website: http://users.ece.gatech.edu/limsk/course/cs883
More informationChapter 2. Boolean Algebra and Logic Gates
Chapter 2. Boolean Algebra and Logic Gates Tong In Oh 1 Basic Definitions 2 3 2.3 Axiomatic Definition of Boolean Algebra Boolean algebra: Algebraic structure defined by a set of elements, B, together
More informationINSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad
INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad  500 043 COMPUTER SCIENCE AND ENGINEERING TUTORIAL QUESTION BANK Name : DIGITAL LOGIC DESISN Code : AEC020 Class : B Tech III Semester
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 informationR07
www..com www..com SET  1 II B. Tech I Semester Supplementary Examinations May 2013 SWITCHING THEORY AND LOGIC DESIGN (Com. to EEE, EIE, BME, ECC) Time: 3 hours Max. Marks: 80 Answer any FIVE Questions
More informationINSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad
INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad  500043 Course Name : DIGITAL LOGIC DESISN Course Code : AEC020 Class : B Tech III Semester Branch : CSE Academic Year : 2018 2019
More information6.1 Combinational Circuits. George Boole ( ) Claude Shannon ( )
6. Combinational Circuits George Boole (85 864) Claude Shannon (96 2) Signals and Wires Digital signals Binary (or logical ) values: or, on or off, high or low voltage Wires. Propagate digital signals
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 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 information(ii) Simplify and implement the following SOP function using NOR gates:
DHANALAKSHMI COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING EE6301 DIGITAL LOGIC CIRCUITS UNIT I NUMBER SYSTEMS AND DIGITAL LOGIC FAMILIES PART A 1. How can an OR gate be
More informationChapter 4 Arithmetic
Computer Eng 1 (ECE290) Chapter 4 Arithmetic Functions and Circuits HOANG Trang Reference: 2008 Pearson Education, Inc. Lecture note of Prof.Donna J.Brown Overview Binary adders Half and full adders Ripple
More informationLecture (02) Operations on numbering systems
Lecture (02) Operations on numbering systems By: Dr. Ahmed ElShafee ١ Dr. Ahmed ElShafee, ACU : Spring 2018, CSE202 Logic Design I Complements of a number Complements are used in digital computers to simplify
More informationUNIT I BOOLEAN ALGEBRA AND COMBINATIONAL CIRCUITS PARTA (2 MARKS)
SUBJECT NAME: DIGITAL LOGIC CIRCUITS YEAR / SEM : II / III DEPARTMENT : EEE UNIT I BOOLEAN ALGEBRA AND COMBINATIONAL CIRCUITS 1. What is variable mapping? 2. Name the two canonical forms for Boolean algebra.
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 informationDepartment of Electrical Engineering McGill University ECSE 221 Introduction to Computer Engineering Assignment 2 Combinational Logic
Department of Electrical Engineering McGill University ECSE 221 Introduction to Computer Engineering Assignment 2 Combinational Logic Question 1: Due October 19 th, 2009 A convenient shorthand for specifying
More informationVALLIAMMAI ENGINEERING COLLEGE
VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur 603 203 DEPARTMENT OF INFORMATION TECHNOLOGY QUESTION BANK Academic Year 2018 19 III SEMESTER CS8351DIGITAL PRINCIPLES AND SYSTEM DESIGN Regulation
More informationKINGS COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING QUESTION BANK NAME OF THE SUBJECT: EE 2255 DIGITAL LOGIC CIRCUITS
KINGS COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING QUESTION BANK NAME OF THE SUBJECT: EE 2255 DIGITAL LOGIC CIRCUITS YEAR / SEM: II / IV UNIT I BOOLEAN ALGEBRA AND COMBINATIONAL
More informationSWITCHING THEORY AND LOGIC CIRCUITS
SWITCHING THEORY AND LOGIC CIRCUITS COURSE OBJECTIVES. To understand the concepts and techniques associated with the number systems and codes 2. To understand the simplification methods (Boolean algebra
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 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 informationMicrocomputers. Outline. Number Systems and Digital Logic Review
Microcomputers Number Systems and Digital Logic Review Lecture 11 Outline Number systems and formats Common number systems Base Conversion Integer representation Signed integer representation Binary coded
More informationPrinciples of Digital Techniques PDT (17320) Assignment No State advantages of digital system over analog system.
Assignment No. 1 1. State advantages of digital system over analog system. 2. Convert following numbers a. (138.56) 10 = (?) 2 = (?) 8 = (?) 16 b. (1110011.011) 2 = (?) 10 = (?) 8 = (?) 16 c. (3004.06)
More informationChapter Three. Digital Components
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
More informationNumerical Representations On The Computer: Negative And Rational Numbers
Numerical Representations On The Computer: Negative And Rational Numbers How are negative and rational numbers represented on the computer? How are subtractions performed by the computer? Subtraction In
More informationMGUBCA205 Second Sem Core VI Fundamentals of Digital Systems MCQ s. 2. Why the decimal number system is also called as positional number system?
MGUBCA205 Second Sem Core VI Fundamentals of Digital Systems MCQ s Unit1 Number Systems 1. What does a decimal number represents? A. Quality B. Quantity C. Position D. None of the above 2. Why the
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 informationCS 121 Digital Logic Design. Chapter 1. Teacher Assistant. Hadeel AlAteeq
CS 121 Digital Logic Design Chapter 1 Teacher Assistant Hadeel AlAteeq Announcement DON T forgot to SIGN your schedule OR you will not be allowed to attend next lecture. Communication Office hours (8
More informationIT T35 Digital system desigm y  ii /s  iii
UNIT  V Introduction to Verilog Hardware Description Language Introduction HDL for combinational circuits Sequential circuits Registers and counters HDL description for binary multiplier. 5.1 INTRODUCTION
More informationBoolean Algebra. BME208 Logic Circuits Yalçın İŞLER
Boolean Algebra BME28 Logic Circuits Yalçın İŞLER islerya@yahoo.com http://me.islerya.com 5 Boolean Algebra /2 A set of elements B There exist at least two elements x, y B s. t. x y Binary operators: +
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 informationNumerical Representations On The Computer: Negative And Rational Numbers
Numerical Representations On The Computer: Negative And Rational Numbers How are negative and rational numbers represented on the computer? How are subtractions performed by the computer? Subtraction In
More informationUNITIII REGISTER TRANSFER LANGUAGE AND DESIGN OF CONTROL UNIT
UNITIII 1 KNREDDY UNITIII REGISTER TRANSFER LANGUAGE AND DESIGN OF CONTROL UNIT Register Transfer: Register Transfer Language Register Transfer Bus and Memory Transfers Arithmetic Micro operations Logic
More informationMYcsvtu Notes DATA REPRESENTATION. Data Types. Complements. Fixed Point Representations. Floating Point Representations. Other Binary Codes
DATA REPRESENTATION Data Types Complements Fixed Point Representations Floating Point Representations Other Binary Codes Error Detection Codes Hamming Codes 1. DATA REPRESENTATION Information that a Computer
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 information