Implementation Technologies

Similar documents
Two-level logic using NAND gates

Read-only memory Implementing logic with ROM Programmable logic devices Implementing logic with PLDs Static hazards

Binary full adder. 2-bit ripple-carry adder. CSE 370 Spring 2006 Introduction to Digital Design Lecture 12: Adders

COMBINATIONAL CIRCUITS

Combinational circuits

Sistemas Digitais I LESI - 2º ano

Lecture 12: More on Registers, Multiplexers, Decoders, Comparators and Wot- Nots

Combinational Logic Design

earlier in the semester: The Full adder above adds two bits and the output is at the end. So if we do this eight times, we would have an 8-bit adder.

CSE140: Components and Design Techniques for Digital Systems

Combinational-Circuit Building Blocks

Figure 8-1 Four Possible Results of Adding Two Bits

Gates, Circuits, and Boolean Algebra

Digital Logic Design. Basics Combinational Circuits Sequential Circuits. Pu-Jen Cheng

Gates, Plexers, Decoders, Registers, Addition and Comparison

1. True or False? A voltage level in the range 0 to 2 volts is interpreted as a binary 1.

Chapter 7 Memory and Programmable Logic

RAM & ROM Based Digital Design. ECE 152A Winter 2012

Karnaugh Maps & Combinational Logic Design. ECE 152A Winter 2012

ASYNCHRONOUS COUNTERS

DESIGN OF GATE NETWORKS

5 Combinatorial Components. 5.0 Full adder. Full subtractor

MICROPROCESSOR. Exclusive for IACE Students iacehyd.blogspot.in Ph: /422 Page 1

Chapter 4 Register Transfer and Microoperations. Section 4.1 Register Transfer Language

Basic Logic Gates Richard E. Haskell

Systems I: Computer Organization and Architecture

Karnaugh Maps. Circuit-wise, this leads to a minimal two-level implementation

(Refer Slide Time: 00:01:16 min)

Understanding Logic Design

Lab 17: Building a 4-Digit 7-Segment LED Decoder

Digital Fundamentals. Lab 8 Asynchronous Counter Applications

Chapter 2: Boolean Algebra and Logic Gates. Boolean Algebra

3.Basic Gate Combinations

Systems I: Computer Organization and Architecture

A N. O N Output/Input-output connection

Modeling Latches and Flip-flops

Digital Multiplexer and Demultiplexer. Features. General Description. Input/Output Connections. When to Use a Multiplexer. Multiplexer 1.

Modeling Sequential Elements with Verilog. Prof. Chien-Nan Liu TEL: ext: Sequential Circuit

ANALOG & DIGITAL ELECTRONICS

CHAPTER 3 Boolean Algebra and Digital Logic

CSE140: Midterm 1 Solution and Rubric

Objectives. Units of Memory Capacity. CMPE328 Microprocessors (Spring ) Memory and I/O address Decoders. By Dr.

Register File, Finite State Machines & Hardware Control Language

Chapter 9 Computer Design Basics!

Asynchronous counters, except for the first block, work independently from a system clock.

Adder.PPT(10/1/2009) 5.1. Lecture 13. Adder Circuits

ETEC 2301 Programmable Logic Devices. Chapter 10 Counters. Shawnee State University Department of Industrial and Engineering Technologies

Lecture 5: Gate Logic Logic Optimization

8051 hardware summary

IE1204 Digital Design F12: Asynchronous Sequential Circuits (Part 1)

LAN Switching Computer Networking. Switched Network Advantages. Hubs (more) Hubs. Bridges/Switches, , PPP. Interconnecting LANs

Chapter 9 Latches, Flip-Flops, and Timers

Binary Adders: Half Adders and Full Adders

DM Segment Decoder/Driver/Latch with Constant Current Source Outputs

Local-Area Network -LAN

(1) /30 (2) /30 (3) /40 TOTAL /100

FPGA. AT6000 FPGAs. Application Note AT6000 FPGAs. 3x3 Convolver with Run-Time Reconfigurable Vector Multiplier in Atmel AT6000 FPGAs.

COURSE SYLLABUS. PRE-REQUISITES: Take CETT-1303(41052); Minimum grade C, CR.

SECTION C [short essay] [Not to exceed 120 words, Answer any SIX questions. Each question carries FOUR marks] 6 x 4=24 marks

Architectural Level Power Consumption of Network on Chip. Presenter: YUAN Zheng

C H A P T E R. Logic Circuits

Mobile IP Network Layer Lesson 01 OSI (open systems interconnection) Seven Layer Model and Internet Protocol Layers

Chapter 2 Logic Gates and Introduction to Computer Architecture

Memory Elements. Combinational logic cannot remember

Gates & Boolean Algebra. Boolean Operators. Combinational Logic. Introduction

RAPID PROTOTYPING OF DIGITAL SYSTEMS Second Edition

Mixed Logic A B A B. 1. Ignore all bubbles on logic gates and inverters. This means

Logic in Computer Science: Logic Gates

United States Naval Academy Electrical and Computer Engineering Department. EC262 Exam 1

It explains the differences between the Plesiochronous Digital Hierarchy and the Synchronous Digital Hierarchy.

Operating Manual Ver.1.1

PART 6 - Central Office Services SECTION 9 - Other Central Office Services Original Sheet 26.1

Answer All Questions. All Questions Carry Equal Marks.Time: 20 Min. Marks: 20. (c) Network devices such as routers, switches, or hubs.

Lab 1: Full Adder 0.0

Design Verification & Testing Design for Testability and Scan

Memory Testing. Memory testing.1

Boolean Algebra. Boolean Algebra. Boolean Algebra. Boolean Algebra

Multiplexers and demultiplexers

74AC139 74ACT139 Dual 1-of-4 Decoder/Demultiplexer

CHAPTER IX REGISTER BLOCKS COUNTERS, SHIFT, AND ROTATE REGISTERS

BOOLEAN ALGEBRA & LOGIC GATES

Let s put together a Manual Processor

Contents COUNTER. Unit III- Counters

Module 2. Embedded Processors and Memory. Version 2 EE IIT, Kharagpur 1

Layout of Multiple Cells

GSM Channels. Physical & Logical Channels. Traffic and Control Mutltiframing. Frame Structure

Logic gates. Chapter. 9.1 Logic gates. MIL symbols. Learning Summary. In this chapter you will learn about: Logic gates

Introduction to Digital System Design


Module 3: Floyd, Digital Fundamental

Instruction Set Architecture. Datapath & Control. Instruction. LC-3 Overview: Memory and Registers. CIT 595 Spring 2010

CSEE 3827: Fundamentals of Computer Systems. Standard Forms and Simplification with Karnaugh Maps

Counters and Decoders

Digital Electronics Detailed Outline

Digital Design with VHDL

Chapter 5 :: Memory and Logic Arrays

Simplifying Logic Circuits with Karnaugh Maps

Using Logic to Design Computer Components

Transcription:

Implementation Technologies Standard gates (pretty much done) gate packages cell libraries Regular logic (we are here) multiplexers decoders Two-level programmable logic (a little later) PLs, PLs, PLs ROMs FPGs utumn SE - VII - Multiplexer and ecoder Logic Regular logic Need to make design faster Need to make engineering changes easier to make Simpler for designers to understand and map to functionality harder to think in terms of specific gates easier to think in terms of larger multi-purpose blocks utumn SE - VII - Multiplexer and ecoder Logic

Making connections irect point-to-point connections using wires Route one of many inputs to a single output --- multiplexer Route a single input to one of many outputs --- demultiplexer control control multiplexer demultiplexer 4x4 switch utumn SE - VII - Multiplexer and ecoder Logic Mux and de (cont'd) Uses of multiplexers/demultiplexers in multi-point connections Sa MUX MUX Sb multiple input sources Sum Ss EMUX multiple output destinations S S utumn SE - VII - Multiplexer and ecoder Logic 4

Multiplexers/selectors Multiplexers/selectors: general concept n data inputs, n control inputs (called "selects"), output used to connect n points to a single point control signal pattern forms binary index of input connected to output = ' I + I functional form logical form I I two alternative forms for a : Mux truth table I I utumn SE - VII - Multiplexer and ecoder Logic Multiplexers/selectors (cont'd) : : = 'I + I 4: : = ''I + 'I + 'I + I 8: : = '''I + ''I + ''I + 'I + ''I 4 + 'I + 'I + I n - In general: = Σ (m k I k ) I I : k= in minterm shorthand form for a n : Mux I I I I 4: I I I I I4 I I I 8: utumn SE - VII - Multiplexer and ecoder Logic

Gate level implementation of es : 4: utumn SE - VII - Multiplexer and ecoder Logic Multiplexers as general-purpose logic n : multiplexer can implement any function of n variables with the variables used as control inputs and the data inputs tied to or in essence, a lookup table (LUT) Example: F(,,) = m + m + m + m = ''' + '' + ' + 4 8: MUX S S S = '''I + ''I + ''I + 'I + ''I 4 + 'I + 'I + I utumn SE - VII - Multiplexer and ecoder Logic 8

ascading multiplexers Large multiplexers can be made by cascading smaller ones I I I I I4 I I I 4: 4: : control signals and simultaneously choose one of I, I, I, I and one of I4, I, I, I control signal chooses which of the upper or lower 's output to gate to 8: I I I I I4 I I I : : : : alternative implementation 4: 8: utumn SE - VII - Multiplexer and ecoder Logic 9 Multiplexers as general-purpose logic (cont d) n- : multiplexer can implement any function of n variables with n- variables used as control inputs and the data inputs tied to the last variable or its complement Example: F(,,) = m + m + m + m = ''' + '' + ' + = ''(') + '(') + '() + () 4 8: MUX S S S F F ' ' ' ' 4: MUX S S F utumn SE - VII - Multiplexer and ecoder Logic

Multiplexers as general-purpose logic (cont d) Generalization n- control variables single data variable Example: G(,,,) can be realized by an 8: MUX choose,, as control variables I I... I n- I n F........ G I n I n ' 4 8: MUX S S S four possible configurations of truth table rows can be expressed as a function of I n utumn SE - VII - Multiplexer and ecoder Logic ' ctivity Realize F = + with a 4: multiplexer and a minimum of other gates: 4: MUX S S utumn SE - VII - Multiplexer and ecoder Logic

ctivity Realize F = + with a 4: multiplexer and a minimum of other gates: when when when when 4: MUX S S = () + () + () + () utumn SE - VII - Multiplexer and ecoder Logic emultiplexers/decoders ecoders/demultiplexers: general concept single data input, n control inputs, n outputs control inputs (called selects (S)) represent binary index of output to which the input is connected data input usually called enable (G) : ecoder: O = G S O = G S :4 ecoder: O = G S S O = G S S O = G S S O = G S S :8 ecoder: O = G S S S O = G S S S O = G S S S O = G S S S O4 = G S S S O = G S S S O = G S S S O = G S S S utumn SE - VII - Multiplexer and ecoder Logic 4

Gate level implementation of demultiplexers : decoders active-high enable G S O O active-low enable \G S O O :4 decoders G O \G O active-high enable O active-low enable O O O O O S S S S utumn SE - VII - Multiplexer and ecoder Logic emultiplexers as general-purpose logic n: n decoder can implement any function of n variables with the variables used as control inputs the enable inputs tied to and the appropriate minterms summed to form the function :8 E 4 S S S ''' '' '' ' '' ' ' demultiplexer generates appropriate minterm based on control signals (it "decodes" control signals) utumn SE - VII - Multiplexer and ecoder Logic

emultiplexers as general-purpose logic (cont d) F = '' + '' + F = '' + F = (' + ' + ' + ') Enable 4: E '''' ''' ''' '' 4 ''' '' '' ' 8 ''' 9 '' '' ' '' ' 4 ' F F F utumn SE - VII - Multiplexer and ecoder Logic ascading decoders : decoder x:4 decoder 4x:8 decoders F :4 E S S ''''E' :8 E 4 S S S :8 E 4 E S S S ''E' :8 E 4 S S S '''E' :8 E 4 'E S S S E E utumn SE - VII - Multiplexer and ecoder Logic 8