Homework 2 Due 28 th May 2014. Implement This Function using 1)a 3-to-8 Line Decoder (with OR gates) 2) a 3-to-8 Line Active Low Decoder (with NAND gates)

Slides:

Advertisements

Similar presentations

Advertisements

Carry Lookahead Homework

//HDL Example 4-10 // //Gate-level description of circuit of Fig. 4-2 module analysis (A,B,C,F1,F2); input.

Modular Combinational Logic

Combinational Circuits

CSIS 3510 Computer Organization and Architecture Topics covered in this lecture: –Review of De’Morgan’s Theorem –Using De’Morgan’s Theorem –Building a.

ES 112 Project 2 bit ALU.

Appendix B Digital Logic. Irvine, Kip R. Assembly Language for Intel-Based Computers, NOT AND OR XOR NAND NOR Truth Tables Boolean Operators.

Chapter 11_1 (chap 10 ed 8) Digital Logic. Irvine, Kip R. Assembly Language for Intel-Based Computers, NOT AND OR XOR NAND NOR Truth Tables Boolean.

1 Tutorial: ITI1100 Dewan Tanvir Ahmed SITE, UofO.

1 CS 140 Lecture 12 Standard Combinational Modules Professor CK Cheng CSE Dept. UC San Diego.

CS 140 Lecture 11 Professor CK Cheng 5/09/02. Part III - Standard Modules Decoder, Encoder, Mux, DeMux, Shifter, Adder, Multiplexer Interconnect: Decoder,

Lab 6 – Part C2 Circuit for Problem 3.6 p 20. a b s y z = ~s & a w = s & b = ~s & a  s & b b s a ~s w = (b & s ) z = (a & ~s ) y = ~ (z & w) De Morgan’s.

Combinational Logic1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.

CIS 6001 Gates Gates are the building blocks for digital circuits Conventions used is high voltage = 1 and ground = 0 Inverter and NOT Gate are two terms.

Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F F = x + y’z x y z F Truth Table Boolean Function.

CS 105 Digital Logic Design

Chapter 10_1 Digital Logic. Irvine, Kip R. Assembly Language for Intel-Based Computers, NOT AND OR XOR NAND NOR Truth Tables Boolean Operators.

Top-down modular design

Binary Addition CSC 103 September 17, 2007.

Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.

TODAY YOU ARE LEARNING to explain why data is represented in computer systems in binary form 2. to understand and produce simple logic diagrams.

1 The 8051 Microcontroller and Embedded Systems CHAPTER 0 INTRODUCTION TO COMPUTING.

ECE 3110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices Adders, subtractors, ALUs.

Quiz What are the results of the following 4-bit bitwise logical operations? NOT OR NOR AND

Module 9.  Digital logic circuits can be categorized based on the nature of their inputs either: Combinational logic circuit It consists of logic gates.

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

COMPSCI 210 Semester Tutorial 2: Logic Gates.

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.

ECE 3110: Introduction to Digital Systems Chapter 5 Combinational Logic Design Practices X-OR gates and Parity circuits Comparators Adders, subtractors,

4. Computer Maths and Logic 4.2 Boolean Logic Logic Circuits.

Introducing the Nexys 2 Board CS 332 – Operating Systems 12/04/2011 by Otto Castell-R.

Logic Design CS 270: Mathematical Foundations of Computer Science Jeremy Johnson.

Using De’Morgan’s On of the most useful principles in boolean algebra is De’Morgan’s Theorem, which allows one to switch between ANDs and NORs and ORs.

Anurag Dwivedi. Basic Block - Gates Gates -> Flip Flops.

Number Systems and Circuits for Addition Lecture 5 Section 1.5 Thu, Jan 26, 2006.

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

Design of a Reversible Binary Coded Decimal Adder by Using Reversible 4-bit Parallel Adder Babu, H. M. H. Chowdhury, A.R, “Design of a reversible binary.

1 Ethics of Computing MONT 113G, Spring 2012 Session 5 Binary Addition.

Lecture 4 Introduction to Boolean Algebra. Binary Operators In the following descriptions, we will let A and B be Boolean variables and define a set of.

CSC Intro. to Computing Lecture 7: Circuits & Boolean Properties.

Logic Gates. AND gate Produces an output only if both inputs are on Input AInput BOutput (Q) Q=

Computing Machinery Chapter 3: Combinational Circuits.

Number Systems and Circuits for Addition – Binary Adders Lecture 6 Section 1.5 Fri, Jan 26, 2007.

Module 7.  In Module 3 we have learned about NAND gate – it is a combination of AND operation followed by NOT operation  Symbol A. B = Y  Logic Gate.

Appendix B: Digital Logic

Digital Design Lecture 8 Combinatorial Logic (Continued)

Gates AND, OR, NOT NAND, NOR Combinational logic No memory A set of inputs uniquely and unambiguously specifies.

Figure S1.1 The Motorola MPC 7400 PowerPC CPU. Figure S1.3 Truth table for INCLUSIVE-OR operation.

© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.

ECE 3110: Introduction to Digital Systems Chapter 5 Combinational Logic Design Practices Adders,subtractors, ALUs.

LOGIC CIRCUITLOGIC CIRCUIT. Goal To understand how digital a computer can work, at the lowest level. To understand what is possible and the limitations.

Full Adders Vector Notation Multiplexers and Decoders Ellen Spertus MCS 111 September 6, 2001.

Combinational Logic Weiqiang Sun. A brief review Logic gates Logic gates AND, OR, NOT AND, OR, NOT NAND, NOR, XOR, XNOR NAND, NOR, XOR, XNOR Boolean algebra.

Logic Gates Learning Objectives Learn that there is a one-to-one relationship between logic gates and Boolean expressions Learn how logic gates are combined.

Eng. Mai Z. Alyazji October, 2016

ECE 3130 Digital Electronics and Design

Exclusive OR Gate.

Part 4 Combinational Logic.

Digital Logic Design 1st Exam Solution

Chap. 8 Datapath Units: Multiplier Design

Universal gates.

FIGURE 4.1 Block diagram of combinational circuit

HALF ADDER FULL ADDER Half Subtractor.

Waveforms & Timing Diagrams

Week 7: Gates and Circuits: PART II

Today You are Learning simple logic diagrams using the operations AND, OR and NOT truth tables combining Boolean operators using AND, OR and NOT.

Chapter 10.3 and 10.4: Combinatorial Circuits

LOGIC Circuits.

Presentation transcript:

Homework 2 Due 28 th May 2014

Implement This Function using 1)a 3-to-8 Line Decoder (with OR gates) 2) a 3-to-8 Line Active Low Decoder (with NAND gates) 3)only 1-to-2 Line Decoders (with NOR gates) Note: For 3 you’ll have to use Decoder Trees Marks =

F = A’B + ACD Implement This Function using 1)a 4-to-16 Line Decoder (with NOR gates) 2)a 4-to-16 Line Active Low Decoder (with AND gates) 3)only 3-to-8 Line Active Low Decoders (with NAND gates) Note: For 3 you’ll have to use Decoder Trees Marks =

1) Draw the circuit diagram of an adder that adds two 8-bit numbers by cascading Adder modules that add two 2-bit numbers 2) Draw the circuit diagram of an adder that adds two 9-bit number using the following Addition modules a. two Full-Adders b. one 3-bit adder c. one 4-bit adder 2) Draw the circuit diagram of 6x3 Multiplier using Full-Adder modules Marks =