7.1. Unit 7. Fundamental Digital Building Blocks: Decoders & Multiplexers

Size: px
Start display at page:

Download "7.1. Unit 7. Fundamental Digital Building Blocks: Decoders & Multiplexers"

Transcription

1 7. Unit 7 Fundamental Digital Building Blocks: Decoders & Multiplexers

2 CHECKER / DECODER 7.2

3 7.3 Gates Gates can have more than 2 inputs but the functions stay the same AND = output = if ALL inputs are Outputs for only input combination OR = output = if AN input is Outputs for only input combination X Z F X Z F x y z F x y z F 3-input AND 3-input OR

4 7.4 Checkers / Decoders An AND gate only outputs for combination That combination can be changed by adding inverters to the inputs We can think of the AND gate as checking or decoding a specific combination and outputting a when it matches. X Z F X Z F x y z F x y z F AND gate decoding (checking for) combination AND gate decoding (checking for) combination

5 7.5 Checkers / Decoders Place inverters at the input of the AND gates such that F produces only for input combination {x,y,z} = {} G produces only for input combination {x,y,z} = {} X Z F X Z G x y z F x y z G AND gate decoding (checking for) combination AND gate decoding (checking for) combination

6 7.6 Checkers / Decoders An OR gate only outputs for combination That combination can be changed by adding inverters to the inputs We can think of the OR gate as checking or decoding a specific combination and outputting a when it matches. x y z OR gate decoding (checking for) combination F X Z F x y z OR gate decoding (checking for) combination F X Z F

7 7.7 Decoder Exercise Compilers translate software to instructions that tell the processor to ADD, LOAD from Memory, tore to Memory, etc. These instructions are binary codes The processor must decode the instruction Create an AND gate decoder for each instruction type in the table that will produce '' when that instruction is about to be executed Instruction Type 6-bit OPCODE OP[5:] ADD LOAD TORE BRANCH ADD LOAD TORE

8 7.8 Full Decoders A full decoder is a building block that: Takes in an n-bit binary number as input Decodes that binary number and activates the corresponding output Individual outputs for ALL 2 n input combinations 3-to-8 Decoder There are gates inside to implement each output D D 3-bit binary number Z (LB) X (MB) D2 D3 D4 D5 output for each combination of the input number D6 D7

9 7.9 Decoders A decoder is a building block that: Takes a binary number as input Decodes that binary number and activates the corresponding output Put in 6=, Output 6 activates ( ) Put in 5=, Output 5 activates ( ) Binary #6 Z (LB) X (MB) D D D2 D3 D4 D5 D6 D7 Only that numbered output is activated

10 7. Decoders A decoder is a building block that: Takes a binary number as input Decodes that binary number and activates the corresponding output Put in 6=, Output 6 activates ( ) Put in 5=, Output 5 activates ( ) Binary #5 Z (LB) X (MB) D D D2 D3 D4 D5 D6 D7 Only that numbered output is activated

11 7. Decoder izes A decoder w/ an n-bit input has 2 n outputs output for every combination of the n-bit input D D D2 X (MB) D3 n inputs (2) 2-to-4 Decoder 2 n outputs (4) n inputs (3) A A A2 (MB) to-8 Decoder 2 n outputs (8)

12 7.2 Exercise Complete the design of a 2-to-4 decoder X (MB) D D D2 D3 D y D x D2 D3

13 7.3 Building Decoders 3-bit number [A2:A] Checker for Checker for Checker for Checker for Checker for Checker for O O O2 O3 O4 O5 A A A2 O O O2 O3 O4 O5 Checker for O6 O6 Checker for O7 O7

14 7.4 Vending Machine Example Assuming the keypad produces a 4-bit numeric output, add logic to produce the release signals for each of the 6 vending items A[3:] 4-to-6 decoder Consider any problems with this design.

15 7.5 Enables In a normal decoder exactly one output is active at all times It may be undesirable to always have an active output We can add an extra input (called an enable) that can independently force all the outputs to their inactive values X D D D2 D3 One output will always be active X E D D D2 D3 2-to-4 Decoder Enable Will force all outputs to when E = (i.e. not enabled)

16 7.6 Enables When E=, inputs is ignored X Enable E D D D2 D3 ince E=, all outputs = When E=, inputs will cause the appropriate output to go active X Enable E D D D2 D3 ince E=, outputs will function normally

17 7.7 Enables Enables can be implemented by connecting it to each AND gate of the decoder A A B B A D D B D2 D3 E When E=, AND anything = When E=, AND anything = that anything, which was the normal decoding logic

18 7.8 Multiplexers Multiplexers are one of the most common digital circuits Anatomy: n data inputs, log 2 n select bits, output A multiplexer ( mux for short) selects one data input and passes it to the output 4-to- Mux i n data inputs i i2 y output i3 s log 2 n select bits

19 7.9 Multiplexers 4-to- Mux 2 Thus, input 2 = C is selected and passed to the output A B C D i i i2 i3 s y C elect bits = 2 = 2.

20 7.2 Multiplexers 4-to- Mux, 32-bit wide mux 2 Thus, input = A is selected and passed to the output A B C D i i i2 i3 s y A elect bits = 2 =.

21 7.2 Multiplexers 2-to- Mux, 32-bit wide mux A i 2 Thus, input = B is selected and passed to the output B i s y B elect bits = 2 =.

22 OEL OEL OEL2 OEL Recall Using T/T2 st Level of AND gates act as barriers only passing channel OR gates combines 3 streams of s with the channel that got passed (i.e. ICH) 2 nd Level of AND gates passes the channel to only the selected output Essentially this logic forms a 4-to- mux where one level of gates blocks all but and then the OR gate combines all signals ICH ICH ICH Connection Point ICH ICH ICH OCH OCH ICH 2 ICH OCH 2 ICH 3 ICH ICH OCH 3 AND: AND ICHx = ICHx AND ICHx = IEL IEL IEL2 IEL3 OR: + ICH + + = ICH AND: AND ICH = ICH AND ICH =

23 7.23 Exercise: Build a 4-to- mux Complete the 4-to- mux to the right by drawing wires between the 2-to-4 decode and the AND gates I I I 2 I 3 = = AND Gates acting as barrier gates = = Final OR gate takes 3 zero s and one selected input 2-to-4 Decoder

24 7.24 Building a Mux To build a mux Decode the select bits and include the corresponding data input. Finally OR all the first level outputs together. I = 2 I I 2 I I I I 3

25 7.25 Building a Mux To build a mux Decode the select bits and include the corresponding data input. Finally OR all the first level outputs together. I = 2 I I 2 I 3 I 3 I 3 I 3

26 7.26 Building a Mux To build a mux Decode the select bits and include the corresponding data input. Finally OR all the first level outputs together. I I

27 7.27 Building Wide Muxes o far muxes only have single bit inputs I is only -bit I is only -bit What if we still want to select between 2 inputs but now each input is a 4- bit number Pass all 4 bits Use a 4-bit wide 2-to- mux B I A B A I I I -bit wide 2-to- mux When we select I of I or I or I we want all 4-bits of that input to be passed A B 4-bit wide 2-to- mux

28 7.28 Building Wide Muxes Use one mux per "lane" (bit) To build a 4-bit wide 2-to- mux, use 4 separate 2-to- muxes Operation: When =, all muxes pass their I inputs which means all the A bits get through When =, all muxes pass their I inputs which means all the B bits get through In general, to build an m-bit wide (i.e. m-lane) n-to- mux, use m individual n-to- muxes A A A2 A3 B B B2 B3 A B A B A2 B2 A3 I I I I I I I 2 3 B3 I

29 7.29 Multiplexers 4-to- Mux, 32-bit wide mux 2 Thus, input = A[3:] is selected and passed to the output A[3:] B[3:] C[3:] D[3:] i i i2 i3 s y A[3:] elect bits = 2 =.

30 7.3 Multiplexers 2-to- Mux, 32-bit wide mux A[3:] i 2 Thus, input = B[3:] is selected and passed to the output B[3:] i s y B[3:] elect bits = 2 =.

31 7.3 Exercise How many -bit wide muxes and of what size would you need to build a 4-to-, 8-bit wide mux (i.e. there are 4 numbers: W[7:], X[7:], [7:] and Z[7:] and you must select one) How many -bit wide muxes and of what size would you need to build a 8-to-, 2-bit wide mux?

32 7.32 Building Large Muxes imilar to a tournament of sports teams Many teams enter and then are narrowed down to winner In each round winners play winners tage 3 Final output tage 2 tage

33 Design an 8-to- mux with 2-to Muxes I I I I I I2 I3 I I I I I4 I I5 I I 2 I I6 I7 I I I 2

34 7.34 Cascading Muxes Use several small muxes to build large ones Rules. Arrange the muxes in stages (based on necessary number of inputs in st stage) 2. Outputs of one stage feed to inputs of the next until only final output 3. All muxes in a stage connect to the same group of select bits Usually, LB connects to first stage MB connect to last stage

35 7.35 Building a 4-to- Mux tage tage 2 D I Rule : Outputs from stage connect to inputs of stage 2 D I I I D 2 I D 3 I 4-to- mux built w/ 2-to- muxes Rule 2: LB connect to all muxes in first stage. MB connects to all muxes in second stage

36 7.36 Building a 4-to- Mux tage tage 2 D I D D D I I D 2 D 3 D 2 I I Walk through an example: D 3 I =

37 7.37 Building a 4-to- Mux tage tage 2 D I D D D 2 D I D I D 3 D 2 I D 3 I Walk through an example: = D 3 I = narrows our choices down to D and D 3

38 7.38 Building a 4-to- Mux tage tage 2 D I D D D I D I D 2 D D 3 D 2 I D 3 I Walk through an example: = D 3 I = selects our final choice, D

39 7.39 Exercise Create a 3-to- mux using 2-to- muxes Inputs: I, I, I2 and select bits, Output: I I D D I I D 2 I2 I I

7.1. Unit 7. Fundamental Digital Building Blocks: Decoders & Multiplexers

7.1. Unit 7. Fundamental Digital Building Blocks: Decoders & Multiplexers 7. Unit 7 Fundamental Digital Building Blocks: Decoders & Multiplexers CHECKER / DECODER 7.2 7.3 Gates Gates can have more than 2 inputs but the functions stay the same AND = output = if ALL inputs are

More information

8.1. Unit 8. Fundamental Digital Building Blocks: Decoders & Multiplexers

8.1. Unit 8. Fundamental Digital Building Blocks: Decoders & Multiplexers 8. Unit 8 Fundamental Digital Building Blocks: Decoders & Multiplexers 8.2 Checkers / Decoders Recall AND gates output '' for only a single combination OR gates output '' for only a single combination

More information

Unit 7. Gates. Checkers / Decoders. Fundamental Digital Building Blocks: Decoders & Multiplexers CHECKERS / DECODERS

Unit 7. Gates. Checkers / Decoders. Fundamental Digital Building Blocks: Decoders & Multiplexers CHECKERS / DECODERS 7. 7.2 Unit 7 undamental Digital Building Block: Decoder & Multipleer CHECKER / DECODER 7.3 7.4 Gate Gate can have more than 2 input but the function ta the ame ND = output = if LL input are Output for

More information

Chapter 3 Combinational Logic Design

Chapter 3 Combinational Logic Design Logic and Computer Design Fundamentals Chapter 3 Combinational Logic Design Part 2 Combinational Logic Overview Part -Implementation Technology and Logic Design Design Concepts Fundamental concepts of

More information

MSI Design Examples. Designing a circuit that adds three 4-bit numbers

MSI Design Examples. Designing a circuit that adds three 4-bit numbers MSI Design Examples In this lesson, you will see some design examples using MSI devices. These examples are: Designing a circuit that adds three 4-bit numbers. Design of a 4-to-16 Decoder using five 2-to-4

More information

Digital Logic and Design (Course Code: EE222) Lecture 14: Combinational Contd.. Decoders/Encoders

Digital Logic and Design (Course Code: EE222) Lecture 14: Combinational Contd.. Decoders/Encoders Indian Institute of Technology Jodhpur, Year 28 29 Digital Logic and Design (Course Code: EE222) Lecture 4: Combinational Contd.. Decoders/Encoders Course Instructor: Shree Prakash Tiwari Email: sptiwari@iitj.ac.in

More information

Chapter 3 Digital Logic Structures

Chapter 3 Digital Logic Structures Chapter 3 Digital Logic Structures Transistor: Building Block of Computers Microprocessors contain millions of transistors Intel Pentium 4 (2000): 48 million IBM PowerPC 750FX (2002): 38 million IBM/Apple

More information

Digital Logic Design ELCT 201

Digital Logic Design ELCT 201 Faculty of Information Engineering and Technology Dr. Haitham Omran and Dr. Wassim Alexan Digital Logic Design ELCT 201 Winter 2017 Midterm Exam Second Chance Please tick the box of your major: IET MET

More information

Solutions. ICS 151 Final. Q1 Q2 Q3 Q4 Total Credit Score. Instructions: Student ID. (Last Name) (First Name) Signature

Solutions. ICS 151 Final. Q1 Q2 Q3 Q4 Total Credit Score. Instructions: Student ID. (Last Name) (First Name) Signature ICS 151 Final Name Student ID Signature :, (Last Name) (First Name) : : Instructions: 1. Please verify that your paper contains 19 pages including this cover and 3 blank pages. 2. Write down your Student-Id

More information

ICS 151 Final. (Last Name) (First Name)

ICS 151 Final. (Last Name) (First Name) ICS 151 Final Name Student ID Signature :, (Last Name) (First Name) : : Instructions: 1. Please verify that your paper contains 19 pages including this cover and 3 blank pages. 2. Write down your Student-Id

More information

CHW 261: Logic Design

CHW 261: Logic Design CHW 6: Logic Design Instructors: Prof. Hala Zayed Dr. Ahmed Shalaby http://www.bu.edu.eg/staff/halazayed4 http://bu.edu.eg/staff/ahmedshalaby4# Slide Copyright 6 by Pearson Education, Inc. Upper Saddle

More information

CS/ECE 252: INTRODUCTION TO COMPUTER ENGINEERING UNIVERSITY OF WISCONSIN MADISON

CS/ECE 252: INTRODUCTION TO COMPUTER ENGINEERING UNIVERSITY OF WISCONSIN MADISON CS/ECE 252: INTRODUCTION TO COMPUTER ENGINEERING UNIVERSITY OF WISCONSIN MADISON Instructor: Andy Phelps TAs: Newsha Ardalani, Peter Ohmann, and Jai Menon Midterm Examination 2 In Class (50 minutes) Wednesday,

More information

COMBINATIONAL CIRCUIT

COMBINATIONAL CIRCUIT Combinational circuit is a circuit in which we combine the different gates in the circuit, for example encoder, decoder, multiplexer and demultiplexer. Some of the characteristics of combinational circuits

More information

Digital Electronics. Functions of Combinational Logic

Digital Electronics. Functions of Combinational Logic Digital Electronics Functions of Combinational Logic Half-dder Basic rules of binary addition are performed by a half adder, which has two binary inputs ( and B) and two binary outputs (Carry out and Sum).

More information

DIGITAL LOGIC CIRCUITS

DIGITAL LOGIC CIRCUITS LOGIC APPLICATIONS DIGITAL LOGIC CIRCUITS Noticed an analogy between the operations of switching devices, such as telephone switching circuits, and the operations of logical connectives What happens when

More information

Department of Electrical and Electronics Engineering Logic Circuits Laboratory EXPERIMENT-5 COMBINATIONAL LOGIC CIRCUITS

Department of Electrical and Electronics Engineering Logic Circuits Laboratory EXPERIMENT-5 COMBINATIONAL LOGIC CIRCUITS 5.1 Preliminary Study Simulate experiment using an available tool and prepare the preliminary report. 5.2 Aim of the Experiment Implementation and examination of MULTIPLEXER and DEMULTIPLEXER circuits

More information

Project Part 1 A. The task was to design a 4 to 1 multiplexer that uses 8 bit buses on the inputs with an output of a single 8 bit bus.

Project Part 1 A. The task was to design a 4 to 1 multiplexer that uses 8 bit buses on the inputs with an output of a single 8 bit bus. Project Part 1 A Circuit Description and Diagrams: The task was to design a 4 to 1 multiplexer that uses 8 bit buses on the inputs with an output of a single 8 bit bus. Shown below is a jpeg screenshot

More information

Combinational Logic Circuits. Combinational Logic

Combinational Logic Circuits. Combinational Logic Combinational Logic Circuits The outputs of Combinational Logic Circuits are only determined by the logical function of their current input state, logic 0 or logic 1, at any given instant in time. The

More information

Controller Implementation--Part I. Cascading Edge-triggered Flip-Flops

Controller Implementation--Part I. Cascading Edge-triggered Flip-Flops Controller Implementation--Part I Alternative controller FSM implementation approaches based on: Classical Moore and Mealy machines Time state: Divide and Counter Jump counters Microprogramming (ROM) based

More information

CSCI "Decoders & Demultiplexers"

CSCI Decoders & Demultiplexers CSCI 2150 -- "Decoders & Demultiplexers" Reading: Digital Fundamentals section 6.8 The Need for Decoders Digital signals are often used to enable something. For example, we've spoken in class of the basic

More information

COMPUTER TECHNOLOGY 2015/2016 Exercises. Unit 7

COMPUTER TECHNOLOGY 2015/2016 Exercises. Unit 7 COMPUTER TECHNOLOGY 05/06 Exercises. Unit 7 Test. Identify the function of the figure below: A F ABC+ ABC B F ABC+ AB+ ABC C Neither A nor B are true ) About the circuit of the figure below, tick the true

More information

Learning Outcomes. Spiral 2 3. DeMorgan Equivalents NEGATIVE (ACTIVE LO) LOGIC. Negative Logic One hot State Assignment System Design Examples

Learning Outcomes. Spiral 2 3. DeMorgan Equivalents NEGATIVE (ACTIVE LO) LOGIC. Negative Logic One hot State Assignment System Design Examples 2-3. Learning Outcomes 2-3.2 Spiral 2 3 Negative Logic One hot State Assignment System Design Examples I understand the active low signal convention and how to interface circuits that use both active high

More information

16 Multiplexers and De-multiplexers using gates and ICs. (74150, 74154)

16 Multiplexers and De-multiplexers using gates and ICs. (74150, 74154) 16 Multiplexers and De-multiplexers using gates and ICs. (74150, 74154) Aim: To design multiplexers and De-multiplexers using gates and ICs. (74150, 74154) Components required: Digital IC Trainer kit,

More information

Topic Notes: Digital Logic

Topic Notes: Digital Logic Computer Science 220 Assembly Language & Comp. Architecture Siena College Fall 20 Topic Notes: Digital Logic Our goal for the next couple of weeks is to gain a reasonably complete understanding of how

More information

(CSC-3501) Lecture 6 (31 Jan 2008) Seung-Jong Park (Jay) CSC S.J. Park. Announcement

(CSC-3501) Lecture 6 (31 Jan 2008) Seung-Jong Park (Jay)   CSC S.J. Park. Announcement Seung-Jong Park (Jay) http://www.csc.lsu.edu/~sjpark Computer Architecture (CSC-3501) Lecture 6 (31 Jan 2008) 1 Announcement 2 1 Reminder A logic circuit is composed of: Inputs Outputs Functional specification

More information

Memory, Latches, & Registers

Memory, Latches, & Registers Memory, Latches, & Registers 1) Structured Logic Arrays 2) Memory Arrays 3) Transparent Latches 4) Saving a few bucks at toll booths 5) Edge-triggered Registers Friday s class will be a lecture rather

More information

LOGIC DIAGRAM: HALF ADDER TRUTH TABLE: A B CARRY SUM. 2012/ODD/III/ECE/DE/LM Page No. 1

LOGIC DIAGRAM: HALF ADDER TRUTH TABLE: A B CARRY SUM. 2012/ODD/III/ECE/DE/LM Page No. 1 LOGIC DIAGRAM: HALF ADDER TRUTH TABLE: A B CARRY SUM K-Map for SUM: K-Map for CARRY: SUM = A B + AB CARRY = AB 22/ODD/III/ECE/DE/LM Page No. EXPT NO: DATE : DESIGN OF ADDER AND SUBTRACTOR AIM: To design

More information

CS 61C: Great Ideas in Computer Architecture Finite State Machines, Functional Units

CS 61C: Great Ideas in Computer Architecture Finite State Machines, Functional Units CS 61C: Great Ideas in Computer Architecture Finite State Machines, Functional Units Instructors: Vladimir Stojanovic and Nicholas Weaver http://inst.eecs.berkeley.edu/~cs61c/sp16 1 Machine Interpretation

More information

SRV ENGINEERING COLLEGE SEMBODAI RUKMANI VARATHARAJAN ENGINEERING COLLEGE SEMBODAI

SRV ENGINEERING COLLEGE SEMBODAI RUKMANI VARATHARAJAN ENGINEERING COLLEGE SEMBODAI SEMBODAI RUKMANI VARATHARAJAN ENGINEERING COLLEGE SEMBODAI 6489 (Approved By AICTE,Newdelhi Affiliated To ANNA UNIVERSITY::Chennai) CS 62 DIGITAL ELECTRONICS LAB (REGULATION-23) LAB MANUAL DEPARTMENT OF

More information

4:Combinational logic circuits. 3 July

4:Combinational logic circuits. 3 July 4:Combinational logic circuits 3 July 2014 1 overview What is combinational logic circuit? Examples of combinational logic circuits Binary-adder Binary-subtractor Binary-multiplier Decoders Multiplexers

More information

Unit 3. Logic Design

Unit 3. Logic Design EE 2: Digital Logic Circuit Design Dr Radwan E Abdel-Aal, COE Logic and Computer Design Fundamentals Unit 3 Chapter Combinational 3 Combinational Logic Logic Design - Introduction to Analysis & Design

More information

Function Table of 74LS138, 3-to-8 Decoder +5V 6 G1 4 G2A 5 G2B. 4-to-16 Decoder using two 74LS139, 3-to-8 Decoder

Function Table of 74LS138, 3-to-8 Decoder +5V 6 G1 4 G2A 5 G2B. 4-to-16 Decoder using two 74LS139, 3-to-8 Decoder CS0 Digital Logic Design The XX8 -to-8 Decoder The -to-8, XX8 Decoder is also commonly used in logical circuits. Similar, to the -to- Decoder, the -to-8 Decoder has active-low outputs and three extra NOT

More information

Combinational Circuits DC-IV (Part I) Notes

Combinational Circuits DC-IV (Part I) Notes Combinational Circuits DC-IV (Part I) Notes Digital Circuits have been classified as: (a) Combinational Circuits: In these circuits output at any instant of time depends on inputs present at that instant

More information

E-Tec Module Part No

E-Tec Module Part No E-Tec Module Part No.108227 1. Additional programs for the fischertechnik Electronics Module For fans of digital technology, these additional functions are provided in the "E-Tec module". Four additional

More information

Memory, Latches, & Registers

Memory, Latches, & Registers Memory, Latches, & Registers 1) Structured Logic Arrays 2) Memory Arrays 3) Transparent Latches 4) Saving a few bucks at toll booths 5) Edge-triggered Registers 1 General Table Lookup Synthesis A B 00

More information

GATE Online Free Material

GATE Online Free Material Subject : Digital ircuits GATE Online Free Material 1. The output, Y, of the circuit shown below is (a) AB (b) AB (c) AB (d) AB 2. The output, Y, of the circuit shown below is (a) 0 (b) 1 (c) B (d) A 3.

More information

Basics of Analog Multiplexers 1. Exercises TI Precision Labs Op Amps

Basics of Analog Multiplexers 1. Exercises TI Precision Labs Op Amps Basics of Analog Multiplexers 1 Exercises TI Precision Labs Op Amps 1 VSS VDD 1. In the circuit below, one of the input channels of the MUX36S08 is fed with a 2V p-p sinewave signal. The output of the

More information

Lecture 02: Digital Logic Review

Lecture 02: Digital Logic Review CENG 3420 Lecture 02: Digital Logic Review Bei Yu byu@cse.cuhk.edu.hk CENG3420 L02 Digital Logic. 1 Spring 2017 Review: Major Components of a Computer CENG3420 L02 Digital Logic. 2 Spring 2017 Review:

More information

Combinational Circuits: Multiplexers, Decoders, Programmable Logic Devices

Combinational Circuits: Multiplexers, Decoders, Programmable Logic Devices Combinational Circuits: Multiplexers, Decoders, Programmable Logic Devices Lecture 5 Doru Todinca Textbook This chapter is based on the book [RothKinney]: Charles H. Roth, Larry L. Kinney, Fundamentals

More information

UNIT-IV Combinational Logic

UNIT-IV Combinational Logic UNIT-IV Combinational Logic Introduction: The signals are usually represented by discrete bands of analog levels in digital electronic circuits or digital electronics instead of continuous ranges represented

More information

LIST OF EXPERIMENTS. KCTCET/ /Odd/3rd/ETE/CSE/LM

LIST OF EXPERIMENTS. KCTCET/ /Odd/3rd/ETE/CSE/LM LIST OF EXPERIMENTS. Study of logic gates. 2. Design and implementation of adders and subtractors using logic gates. 3. Design and implementation of code converters using logic gates. 4. Design and implementation

More information

FUNCTION OF COMBINATIONAL LOGIC CIRCUIT

FUNCTION OF COMBINATIONAL LOGIC CIRCUIT HAPTER FUNTION OF OMBINATIONAL LOGI IRUIT OUTLINE HALF-ADDER ANF FULL ADDER IRUIT -BIT PARALLEL BINARY RIPPLE ARRY ADDER -BIT PARALLEL BINARY ARRY LOOK- AHEAD ADDER BD ADDER IRUIT DEODER ENODER MULTIPLEXER

More information

IES Digital Mock Test

IES Digital Mock Test . The circuit given below work as IES Digital Mock Test - 4 Logic A B C x y z (a) Binary to Gray code converter (c) Binary to ECESS- converter (b) Gray code to Binary converter (d) ECESS- To Gray code

More information

COMPUTER ORGANIZATION & ARCHITECTURE DIGITAL LOGIC CSCD211- DEPARTMENT OF COMPUTER SCIENCE, UNIVERSITY OF GHANA

COMPUTER ORGANIZATION & ARCHITECTURE DIGITAL LOGIC CSCD211- DEPARTMENT OF COMPUTER SCIENCE, UNIVERSITY OF GHANA COMPUTER ORGANIZATION & ARCHITECTURE DIGITAL LOGIC LOGIC Logic is a branch of math that tries to look at problems in terms of being either true or false. It will use a set of statements to derive new true

More information

2 Building Blocks. There is often the need to compare two binary values.

2 Building Blocks. There is often the need to compare two binary values. 2 Building Blocks 2.1 Comparators There is often the need to compare two binary values. This is done using a comparator. A comparator determines whether binary values A and B are: 1. A = B 2. A < B 3.

More information

5. (Adapted from 3.25)

5. (Adapted from 3.25) Homework02 1. According to the following equations, draw the circuits and write the matching truth tables.the circuits can be drawn either in transistor-level or symbols. a. X = NOT (NOT(A) OR (A AND B

More information

LOGIC GATES AND LOGIC CIRCUITS A logic gate is an elementary building block of a Digital Circuit. Most logic gates have two inputs and one output.

LOGIC GATES AND LOGIC CIRCUITS A logic gate is an elementary building block of a Digital Circuit. Most logic gates have two inputs and one output. LOGIC GATES AND LOGIC CIRCUITS A logic gate is an elementary building block of a Digital Circuit. Most logic gates have two inputs and one output. At any given moment, every terminal is in one of the two

More information

Combinational logic. ! Regular logic: multiplexers, decoders, LUTs and FPGAs. ! Switches, basic logic and truth tables, logic functions

Combinational logic. ! Regular logic: multiplexers, decoders, LUTs and FPGAs. ! Switches, basic logic and truth tables, logic functions Combinational logic! Switches, basic logic and truth tables, logic functions! Algebraic expressions to gates! Mapping to different gates! Discrete logic gate components (used in labs and 2)! Canonical

More information

Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Computing Layers

Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Computing Layers Chapter 3 Digital Logic Structures Original slides from Gregory Byrd, North Carolina State University Modified by Chris Wilcox, Sanjay Rajopadhye Colorado State University Computing Layers Problems Algorithms

More information

EE283 Electrical Measurement Laboratory Laboratory Exercise #7: Digital Counter

EE283 Electrical Measurement Laboratory Laboratory Exercise #7: Digital Counter EE283 Electrical Measurement Laboratory Laboratory Exercise #7: al Counter Objectives: 1. To familiarize students with sequential digital circuits. 2. To show how digital devices can be used for measurement

More information

Department of Electronics and Communication Engineering

Department of Electronics and Communication Engineering Department of Electronics and Communication Engineering Sub Code/Name: BEC3L2- DIGITAL ELECTRONICS LAB Name Reg No Branch Year & Semester : : : : LIST OF EXPERIMENTS Sl No Experiments Page No Study of

More information

Lecture 6: Electronics Beyond the Logic Switches Xufeng Kou School of Information Science and Technology ShanghaiTech University

Lecture 6: Electronics Beyond the Logic Switches Xufeng Kou School of Information Science and Technology ShanghaiTech University Lecture 6: Electronics Beyond the Logic Switches Xufeng Kou School of Information Science and Technology ShanghaiTech University EE 224 Solid State Electronics II Lecture 3: Lattice and symmetry 1 Outline

More information

Experiment # 4. Binary Addition & Subtraction. Eng. Waleed Y. Mousa

Experiment # 4. Binary Addition & Subtraction. Eng. Waleed Y. Mousa Experiment # 4 Binary Addition & Subtraction Eng. Waleed Y. Mousa 1. Objectives: 1. To study adder and subtractor circuits using logic gates. 2. To construct and test various adders and subtractor circuits.

More information

Synthesis of Combinational Logic

Synthesis of Combinational Logic Synthesis of ombinational Logic 6.4 Gates F = xor Handouts: Lecture Slides, PS3, Lab2 6.4 - Spring 2 2/2/ L5 Logic Synthesis Review: K-map Minimization ) opy truth table into K-Map 2) Identify subcubes,

More information

Final Project Report 4-bit ALU Design

Final Project Report 4-bit ALU Design ECE 467 Final Project Report 4-bit ALU Design Fall 2013 Kai Zhao Aswin Gonzalez Sepideh Roghanchi Soroush Khaleghi Part 1) Final ALU Design: There are 6 different functions implemented in this ALU: 1)

More information

Lecture 8: Memory Peripherals

Lecture 8: Memory Peripherals Digital Integrated Circuits (83-313) Lecture 8: Memory Peripherals Semester B, 2016-17 Lecturer: Dr. Adam Teman TAs: Itamar Levi, Robert Giterman 20 May 2017 Disclaimer: This course was prepared, in its

More information

Digital Electronics 8. Multiplexer & Demultiplexer

Digital Electronics 8. Multiplexer & Demultiplexer 1 Module -8 Multiplexers and Demultiplexers 1 Introduction 2 Principles of Multiplexing and Demultiplexing 3 Multiplexer 3.1 Types of multiplexer 3.2 A 2 to 1 multiplexer 3.3 A 4 to 1 multiplexer 3.4 Multiplex

More information

Feasibility of a multifunctional morphological system for use on field programmable gate arrays

Feasibility of a multifunctional morphological system for use on field programmable gate arrays Journal of Physics: Conference Series Feasibility of a multifunctional morphological system for use on field programmable gate arrays To cite this article: A J Tickle et al 2007 J. Phys.: Conf. Ser. 76

More information

Combinational Logic. Combinational Logic Design Process, Three State Buffers, Decoders, Multiplexers, Encoders, Demultiplexers, Other Considerations

Combinational Logic. Combinational Logic Design Process, Three State Buffers, Decoders, Multiplexers, Encoders, Demultiplexers, Other Considerations Combinational Logic Combinational Logic Design Process, Three State Buffers, Decoders, Multiplexers, Encoders, Demultiplexers, Other Considerations Copyright (c) 2012 Sean Key Combinational Logic Design

More information

Datapath Components. Multipliers, Counters, Timers, Register Files

Datapath Components. Multipliers, Counters, Timers, Register Files Datapath Components Multipliers, Counters, Timers, Register Files Multipliers An N x N multiplier Multiplies two N bit binary inputs Generates an NN bit result Creating a multiplier using two-level logic

More information

Logic Circuit Design

Logic Circuit Design Logic Circuit Design we have studied Truth Tables Logic gates Logic algebra K-maps 1 All these are tools Tools Truth Tables Logic gates Logic algebra K-maps 2 All these are tools Tools Truth Tables Logic

More information

Chapter 3. H/w s/w interface. hardware software Vijaykumar ECE495K Lecture Notes: Chapter 3 1

Chapter 3. H/w s/w interface. hardware software Vijaykumar ECE495K Lecture Notes: Chapter 3 1 Chapter 3 hardware software H/w s/w interface Problems Algorithms Prog. Lang & Interfaces Instruction Set Architecture Microarchitecture (Organization) Circuits Devices (Transistors) Bits 29 Vijaykumar

More information

Fan in: The number of inputs of a logic gate can handle.

Fan in: The number of inputs of a logic gate can handle. Subject Code: 17333 Model Answer Page 1/ 29 Important Instructions to examiners: 1) The answers should be examined by key words and not as word-to-word as given in the model answer scheme. 2) The model

More information

A CASE STUDY OF CARRY SKIP ADDER AND DESIGN OF FEED-FORWARD MECHANISM TO IMPROVE THE SPEED OF CARRY CHAIN

A CASE STUDY OF CARRY SKIP ADDER AND DESIGN OF FEED-FORWARD MECHANISM TO IMPROVE THE SPEED OF CARRY CHAIN Volume 117 No. 17 2017, 91-99 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu A CASE STUDY OF CARRY SKIP ADDER AND DESIGN OF FEED-FORWARD MECHANISM

More information

Digital Applications (CETT 1415) Credit: 4 semester credit hours (3 hours lecture, 4 hours lab) Prerequisite: CETT 1403 & CETT 1405

Digital Applications (CETT 1415) Credit: 4 semester credit hours (3 hours lecture, 4 hours lab) Prerequisite: CETT 1403 & CETT 1405 Digital Applications () Credit: 4 semester credit hours (3 hours lecture, 4 hours lab) Prerequisite: CETT 1403 & CETT 1405 Course Description This course covers digital techniques and numbering systems,

More information

Table of contents. Game manual. Dear Julius 4. Keyboard controls 5. Controller controls 6. katsh# controls 7. User interface 8.

Table of contents. Game manual. Dear Julius 4. Keyboard controls 5. Controller controls 6. katsh# controls 7. User interface 8. I + I.. l l Table of contents Dear Julius 4 Keyboard controls 5 Controller controls 6 katsh# controls 7 User interface 8 Tiles 9 Logic operations 15 3 From: KT at 0x500A92A9C To: Julius Leopold 1.42 rev.

More information

Communications I (ELCN 306)

Communications I (ELCN 306) Communications I (ELCN 306) c Samy S. Soliman Electronics and Electrical Communications Engineering Department Cairo University, Egypt Email: samy.soliman@cu.edu.eg Website: http://scholar.cu.edu.eg/samysoliman

More information

Understanding Engineers #2

Understanding Engineers #2 Understanding Engineers #! The graduate with a Science degree asks, "Why does it work?"! The graduate with an Engineering degree asks, "How does it work?"! The graduate with an Accounting degree asks,

More information

Laboratory Manual CS (P) Digital Systems Lab

Laboratory Manual CS (P) Digital Systems Lab Laboratory Manual CS 09 408 (P) Digital Systems Lab INDEX CYCLE I A. Familiarization of digital ICs and digital IC trainer kit 1 Verification of truth tables B. Study of combinational circuits 2. Verification

More information

Introduction (concepts and definitions)

Introduction (concepts and definitions) Objectives: Introduction (digital system design concepts and definitions). Advantages and drawbacks of digital techniques compared with analog. Digital Abstraction. Synchronous and Asynchronous Systems.

More information

DIGITAL INTEGRATED CIRCUITS A DESIGN PERSPECTIVE 2 N D E D I T I O N

DIGITAL INTEGRATED CIRCUITS A DESIGN PERSPECTIVE 2 N D E D I T I O N DIGITAL INTEGRATED CIRCUITS A DESIGN PERSPECTIVE 2 N D E D I T I O N Jan M. Rabaey, Anantha Chandrakasan, and Borivoje Nikolic CONTENTS PART I: THE FABRICS Chapter 1: Introduction (32 pages) 1.1 A Historical

More information

R.B.V.R.R. WOMEN S COLLEGE (AUTONOMOUS) Narayanaguda, Hyderabad. ELECTRONIC PRINCIPLES AND APPLICATIONS

R.B.V.R.R. WOMEN S COLLEGE (AUTONOMOUS) Narayanaguda, Hyderabad. ELECTRONIC PRINCIPLES AND APPLICATIONS R.B.V.R.R. WOMEN S COLLEGE (AUTONOMOUS) Narayanaguda, Hyderabad. DEPARTMENT OF PHYSICS QUESTION BANK FOR SEMESTER V PHYSICS PAPER VI (A) ELECTRONIC PRINCIPLES AND APPLICATIONS UNIT I: SEMICONDUCTOR DEVICES

More information

SHF Communication Technologies AG

SHF Communication Technologies AG SHF Communication Technologies AG Wilhelm-von-Siemens-Str. 23 Aufgang D 12277 Berlin Marienfelde Germany Phone ++49 30 / 772 05 10 Fax ++49 30 / 753 10 78 E-Mail: sales@shf.biz Web: http://www.shf.biz

More information

Chapter 3 Digital Logic Structures

Chapter 3 Digital Logic Structures Chapter 3 Digital Logic Structures Transistor: Building Block of Computers Microprocessors contain millions of transistors Intel Pentium 4 (2): 48 million IBM PowerPC 75FX (22): 38 million IBM/Apple PowerPC

More information

Elektrische Parameter Grundlagen der technischen Informatik

Elektrische Parameter Grundlagen der technischen Informatik Elektrische Parameter Grundlagen der technischen Informatik Wintersemester 28/9 Folien basierend auf F. Vahid und S. Werner Wintersemester 28/9 Review - Multiple-Output Circuits Many circuits have more

More information

Department of Electronics & Telecommunication Engg. LAB MANUAL. B.Tech V Semester [ ] (Branch: ETE)

Department of Electronics & Telecommunication Engg. LAB MANUAL. B.Tech V Semester [ ] (Branch: ETE) Department of Electronics & Telecommunication Engg. LAB MANUAL SUBJECT:-DIGITAL COMMUNICATION SYSTEM [BTEC-501] B.Tech V Semester [2013-14] (Branch: ETE) KCT COLLEGE OF ENGG & TECH., FATEHGARH PUNJAB TECHNICAL

More information

FIRSTRANKER. 1. (a) What are the advantages of the adjustable voltage regulators over the fixed

FIRSTRANKER. 1. (a) What are the advantages of the adjustable voltage regulators over the fixed Code No: 07A51102 R07 Set No. 2 1. (a) What are the advantages of the adjustable voltage regulators over the fixed voltage regulators. (b) Differentiate betweenan integrator and a differentiator. [8+8]

More information

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad 1 P a g e INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad - 500 043 ELECTRONICS AND COMMUNICATION ENGINEERING TUTORIAL QUESTION BANK Name : INTEGRATED CIRCUITS APPLICATIONS Code

More information

14:332:231 DIGITAL LOGIC DESIGN. Gate Delays

14:332:231 DIGITAL LOGIC DESIGN. Gate Delays 4:332:23 DIGITAL LOGIC DESIGN Ivan Marsic, Rutgers University Electrical & Computer Engineering all 23 Lecture #8: Timing Hazards Gate Delays hen the input to a logic gate is changed, the output will not

More information

E2.11/ISE2.22 Digital Electronics II

E2.11/ISE2.22 Digital Electronics II E./ISE. Digital Electronics II Problem Sheet 4 (Question ratings: A=Easy,, E=Hard. All students should do questions rated A, B or C as a minimum) B. Say which of the following state diagrams denote the

More information

LOGIC MODULES INTRODUCTION

LOGIC MODULES INTRODUCTION INTRODUCTION With littlebits logic modules, you can program in block form. The logic modules create rules for your circuit to follow, giving you more ability to create interesting and complex interactions.

More information

Logic Design I (17.341) Fall Lecture Outline

Logic Design I (17.341) Fall Lecture Outline Logic Design I (17.341) Fall 2011 Lecture Outline Class # 07 October 31, 2011 / November 07, 2011 Dohn Bowden 1 Today s Lecture Administrative Main Logic Topic Homework 2 Course Admin 3 Administrative

More information

Computer Architecture and Organization:

Computer Architecture and Organization: Computer Architecture and Organization: L03: Register transfer and System Bus By: A. H. Abdul Hafez Abdul.hafez@hku.edu.tr, ah.abdulhafez@gmail.com 1 CAO, by Dr. A.H. Abdul Hafez, CE Dept. HKU Outlines

More information

Exam #2 EE 209: Fall 2017

Exam #2 EE 209: Fall 2017 29 November 2017 Exam #2 EE 209: Fall 2017 Name: USCid: Session: Time: MW 10:30 11:50 / TH 11:00 12:20 (circle one) 1 hour 50 minutes Possible Score 1. 27 2. 28 3. 17 4. 16 5. 22 TOTAL 110 PERFECT 100

More information

RISC Central Processing Unit

RISC Central Processing Unit RISC Central Processing Unit Lan-Da Van ( 范倫達 ), Ph. D. Department of Computer Science National Chiao Tung University Taiwan, R.O.C. Spring, 2014 ldvan@cs.nctu.edu.tw http://www.cs.nctu.edu.tw/~ldvan/

More information

DESIGN AND IMPLEMENTATION OF AREA EFFICIENT, LOW-POWER AND HIGH SPEED 128-BIT REGULAR SQUARE ROOT CARRY SELECT ADDER

DESIGN AND IMPLEMENTATION OF AREA EFFICIENT, LOW-POWER AND HIGH SPEED 128-BIT REGULAR SQUARE ROOT CARRY SELECT ADDER DESIGN AND IMPLEMENTATION OF AREA EFFICIENT, LOW-POWER AND HIGH SPEED 128-BIT REGULAR SQUARE ROOT CARRY SELECT ADDER MURALIDHARAN.R [1],AVINASH.P.S.K [2],MURALI KRISHNA.K [3],POOJITH.K.C [4], ELECTRONICS

More information

(a) (b) (c) (d) (e) (a) (b) (c) (d) (e)

(a) (b) (c) (d) (e) (a) (b) (c) (d) (e) Exercises 97 Exercises Exercise 2. Write a oolean equation in sum-of-products canonical form for each of the truth tables in Figure 2.8. (d) (e) C C C D Figure 2.8 Truth tables for Exercises 2. and 2.3

More information

EECS-140/141 Introduction to Digital Logic Design Lecture 7:Sequential Logic Basics

EECS-140/141 Introduction to Digital Logic Design Lecture 7:Sequential Logic Basics EECS-140/141 Introduction to Digital Logic Design Lecture 7:Sequential Logic Basics I. OVERVIEW I.A Combinational vs. Sequential Logic Combinational Logic (everything so far): Outputs depend entirely on

More information

Design and Implementation of Complex Multiplier Using Compressors

Design and Implementation of Complex Multiplier Using Compressors Design and Implementation of Complex Multiplier Using Compressors Abstract: In this paper, a low-power high speed Complex Multiplier using compressor circuit is proposed for fast digital arithmetic integrated

More information

EE 42/100 Lecture 24: Latches and Flip Flops. Rev B 4/21/2010 (2:04 PM) Prof. Ali M. Niknejad

EE 42/100 Lecture 24: Latches and Flip Flops. Rev B 4/21/2010 (2:04 PM) Prof. Ali M. Niknejad A. M. Niknejad University of California, Berkeley EE 100 / 42 Lecture 24 p. 1/21 EE 42/100 Lecture 24: Latches and Flip Flops ELECTRONICS Rev B 4/21/2010 (2:04 PM) Prof. Ali M. Niknejad University of California,

More information

Exercises: Fundamentals of Computer Engineering 1 PAGE: 1

Exercises: Fundamentals of Computer Engineering 1 PAGE: 1 Exercises: Fundamentals of Computer Engineering PAGE: Exercise Minimise the following using the laws of Boolean algebra. f = a + ab + ab.2 f ( ) ( ) ( ) 2 = c bd + bd + ac b + d + cd a + b + ad( b + c)

More information

A REVIEW ON 4 BIT FLASH ANALOG TO DIGITAL CONVERTOR

A REVIEW ON 4 BIT FLASH ANALOG TO DIGITAL CONVERTOR RESEARCH ARTICLE OPEN ACCESS A REVIEW ON 4 BIT FLASH ANALOG TO DIGITAL CONVERTOR Vijay V. Chakole 1, Prof. S. R. Vaidya 2, Prof. M. N. Thakre 3 1 MTech Scholar, S. D. College of Engineering, Selukate,

More information

Lecture 3: Logic circuit. Combinational circuit and sequential circuit

Lecture 3: Logic circuit. Combinational circuit and sequential circuit Lecture 3: Logic circuit Combinational circuit and sequential circuit TRAN THI HONG HONG@IS.NAIST.JP Content Lecture : Computer organization and performance evaluation metrics Lecture 2: Processor architecture

More information

COMBINATIONAL LOGIC CIRCUIT First Class. Dr. AMMAR ABDUL-HAMED KHADER

COMBINATIONAL LOGIC CIRCUIT First Class. Dr. AMMAR ABDUL-HAMED KHADER COMBINATIONAL LOGIC CIRCUIT First Class 1 BASIC ADDER Adders are important in computers and also in other types of digital system in which numerical data are processed. An understanding of the basic operation

More information

Lecture 9: Clocking for High Performance Processors

Lecture 9: Clocking for High Performance Processors Lecture 9: Clocking for High Performance Processors Computer Systems Lab Stanford University horowitz@stanford.edu Copyright 2001 Mark Horowitz EE371 Lecture 9-1 Horowitz Overview Reading Bailey Stojanovic

More information

IF ID EX MEM WB 400 ps 225 ps 350 ps 450 ps 300 ps

IF ID EX MEM WB 400 ps 225 ps 350 ps 450 ps 300 ps CSE 30321 Computer Architecture I Fall 2010 Homework 06 Pipelined Processors 85 points Assigned: November 2, 2010 Due: November 9, 2010 PLEASE DO THE ASSIGNMENT ON THIS HANDOUT!!! Problem 1: (25 points)

More information

Mapping Multiplexers onto Hard Multipliers in FPGAs

Mapping Multiplexers onto Hard Multipliers in FPGAs Mapping Multiplexers onto Hard Multipliers in FPGAs Peter Jamieson and Jonathan Rose The Edward S. Rogers Sr. Department of Electrical and Computer Engineering University of Toronto Modern FPGAs Consist

More information

Sticks Diagram & Layout. Part II

Sticks Diagram & Layout. Part II Sticks Diagram & Layout Part II Well and Substrate Taps Substrate must be tied to GND and n-well to V DD Metal to lightly-doped semiconductor forms poor connection called Shottky Diode Use heavily doped

More information

CS 110 Computer Architecture Lecture 11: Pipelining

CS 110 Computer Architecture Lecture 11: Pipelining CS 110 Computer Architecture Lecture 11: Pipelining Instructor: Sören Schwertfeger http://shtech.org/courses/ca/ School of Information Science and Technology SIST ShanghaiTech University Slides based on

More information

Combinatorial Logic Design Multiplexers and ALUs CS 64: Computer Organization and Design Logic Lecture #14

Combinatorial Logic Design Multiplexers and ALUs CS 64: Computer Organization and Design Logic Lecture #14 Combinatorial Logic Design Multiplexers and ALUs CS 64: Computer Organization and Design Logic Lecture #14 Ziad Matni Dept. of Computer Science, UCSB Administrative Remaining on the calendar This supersedes

More information