Presentation is loading. Please wait.

Presentation is loading. Please wait.

3.13 How many output lines will a five-input decoder have?

Published byHarvey Spencer Modified over 8 years ago

Similar presentations

Presentation on theme: "3.13 How many output lines will a five-input decoder have?"— Presentation transcript:

1

2

3

4

5 3.13 How many output lines will a five-input decoder have?

6 3. 14 How many output lines will a 16-input multiplexer have
How many output lines will a 16-input multiplexer have? How many select lines will this multiplexer have?

7 3. 21 You know a byte is 8 bits. We call a 4-bit quantity a nibble
You know a byte is 8 bits. We call a 4-bit quantity a nibble. If a byte-addressable memory has a 14-bit address, how many nibbles of storage are in this memory?

8 Implement a 4-to-1 mux using only 2-to-1 muxes making sure to properly connect all of the terminals. Remember that you will have 4 inputs, 2 control signals, and 1 output. Write out the truth table for this circuit.

9

10

11

12

13 3.5 , 3.6 , 3.8 , 3.10 , 3.13 3.14 , 3.21 , 3.22 , 3.24 3.25 , 3.26 , 3.28

Download ppt "3.13 How many output lines will a five-input decoder have?"

Similar presentations

1 The 2-to-4 decoder is a block which decodes the 2-bit binary inputs and produces four output All but one outputs are zero One output corresponding to.

1 The 2-to-4 decoder is a block which decodes the 2-bit binary inputs and produces four output All but one outputs are zero One output corresponding to.
CDA 3100 Recitation Week 10.

CDA 3100 Recitation Week 10.
Logic Circuits Design presented by Amr Al-Awamry

Logic Circuits Design presented by Amr Al-Awamry
Control path Recall that the control path is the physical entity in a processor which: fetches instructions, fetches operands, decodes instructions, schedules.

Control path Recall that the control path is the physical entity in a processor which: fetches instructions, fetches operands, decodes instructions, schedules.
Decoders/DeMUXs CS370 – Spring 2003. Decoder: single data input, n control inputs, 2 outputs control inputs (called select S) represent Binary index of.

Decoders/DeMUXs CS370 – Spring Decoder: single data input, n control inputs, 2 outputs control inputs (called select S) represent Binary index of.
Chapter 3 Continued Logic Gates Logic Chips Combinational Logic Timing Sequential Logic Flip Flops Registers Memory State Machines.

Chapter 3 Continued Logic Gates Logic Chips Combinational Logic Timing Sequential Logic Flip Flops Registers Memory State Machines.
Combinatorial Logic Design Process. Example: Three 1s pattern detector Detect whether a pattern of at least three adjacent 1s occurs anywhere in an 8-bit.

Combinatorial Logic Design Process. Example: Three 1s pattern detector Detect whether a pattern of at least three adjacent 1s occurs anywhere in an 8-bit.
Combinational Logic1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.

Combinational Logic1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.
Chapter 2. Definition Characteristics ExamplesNon-examples Input Graphic.

Chapter 2. Definition Characteristics ExamplesNon-examples Input Graphic.
ECE 301 – Digital Electronics Multiplexers and Demultiplexers (Lecture #12)

ECE 301 – Digital Electronics Multiplexers and Demultiplexers (Lecture #12)
 Combinational circuit that selects binary information from one of many input lines and directs information to a single output line.

 Combinational circuit that selects binary information from one of many input lines and directs information to a single output line.
Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F 0 0 0 0 1 1 0 1 0 0 0 1 1 0 1 0 0 1 1 0 1 1 1 1 0 1 1 1 F = x + y’z x y z F Truth Table Boolean Function.

Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F F = x + y’z x y z F Truth Table Boolean Function.
ECE 3130 – Digital Electronics and Design Lab 3 Multiplexers, Parity Generators, and Boolean functions using MUX Fall 2012 Allan Guan.

ECE 3130 – Digital Electronics and Design Lab 3 Multiplexers, Parity Generators, and Boolean functions using MUX Fall 2012 Allan Guan.
9/15/09 - L15 Decoders, Multiplexers Copyright 2009 - Joanne DeGroat, ECE, OSU1 Decoders and Multiplexers.

9/15/09 - L15 Decoders, Multiplexers Copyright Joanne DeGroat, ECE, OSU1 Decoders and Multiplexers.
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.

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.
Random-Access Memory (RAM)

Random-Access Memory (RAM)
Chapter 5 Memory and Programmable Logic 5.1. Introduction 5.2. Random Access Memory 5.3. Memory Encoding 5.4. Read Only Memory 5.5. Programmable Logic.

Chapter 5 Memory and Programmable Logic 5.1. Introduction 5.2. Random Access Memory 5.3. Memory Encoding 5.4. Read Only Memory 5.5. Programmable Logic.
ECE 3130 – Digital Electronics and Design

ECE 3130 – Digital Electronics and Design
CSET 4650 Field Programmable Logic Devices

CSET 4650 Field Programmable Logic Devices
Digital Logic Structures MOS transistors logic gates functional units of a computer.

Digital Logic Structures MOS transistors logic gates functional units of a computer.

Similar presentations

Ads by Google