Mu.com.lec 11.  Used not only to perform addition but also to perform subtraction, multiplication and division  The most basic of the adders is the.

Slides:



Advertisements
Similar presentations
컴퓨터구조론 교수 채수환. 교재 Computer Systems Organization & Architecture John D. Carpinelli, 2001, Addison Wesley.
Advertisements

Princess Sumaya University
Modular Combinational Logic
Combinational Circuits
Combinational Circuits
Functions and Functional Blocks
Class Exercise 1A.
1 KU College of Engineering Elec 204: Digital Systems Design Lecture 9 Programmable Configurations Read Only Memory (ROM) – –a fixed array of AND gates.
Number Bases Informatics INFO I101 February 9, 2004 John C. Paolillo, Instructor.
Overview Part 2 – Combinational Logic
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 3 – Combinational Logic Design Part 2 –

DIGITAL SYSTEMS TCE OTHER COMBINATIONAL LOGIC CIRCUITS DECODERS ENCODERS.
Digital Logic Design Lecture 19. Announcements Homework 6 due Thursday 11/6 Recitation quiz on Monday, 11/10 – Will cover material from lectures 18,19,20.
Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F F = x + y’z x y z F Truth Table Boolean Function.
Logic Gates Combinational Circuits
 Arithmetic circuit  Addition  Subtraction  Division  Multiplication.
Shannon’s Expansion Muxes and Encoders. Tri-State Buffers  A tri-state buffer has one input x, one output f and one control line e Z means high impedance,
Outline Decoder Encoder Mux. Decoder Accepts a value and decodes it Output corresponds to value of n inputs Consists of: Inputs (n) Outputs (2 n, numbered.
Top-down modular design
Combinational Logic Design
Logical Circuit Design Week 8: Arithmetic Circuits Mentor Hamiti, MSc Office ,
ECE 3130 – Digital Electronics and Design
Digital Logic Fundamentals CT101 – Computing Systems.
Documentation Standards Circuit specification. –Description of what the system is supposed to do, including a description of all inputs and outputs and.
Combinational Design, Part 3: Functional Blocks
CHAPTER 4 Combinational Logic
1 Tutorial: ITI1100 Dewan Tanvir Ahmed SITE, UofO.
ES 244: Digital Logic Design Chapter 4 Chapter 4: Combinational Logic Uchechukwu Ofoegbu Temple University.
CS 105 DIGITAL LOGIC DESIGN Chapter 4 Combinational Logic 1.
BR 8/991 Combinational Building Blocks 2/1 Multiplexor (MUX) I0 I1 Y S if S = 0, then Y = I0 if S = 1, then Y = I1 Y = I0 S’ + I1 S I0 I1 Y S A[3:0] B[3:0]
CS151 Introduction to Digital Design
Digital Logic Fundamentals & CLC Review
CEC 220 Digital Circuit Design Timing Diagrams, MUXs, and Buffers Mon, Oct 5 CEC 220 Digital Circuit Design Slide 1 of 20.
CEC 220 Digital Circuit Design Timing Diagrams, MUXs, and Buffers Friday, February 14 CEC 220 Digital Circuit Design Slide 1 of 18.
CEC 220 Digital Circuit Design Timing Diagrams, MUXs, and Buffers
Combinational Circuits by Dr. Amin Danial Asham. References  Digital Design 5 th Edition, Morris Mano.
1 Chapter 4 Combinational Logic Logic circuits for digital systems may be combinational or sequential. A combinational circuit consists of input variables,
Appendix C Basics of Digital Logic Part I. Florida A & M University - Department of Computer and Information Sciences Modern Computer Digital electronics.
ECE 320 Homework #4 1. Using 8 data input selector logic (MUX), implement the following two functions: a) F(A,B,C)=S 0 S 2 S 3 S 5 b) F(A,B,C,D)=P 0 +P.
1 Fundamentals of Computer Science Combinational Circuits.
1 ECE 545—Digital System Design with VHDL Lecture 1 Digital Logic Refresher Part A – Combinational Logic Building Blocks.
1 Combinational Logic EE 208 – Logic Design Chapter 4 Sohaib Majzoub.
Module 11.  In Module 9, we have been introduced to the concept of combinational logic circuits through the examples of binary adders.  Meanwhile, in.
Chapter 3 Digital Logic Structures
Digital Design Lecture 8 Combinatorial Logic (Continued)
Digital Design Module 2 Decoder Amit Kumar AP SCSE, GU Greater Noida.
1 DLD Lecture 16 More Multiplexers, Encoders and Decoders.
ECE DIGITAL LOGIC LECTURE 15: COMBINATIONAL CIRCUITS Assistant Prof. Fareena Saqib Florida Institute of Technology Fall 2015, 10/20/2015.
Multiplexer.
Discrete Systems I Lecture 10 Adder and ALU Profs. Koike and Yukita.
1 The ALU l ALU includes combinational logic. –Combinational logic  a change in inputs directly causes a change in output, after a characteristic delay.
MSI Circuits.
Combinational Circuits
ECE 3130 Digital Electronics and Design
ECE 3130 Digital Electronics and Design
Combinational Logic Circuits
Combinational Logic Logic circuits for digital systems may be combinational or sequential. A combinational circuit consists of input variables, logic gates,
Combinational Circuit Design
Combinational Logic Circuits
FUNCTION OF COMBINATIONAL LOGIC CIRCUIT
Chapter 6 Functions of Combinational Logic
Combinatorial Logic Design Practices
FIGURE 4.1 Block diagram of combinational circuit
COMS 361 Computer Organization
Combinational Circuits
Digital System Design Combinational Logic
Computer Architecture
Presentation transcript:

Mu.com.lec 11

 Used not only to perform addition but also to perform subtraction, multiplication and division  The most basic of the adders is the half adder  Inputs two 1-bit value, x and y, and outputs their 2-bit sum as bits C and S  Bit C is the carry and bit S is the sum

In real world, circuits that perform addition are more than 1 bit wide A wider than 1 bit adder can’t use this circuit, because there is no way to input carry information from the previous bits

 Three inputs:  Two data inputs  One carry input  Same outputs as the half adder  Functions

 With the carry input, full adders can be cascaded to produce an n bit adder by connecting output C from one adder to input Cin of the next adder  Such an adder is called Ripple adder (because the bits ripple through the adder). Consider the worst case scenario (X=1111 and Y=0001) and follow the carry through the circuit  A four bit ripple adder is presented

 Regular buffer - The regular buffers always passes the input to the output, its purpose being to boost the current of the input to a higher level. When implemented in circuitry, the Boolean values 0 and 1 have specific voltage and current values; buffers maintain those values to ensure that the system performs properly  Of course, a buffer will introduce a delay (as any other gate), known as propagation time through buffers. If they are not used wisely, they can be a dangerous source of hazard in digital logic circuits inout 00 11

 The tri-state buffer: it has a data input, just like regular buffers, but also has an ENABLE input.  If ENB=1 then the buffer is enabled and the input is passed directly to the output  if ENB=0, the buffer is disabled. Regardless of the input (represented by a don’t care value X in the truth table), the output is a high impedance state, Z. The tri-state buffer can also have an inverted enable signal  High Impedance State: I = V/R (Ohm Law) if R (impedance) -> very big than the I (current) goes nearly to zero (I-> 0). For a constant voltage, the current decreases as impedance increases. The high impedance state reduces the current levels so low that the buffer appears in the circuit as not connected to anything. This is the role of tri-state buffers: they can be disabled to essentially break connections. inENBout x0Z inENBout x1Z

 It is a selector: it chooses one of its data inputs and passes it to the output according to some other selection inputs  Consider four binary data inputs as inputs of a multiplexer. Two select signals will determine which of the four inputs will be passed to the output.  Figure (a) presents the internal structure of a four inputs multiplexer, b and c present the multiplexer schematic representation with active high enable signal (b) and active low enable signal (c)

Input0 S1’ S0’ Input1 S1’ S0 Input2 S1 S0’ Input3 S1 S0 Multiplexer internal structure

Multiplexer schematic representation with active high enable signal Multiplexer schematic representation with active low enable signal

Multiplexers can be cascaded to select from a large number of inputs 4 to 1 multiplexer made of 2 to 1 multiplexers

 A decoder accepts a binary value as input and decodes it.  It has n inputs and 2 n outputs, numbered from 0 to 2 n -1.  Each output represents one minterm of the inputs  The output corresponding to the value of the n inputs is activated  For example, a decoder with three inputs and eight outputs will activate output 6 whenever the input values are 110.  Figure (a) shows a two to four decoder internal structure, (b) and (c) show its schematic representation with active high enable signal and active low enable signal

For inputs S1S0 = 00, 01, 10 and 11 the outputs are 0, 1, 2 respectively 3 are active As with the multiplexer, the output can tri-state all outputs

Decoders can have active high or active low enable signals. Variants: have active low outputs (the selected output has a value 0 and all the other outputs have a value 1) output all 0 when not enabled instead of state Z (the ones in the figure).

 The encoder is the exact opposite of the decoder.  It receives 2 n inputs and outputs a n bit value corresponding to the one input that has a value of 1.  An 4-to-2 encoder and its schematic representations are presented in (a), (b) and (c).

Exactly zero or one input is active It will fail if more than one is high The encoder will output S1S0 = 00 if either input 0 is active or no input is active. The V signal distinguishes between these two cases

 A priority encoder works just a regular encoder, with one exception: whenever one or more input is active, the output is set to correspond to the highest active input  For example, in a 4-to-2 encoder, in inputs 0,1 and 3 are active, then the S1S0=11 output is set, corresponding to the input 3.

This circuitry disables a given input if a higher numbered input is active This guarantees that not more than one active signal is passed to the rest of the circuitry, which can be the same as the regular encoder

 A comparator compares a two n-bit binary values to determine which is greater or if they are equal  Consider the simple 1-bit comparator to illustrate the design  It is possible to extend the design for multi- bit numbers

X>Y only if Xi=1, Yi=0 X<Y only if Xi=0, Yi=1 X=Y only if Xi=Yi=0 or Xi=Yi=1