Digital Logic Design.

Slides:

Advertisements

Similar presentations

ENGIN112 L23: Finite State Machine Design Procedure October 27, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 23 Finite State Machine.

Advertisements

State-machine structure (Mealy)

Analysis of Clocked Sequential Circuits

التصميم المنطقي Second Course

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

Circuits require memory to store intermediate data

Dr. ClincyLecture1 Appendix A – Part 2: Logic Circuits Current State or output of the device is affected by the previous states Circuit Flip Flops New.

Sequential Circuit Analysis & Design Dr. Aiman H. El-Maleh Computer Engineering Department King Fahd University of Petroleum & Minerals Dr. Aiman H. El-Maleh.

Logic Circuits Another look at Floating Point Numbers Common Combinational Logic Circuits Timing Sequential Circuits Note: Multiplication & Division in.

RIPPLE COUNTERS A register that goes through a prescribed sequence of states upon the application of input pulses is called a counter. The input pulses.

Homework Reading Machine Projects Labs Tokheim Chapter 9.1 – 9.6

Generate a clock pulse clk inp outp

Give qualifications of instructors: DAP

Logic and Computer Design Fundamentals Registers and Counters

Lab 10 RT methodology (cont’d) Example 1 – a counter Example 2 – a repetitive-adder multiplier.

ENEE 408C Lab Capstone Project: Digital System Design Fall 2005 Sequential Circuit Design.

ENGIN112 L26: Shift Registers November 3, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 26 Shift Registers.

Sequential Circuit Introduction to Counter

KU College of Engineering Elec 204: Digital Systems Design

What is shift register? A shift register is a digital memory circuit found in calculators, computers, and data-processing systems. Bits (binary digits)

Registers and Counters

A presentation on Counters

Registers and Counters

Chapter 1_4 Part II Counters

Lecture 10 Topics: Sequential circuits Basic concepts Clocks

ENGSCI 232 Computer Systems Lecture 5: Synchronous Circuits.

Some Useful Circuits Lecture for CPSC 5155 Edward Bosworth, Ph.D. Computer Science Department Columbus State University.

Chapter 5 - Part Sequential Circuit Design Design Procedure  Specification  Formulation - Obtain a state diagram or state table  State Assignment.

Circuit, State Diagram, State Table

Rabie A. Ramadan Lecture 3

Introduction to Sequential Logic Design Finite State-Machine Design.

Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 5 – Sequential Circuits Logic and Computer.

Counters Dr. Rebhi S. Baraka Logic Design (CSCI 2301) Department of Computer Science Faculty of Information Technology The Islamic University.

Counters. November 5, 2003 Introduction: Counters  Counters are circuits that cycle through a specified number of states.  Two types of counters: 

Digital Design Lectures 11 & 12 Shift Registers and Counters.

Registers and Counters Chapter 6. Digital Circuits 2 Clocked sequential circuits a group of flip-flops and combinational gates connected to form a feedback.

Introduction to State Machine

Counters. In class excercise How to implement a “counter”, which will count as 0,3,1,4,5,7,0,3,1,…… Q2Q1Q0D2D1D

Review of Digital Logic Design Concepts OR: What I Need to Know from Digital Logic Design (EEL3705)

Assignment 8 solutions 1) Design and draw combinational logic to perform multiplication of two 2-bit numbers (i.e. each 0 to 3) producing a 4-bit result.

DLD Lecture 26 Finite State Machine Design Procedure.

Computer Architecture and Organization Unit -1. Digital Logic Circuits – Logic Gates – Boolean Algebra – Map Simplification – Combinational Circuits –

Decade Counter (BCD Counter). Introduction A counter which is reset at the 10 th clock pulse is called decade counter. The decade counter is otherwise.

Counters and Registers Synchronous Counters. 7-7 Synchronous Down and Up/Down Counters  In the previous lecture, we’ve learned how synchronous counters.

Digital System Design using VHDL

DIGITAL COMPONENTS. MULTIPLEXERS A multiplexer is a combinational circuit that receives binary information from one of 2 n input data lines and directs.

THEME 6: Frequency dividers. Digital counters with reduced counting modulus. Programmable digital counters. If the input pulses are more than K, the counter.

1 Lecture #14 EGR 277 – Digital Logic Self-starting counters Counters are considered to be self-starting if all unused counts eventually lead to the correct.

1 Registers A register is a group of n flip-flops each of them capable of storing one bit of information There are two types of registers: parallel and.

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.

Mealy and Moore Machines Lecture 8 Overview Moore Machines Mealy Machines Sequential Circuits.

1 Homework Reading –Tokheim Chapter 9.1 – 9.6 Machine Projects –Continue on mp3 Labs –Continue in labs with your assigned section.

UP/DOWN SYNCHRONOUS COUNTERS An up/down counter is one that is capable of progressing in either direction through a certain sequence. An up/down counter,

FLIP FLOPS Binary unit capable of storing one bit – 0 or 1

Homework Reading Machine Projects Labs Tokheim Chapter 9.1 – 9.6

Digital Decode & Correction Logic

EKT 221 – Counters.

EKT 221 : Digital 2 COUNTERS.

FIGURE 5.1 Block diagram of sequential circuit

Basics of digital systems

Dr. Clincy Professor of CS

CSE 370 – Winter Sequential Logic-2 - 1

Computer Architecture and Organization: L02: Logic design Review

CSE 370 – Winter Sequential Logic-2 - 1

Lecture 17 Logistics Last lecture Today HW5 due on Wednesday

14 Digital Systems.

Lecture 17 Logistics Last lecture Today HW5 due on Wednesday

Outline Registers Counters 5/11/2019.

Digital Electronics and Logic Design

Presentation transcript:

Digital Logic Design

Example 1 Find a function to detect an error in the representation of a decimal digit in BCD. In other words, write an equation with value 1 when the inputs are any one of the six unused bit combinations in the BCD code, and value 0 otherwise. Based on your equation, implement it with only NAND gates.

solution E = AB + AC.

Implementation NAND

Example 2 show how to build a 3- bit synchronous shift register using three positive edge-triggered D flip-flops and three 4-to-1 multiplexers. To apply a constant (e.g., 0 or 1) at any input, simply write the value of the constant at the input. The shift register has two control inputs Sh1 and Sh0, three data inputs D2, D1, and D0, and three data outputs Q2, Q1, and Q0. Sh1and Sh0 specify the operations of the shift register as shown in the table below. With the rotate left operation (Sh1=1, Sh0=0), all of the bits get shifted one position to the left, and Q0 gets the value of Q2. All operations must occur at the rising edge of the CLK.

Solution

Example 3 Draw the state diagram of Moore FSM that does the following: It has one serial input, X, and two serial outputs, Y and Z. Y is one if the total number of zeros received at the input since reset is odd. Z is one if the total number of zeros received at the input since reset is a multiple of three (i.e., 0, 3, 6, 9, etc.).

SOLUTION X/YZ 0/10 S0 S1 0/00 0/01 S5 S2 0/10 0/11 S4 S3 0/00

Example 4 Design a FSM circuit that is activated on a “START” signal and outputs a signal “PULSE” on a regular interval as described below. The circuit cycles through 16 clock cycle periods (0 through 15 cycles) and asserts “PULSE” on clock cycles 1, 7, 8, 15. use counter, decoder, and any extra logic

Solution state diagram Start signal =>S Pulse signal=> P We have 16 states how many binary bits will represent that? S=0/P=0 S0 S=1/P=1 S1 S=x/P=0 S2 S=x/P=0 S3 S=x/P=0 S4 S=x/P=0 S5 S=x/P=0 S11 S=x/P=0 S10 S=x/P=0 S9 S=x/P=1 S8 S=x/P=1 S7 S=x/P=1 S=x/P=0 S6 S=x/P=0 S12 S13 S15 S14 S=x/P=0 S=x/P=1 S=x/P=0

State table

Our system now 1 2 15

Example 5 Design a state diagram for a recognizer that recognizes an input sequence 11101. It has an input X and output Y. The recognizer sets the output to 1 (Y = 1) if the last five values on the input X were 11101.

state diagram 0/0 0/0 S1 S0 1/0 1/0 0/0 S5 1/0 S2 0/0 1/1 1/0 S3 S4

State table