1 Lecture #7 EGR 277 – Digital Logic Reading Assignment: Chapter 4 in Digital Design, 3 rd Edition by Mano Chapter 4 – Combinational Logic Circuits A)

Slides:

Advertisements

Similar presentations

Give qualifications of instructors: DAP

Advertisements

Digital Logic Design Week 7 Encoders, Decoders, Multiplexers, Demuxes.

Functions and Functional Blocks

1 KU College of Engineering Elec 204: Digital Systems Design Lecture 9 Programmable Configurations Read Only Memory (ROM) – –a fixed array of AND gates.

Lecture #9 EGR 277 – Digital Logic

Code Converters, Multiplexers and Demultiplexers

Overview Part 2 – Combinational Logic

Transistor-Transistor Logic (TTL) Lecture L4.1. Transistor-Transistor Logic (TTL) Developed in mid-1960s Large family (74xx) of chips from basic gates.

Combinational Logic Chapter 4.

Multiplexers, Decoders, and Programmable Logic Devices

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

DIGITAL SYSTEMS TCE OTHER COMBINATIONAL LOGIC CIRCUITS DECODERS ENCODERS.

Digital Logic Design Lecture 18. Announcements HW 6 up on webpage, due on Thursday, 11/6.

Any logic circuits can be transformed to an implementation where only NAND gates (and inverters) are used. The general approach to finding a NAND-gate.

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

Arithmetic Operations and Circuits Lecture 5. Binary Arithmetic let’s look at the procedures for performing the four basic arithmetic functions: addition,

CS 105 Digital Logic Design

Combinational Circuits

Today’s Topics Digital Logic Design Digital Logic Design Boolean Logic Boolean Logic Digital Logic Circuits Digital Logic Circuits.

Morgan Kaufmann Publishers

Combinational Logic Design

Outline Analysis of Combinational Circuits Signed Number Arithmetic

Combinational and Sequential Logic Circuits.

Combinational Logic Chapter 4. Digital Circuits Combinational Circuits Logic circuits for digital system Combinational circuits the outputs are.

Chapter 4 The Building Blocks: Binary Numbers, Boolean Logic, and Gates.

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

Combinational Circuit – Arithmetic Circuit

+ CS 325: CS Hardware and Software Organization and Architecture Combinational Circuits 1.

SUPLEMENTARY CHAPTER 1: An Introduction to Digital Logic The Architecture of Computer Hardware and Systems Software: An Information Technology Approach.

Unit 9 Multiplexers, Decoders, and Programmable Logic Devices

MSI Devices M. Mano & C. Kime: Logic and Computer Design Fundamentals (Chapter 5) Dr. Costas Kyriacou and Dr. Konstantinos Tatas ACOE161 - Digital Logic.

Digital Logic Operations and Functions. Basic Logic Operations Logic, as you know it, involves in a making of digital system. Logic, as you know it, involves.

Digital Components and Combinational Circuits Sachin Kharady.

Eng. Mohammed Timraz Electronics & Communication Engineer University of Palestine Faculty of Engineering and Urban planning Software Engineering Department.

ADDERS Half Adders Recall that the basic rules of binary addition are as indicated below in Table 2-9. A circuit known as the half-adder carries out these.

Functions of Combinational Logic

1 DIGITAL ELECTRONICS. 2 OVERVIEW –electronic circuits capable of carrying out logical (boolean) and arithmetic operations on information stored as binary.

1 Binary Codes Digital systems use 2-state devices that understand only 2 binary values (0 and 1). But we communicate using various symbols and methods.

1 Lecture #10 EGR 277 – Digital Logic Multiplexers (Data Selectors) A multiplexer (MUX) is a device that allows several low-speed signals to be sent over.

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

CHAPTER 4 Combinational Logic

Karnaugh maps for the binary full adder.

ACOE1611 Combinational Logic Circuits Reference: M. Mano, C. Kime, “Logic and Computer Design Fundamentals”, Chapter 2.

CS 105 DIGITAL LOGIC DESIGN Chapter 4 Combinational Logic 1.

Computer logic Data and programs in digital computers are represented and processed by electronic circuit networks called digital logic circuits or logic.

1 Chapter 4 Combinational Logic Logic circuits for digital systems may be combinational or sequential. A combinational circuit consists of input variables,

Magnitude Comparator Dr. Ahmed Telba.

Logic Design CS221 1 st Term combinational circuits Cairo University Faculty of Computers and Information.

1 Multiplexers (Data Selectors) A multiplexer (MUX) is a device that allows several low-speed signals to be sent over one high-speed output line. “Select.

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

CS151 Introduction to Digital Design Chapter 3: Combinational Logic Design 3-5 Combinational Functional Blocks 3-6 Rudimentary Logic Functions 3-7 Decoding.

Digital Logic Design Basics Combinational Circuits Sequential Circuits Pu-Jen Cheng Adapted from the slides prepared by S. Dandamudi for the book, Fundamentals.

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

Logic Design (CE1111 ) Lecture 4 (Chapter 4) Combinational Logic Prepared by Dr. Lamiaa Elshenawy 1.

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.

Chapter 36 Combinational Logic Circuits. Objectives After completing this chapter, you will be able to: –Describe the functions of encoders, decoders,

ACOE161 (Spring2007)MSI Devices1 Revision on MSI Devices M. Mano & C. Kime: Logic and Computer Design Fundamentals (Chapter 5)

Lecture No. 14 Combinational Functional Devices. Digital Logic &Design Dr. Waseem Ikram Lecture 14.

Overview Part 2 – Combinational Logic Functions and functional blocks

Lecture #6 EGR 277 – Digital Logic

Combinational Circuit Design

Digital Components and Combinational Circuits

NAND-ONLY LOGIC CIRCUITS

Basics Combinational Circuits Sequential Circuits

FIGURE 4.1 Block diagram of combinational circuit

Programmable Configurations

COE 202: Digital Logic Design Combinational Circuits Part 3

XOR, XNOR, and Binary Adders

XOR Function Logic Symbol  Description  Truth Table 

Digital System Design Combinational Logic

Presentation transcript:

1 Lecture #7 EGR 277 – Digital Logic Reading Assignment: Chapter 4 in Digital Design, 3 rd Edition by Mano Chapter 4 – Combinational Logic Circuits A) Using gates (with the Design Procedure covered shortly) B) Using commercially-available MSI and LSI devices Chapter 5 – Implementing Combinational Logic Circuits using Programmable Logic Devices (PLD’s) The terms below have become somewhat dated as integrated circuits have become more complex, but they are still used at times: SSI: Small-scale integration - equivalent of gates MSI: Medium-scale integration - equivalent of gates Examples: Decoders, encoders, multiplexers, adders LSI: Large-scale integration - equivalent of gates Examples: Small memory chips, arithmetic logic units (ALU’s) VLSI: Very large-scale integration - equivalent of gates Examples: Small microprocessors Note: Current microprocessors contain the equivalent of millions of transistors.

2 Lecture #7 EGR 277 – Digital Logic Design Procedure for Combinational Logic Circuits In general, we might want to design a combinational logic circuit with N inputs and M outputs, as shown below. Logic Gates N inputs M outputs Design Procedure: 1. State the problem 2. Determine the required inputs and outputs 3. Assign variables to the inputs and outputs 4. Derive the truth table 5. Simplify the output expressions 6. Implement the expressions with logic gates

3 Lecture #7 EGR 277 – Digital Logic Example: Design a prime number indicator that will detect prime numbers with up to 4 bits.

4 Lecture #7 EGR 277 – Digital Logic Example: Various types of code converters can be designed, including: BCD to excess-3 (try this one in class) ASCII to EBCDIC Binary to 2’s complement Excess-3 to reflected BCD to 9’s complement

5 Lecture #7 EGR 277 – Digital Logic Example: Half-adder – adds 2 bits with no carry in and one carry out

6 Lecture #7 EGR 277 – Digital Logic Example: Full-adder – adds 2 bits with one carry in and one carry out Illustrate the SOP implementation Illustrate the XOR implementation Show how a full adder can be constructed using two half adders

7 Lecture #7 EGR 277 – Digital Logic Adders: (continued) Discuss each of the following: 4-bit adder using 4 full adders bit adder (explain “look-ahead carry” circuit) Handout: 7483 data sheet

8 Lecture #7 EGR 277 – Digital Logic Combinational Logic Using MSI and LSI devices We have the capability to design our own combinational logic circuits, but circuits of common interest are probably available commercially. Commercial devices can perform complex functions using perhaps a single IC, thus saving space. They are typically faster that equivalent circuits that we might build using discrete logic gates. It might be a good idea to browse through a Logic Data Book to see what is available. A few devices are listed below. Assortment of commercially available combinational logic devices

9 Lecture #7 EGR 277 – Digital Logic Decoders An N-bit decoder has 2 N outputs, only one of which may be activated at a given time. If the device is active-HIGH, then only one output may be HIGH at any time. If the device is active-LOW, then only one output may be LOW at any time. Example: A 3-bit decoder might also be called a 3-line-to-8-line decoder or a 3x8 decoder. The block diagram is shown below: Discuss: basic operation the truth table the design of the decoder circuit.

10 Lecture #7 EGR 277 – Digital Logic Active-LOW versus Active-HIGH decoders Enable lines – essentially act as ON/OFF switches Example: Show the truth table and block diagram for an active-LOW 2x4 decoder with an enable line, E.

11 Lecture #7 EGR 277 – Digital Logic Implementing Boolean functions using decoders Note that the decoder outputs for active-HIGH decoders are simply minterms, so F =  (minterms) =  (active-HIGH decoder outputs) Example: Implement f(A,B,C) =  (0, 3, 5, 6) using a 3 x 8 decoder with active-HIGH outputs Note that the decoder outputs for active-LOW decoders are simply maxterms, so F =  (maxterms) =  (active-LOW decoder outputs) Example: Implement f(A,B,C) =  (0, 3, 5, 6) using a 3 x 8 decoder with active-LOW outputs

12 Lecture #7 EGR 277 – Digital Logic Decoder IC’s Handout: (dual 2x4 decoder/single 3x8 decoder) Note: The is similar to the except that it has open-collector outputs instead of totem-pole outputs (discuss the advantage of this). Show how to connect the as a 2x4 decoder and also as a 3x8 decoder. Show how to use two 74155’s to form a 4x16 decoder.