CDA 3100 Recitation Week 10.

Slides:

Advertisements

Similar presentations

DAT2343 Basic Logic Gates © Alan T. Pinck / Algonquin College; 2003.

Advertisements

Digital Circuits. Review – Getting the truth table The first step in designing a digital circuit usually is to get the truth table. That is, for every.

CDA 3100 Recitation Week 11.

ECE 2110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices Encoders.

5.5 Encoders A encoder is a multiple-input, multiple-output logic circuit that converts coded inputs into coded outputs, where the input and output codes.

Logic Circuits Design presented by Amr Al-Awamry

Digital Circuits.

Bump Switch System for WunderBot II By: Matt Barley.

ECE 3110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices XOR, Parity Circuits, Comparators.

1 Homework Reading –Tokheim, Section 5-10, 7-4 Machine Projects –Continue on MP4 Labs –Continue labs with your assigned section.

Sequential Logic Design Process A sequential circuit that controls Boolean outputs and a specific time- ordered behavior is called a controller. StepDescription.

Sequential Logic Design

SYEN 3330 Digital SystemsJung H. Kim Chapter SYEN 3330 Digital Systems Chapter 2 – Part 1.

Chapter 3 Combinational Logic Design

In a not gate, if the input is on(1) the output is off (0) and vice versa.

ITEC 352 Lecture 5 Low level components(3). Low level components Review Multiplexers Demultiplexer Minterm/Maxterm Karnaugh Map.

CS 151: Digital Design Chapter 3 3-8: Encoding. CS 151 Encoding Encoding - the opposite of decoding - the conversion of a maximum of 2 n input code to.

Circuit, State Diagram, State Table

TOPIC : Introduction to Functional Modeling UNIT 1: Modeling Digital Circuits Module 1 : Functional Modeling.

XOR and XNOR Logic Gates. XOR Function Output Y is TRUE if input A OR input B are TRUE Exclusively, else it is FALSE. Logic Symbol  Description  Truth.

Combinational Circuit – Arithmetic Circuit

KARNAUGH MAP – Digital Circuit 1 Choopan Rattanapoka.

COE 202: Digital Logic Design Combinational Circuits Part 3 Dr. Ahmad Almulhem ahmadsm AT kfupm Phone: Office: Ahmad Almulhem, KFUPM.

Digital Circuits. Review – Getting the truth table The first step in designing a digital circuit usually is to get the truth table. That is, for every.

9/15/09 - L15 Decoders, Multiplexers Copyright Joanne DeGroat, ECE, OSU1 Decoders and Multiplexer Circuits.

Lecture 9 Topics: –Combinational circuits Basic concepts Examples of typical combinational circuits –Half-adder –Full-adder –Ripple-Carry adder –Decoder.

Exclusive OR Gate. Logically, the exclusive OR (XOR) operation can be seen as either of the following operations:exclusive OR (XOR) 1. A AND NOT B OR.

Combination of logic gates  Logic gates can be combined to produce more complex functions.  They can also be combined to substitute one type of gate.

Universal college of engineering & technology. .By Harsh Patel)

Teaching Computing to GCSE Level with Python Session 3.

CS151 Introduction to Digital Design

1 CS 151: Digital Design Chapter 3: Combinational Logic Design 3-1Design Procedure CS 151: Digital Design.

Designing Combinational Logic Circuits

Module 11.  In Module 9, we have been introduced to the concept of combinational logic circuits through the examples of binary adders.  Meanwhile, in.

Decoders A decoder is a logic circuit that detects the presence of a specific combination of bits at its input. Two simple decoders that detect the presence.

Logic Gates Practical Objective: to develop an understanding of logic circuits and truth tables.

ECE 331 – Digital System Design

Combinational Circuits

Summary Half-Adder Basic rules of binary addition are performed by a half adder, which has two binary inputs (A and B) and two binary outputs (Carry out.

ECE 2110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices Encoders.

Karnaugh Maps (K-Maps)

Digital Circuits.

FIGURE 4.1 Block diagram of combinational circuit

Number Systems and Circuits for Addition

13 Digital Logic Circuits.

Adders and Subtractors

Gates Type AND denoted by X.Y OR denoted by X + Y NOR denoted by X + Y

DIGITAL ELECTRONICS B.SC FY

Combinational Circuits

Table 1.1 Powers of Two.

Lecture 5 Binary Operation Boolean Logic. Binary Operations Addition Subtraction Multiplication Division.

XOR Function Logic Symbol  Description  Truth Table 

Instructor: Alexander Stoytchev

Combinational circuits design

Digital Circuits.

Half & Full Subtractor Half Subtractor Full Subtractor.

Carryout bit? Carryout bit is ‘1’ also on four cases. When a, b and carryin are 110, 101, 011, 111. Does it mean that we need a similar circuit as sum?

Half & Full Subtractor Half Subtractor Full Subtractor.

Digital Circuits.

ACOE101: Freshman Computer Engineering Fall 2018

Digital Logic Design.

SYEN 3330 Digital Systems Chapter 2 – Part 1 SYEN 3330 Digital Systems.

Digital Circuits.

Presentation transcript:

CDA 3100 Recitation Week 10

Design a 4-bit encoder: Has four input bits (I3, I2, I1, I0) and two output bits (O1, O0) If input bits are 1xxx, the output is 11 If input bits are 01xx, the output is 10 If input bits are 001x, the output is 01 If the input bits are 0001, the output is 00

Design 4-bit encoder: Truth Table X 1

Design 4-bit encoder: K-Map for O1 I3 I2 I1 I0 00 01 11 10 X 1 O1 = I3 + I2

Design 4-bit encoder: K-Map for O0 I3 I2 I1 I0 00 01 11 10 X 1 O0 = I3 + (~I2 * I1)

Design 4-bit encoder: Circuit

Design a circuit: Treat two 2-bit inputs, X and Y, as unsigned binary numbers Write logic functions that are true if and only if X < Y

Design a circuit: Truth Table X1 X0 Y1 Y0 O 1

Design a circuit: K-Map X1 X0 Y1 Y0 00 01 11 10 1 O = (Y1 * ~X1) + (~X1 * ~X0 * Y0) + (~X0 * Y1 * Y0)

Design a circuit: Circuit