2017/4/24 CHAPTER 6 Counters Chapter 5 (Sections 5.4 - 5.7)

Slides:



Advertisements
Similar presentations
General Sequential Design
Advertisements

COUNTERS Counters with Inputs Kinds of Counters Asynchronous vs
Lecture 23: Registers and Counters (2)
Registers and Counters
CENG 241 Digital Design 1 Lecture 11
Chapter 7 Henry Hexmoor Registers and RTL
Counters Mano & Kime Sections 5-4, 5-5. Counters Ripple Counter Synchronous Binary Counters –Design with D Flip-Flops –Design with J-K Flip-Flops Counters.
Contemporary Logic Design Sequential Case Studies © R.H. Katz Transparency No Chapter #7: Sequential Logic Case Studies 7.1, 7.2 Counters.
Registers and Counters
Logic and Computer Design Fundamentals Registers and Counters
ENGIN112 L27: Counters November 5, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 27 Counters.
CS370 Counters. Overview °Counter: A register that goes through a prescribed series of states °Counters are important components in computers. °Counters.
COE 202: Digital Logic Design Sequential Circuits Part 4 KFUPM Courtesy of Dr. Ahmad Almulhem.
Sequential Circuit Introduction to Counter
A.Abhari CPS2131 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:
Mantıksal Tasarım – BBM231 M. Önder Efe
Registers and Counters
Counters  A counter is a device which stores (and sometimes displays) the number of times a particular event or process has occurred, often in relationship.
Registers and Counters
Chapter 1_4 Part II Counters
1 Sequential Circuits Registers and Counters. 2 Master Slave Flip Flops.
EE345: Introduction to Microcontrollers Register and Counters Prof. Ahmad Abu-El-Haija.
Sequential Circuits Chapter 4 S. Dandamudi To be used with S. Dandamudi, “Fundamentals of Computer Organization and Design,” Springer,  S.
Registers and Counters
1 Registers and Counters A register consists of a group of flip-flops and gates that affect their transition. An n-bit register consists of n-bit flip-flops.
Rabie A. Ramadan Lecture 3
Counters By Taweesak Reungpeerakul
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Lecture 17 Dr. Shi Dept. of Electrical and Computer Engineering.
Registers and Counters by Dr. Amin Danial Asham. References  Digital Design 5 th Edition, Morris Mano.
7-6 단일 레지스터에서 Microoperation Multiplexer-Based Transfer  Register 가 서로 다른 시간에 둘 이상의 source 에서 data 를 받을 경우 If (K1=1) then (R0 ←R1) else if (K2=1) then.
1 Registers & Counters Logic and Digital System Design - CS 303 Erkay Savaş Sabancı University.
ENG241 Digital Design Week #8 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.
Chap 5. Registers and Counters. Chap Definition of Register and Counter l a clocked sequential circuit o consist of a group of flip-flops & combinational.
Chapter 1_4 Part III more on … Counters Chapter 1_4 Part III more on … Counters.
Chapter 1 Counters. Counters Counters are sequential circuits which "count” through a specific state sequence. They can count up, count down, or count.
2017/4/24 1.
CHAPTER 6 Sequential Circuits’ Analysis CHAPTER 6 Sequential Circuits’ Analysis Sichuan University Software College.
Registers and Counters
C HAPTER S IX R EGISTERS AND C OUNTERS 1. A clocked sequential circuit consists of a group of flip-flops and combinational gates connected to form a feedback.
COUNTERS Why do we need counters?
Counters.
Basic Counters: Part I Section 7-6 (pp ).
Chap 5. Registers and Counters
DIGITAL COMPONENTS. MULTIPLEXERS A multiplexer is a combinational circuit that receives binary information from one of 2 n input data lines and directs.
Counters and registers Eng.Maha Alqubali. Registers Registers are groups of flip-flops, where each flip- flop is capable of storing one bit of information.
Logic Design (CE1111 ) Lecture 6 (Chapter 6) Registers &Counters Prepared by Dr. Lamiaa Elshenawy 1.
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.
1 CHAPTER 12 REGISTERS AND COUNTERS This chapter in the book includes: Objectives Study Guide 12.1Registers and Register Transfers 12.2Shift Registers.
Sequential logic circuits First Class 1Dr. AMMAR ABDUL-HAMED KHADER.
FLIP FLOPS Binary unit capable of storing one bit – 0 or 1
Homework Reading Machine Projects Labs Tokheim Chapter 9.1 – 9.6
Registers and Counters
EKT 221 – Counters.
EKT 221 : Digital 2 COUNTERS.
Sequential Logic Counters and Registers
Sequential Circuit: Counter
Dr. Clincy Professor of CS
Copyright Joanne DeGroat, ECE, OSU
Registers and Counters
Registers and Counters Register : A Group of Flip-Flops. N-Bit Register has N flip-flops. Each flip-flop stores 1-Bit Information. So N-Bit Register Stores.
COE 202: Digital Logic Design Sequential Circuits Part 4
29-Nov-18 Counters Chapter 5 (Sections ).
Registers and Register Transfers
Computer Architecture and Organization: L02: Logic design Review
Digital Logic Department of CNET Chapter-6
Digital Logic Department of CNET Chapter-6
Outline Registers Counters 5/11/2019.
Digital Electronics and Logic Design
Presentation transcript:

2017/4/24 CHAPTER 6 Counters Chapter 5 (Sections 5.4 - 5.7)

Overview Ripple Counter Synchronous Binary Counters Design with D Flip-Flops Design with J-K Flip-Flops Serial Vs. Parallel Counters Up-down Binary Counter Binary Counter with Parallel Load BCD Counter, Arbitrary sequence Counters

Counters A counter is a register that goes through a predetermined sequence of states upon the application of clock pulses. Counters are categorized as: Ripple Counters: The FF output transition serves as a source for triggering other FFs. No common clock. Synchronous Counter: All FFs receive the common clock pulse, and the change of state is determined from the present state.

Example: A 4-bit Upward Counting Ripple Counter Less Significant Bit output is Clock for Next Significant Bit! (Clock is active low) Recall...

Example (cont.) The output of each FF is connected to the C input of the next FF in sequence. The FF holding the least significant bit receives the incoming clock pulses. The J and K inputs of all FFs are connected to a permanent logic 1. The bubble next to the C label indicates that the FFs respond to the negative-going transition of the input.

Example (cont.) Operation: The least significant bit (Q0) is complemented with each negative-edge clock pulse input. Every time that Q0 goes from 1 to 0, Q1 is complemented. Every time that Q1 goes from 1 to 0, Q2 is complemented. Every time that Q2 goes from 1 to 0, Q3 is complemented, and so on.

Synchronous Binary Counters The design procedure for a binary counter is the same as any other synchronous sequential circuit. The primary inputs of the circuit are the CLK and any control signals (EN, Load, etc). The primary outputs are the FF outputs (present state). Most efficient implementations usually use T-FFs or JK-FFs. We will examine JK and D flip-flop designs.

Synchronous Binary Counters: J-K Flip Flop Design of a 4-bit Binary Up Counter

Synchronous Binary Counters: J-K Flip Flop Design of a Binary Up Counter (cont.)

Synchronous Binary Counters: J-K Flip Flop Design of a Binary Up Counter (cont.)

Synchronous Binary Counters: J-K Flip Flop Design of a Binary Up Counter (cont.)

Synchronous Binary Counters: J-K Flip Flop Design of a Binary Up Counter (cont.) logic 1 Q0 J JQ0 = 1 KQ0 = 1 JQ1 = Q0 KQ1 = Q0 JQ2 = Q0 Q1 KQ2 = Q0 Q1 JQ3 = Q0 Q1 Q2 KQ3 = Q0 Q1 Q2 C K Q1 J C K Q2 J C K J Q3 C K CLK

Synchronous Binary Counters: J-K Flip Flop Design of a Binary Up Counter with EN and CO EN = enable control signal, when 0 counter remains in the same state, when 1 it counts CO = carry output signal, used to extend the counter to more stages JQ0 = 1 · EN KQ0 = 1 · EN JQ1 = Q0 · EN KQ1 = Q0 · EN JQ2 = Q0 Q1 · EN KQ2 = Q0 Q1 · EN JQ3 = Q0 Q1 Q2 · EN KQ3 = Q0 Q1 Q2 · EN C0 = Q0 Q1 Q2 Q3 · EN

Synchronous binary counters using D flip-flops DQ0 = Q0  EN DQ1 = Q1  ( Q0 · EN) DQ2 = Q2  ( Q0 Q1 · EN ) DQ3 = Q3  ( Q0 Q1 Q2 · EN ) C0 = Q0 Q1 Q2 Q3 · EN JK-based design calls for 4 AND gates D-based design calls for 4 AND and 4 XOR gates JK-FF equations

Up-Down Binary Counter n-bit Up-Down Counter clock Q0 Q1 Qn-1 UD • • • UD = 0: count up UD = 1: count down

Up-Down Binary Counter (cont.) UD Q2 Q1 Q0 Q2.D Q1.D Q0.D UD Q2 Q1 Q0 Q2.D Q1.D Q0.D 0 0 0 0 0 0 1 0 0 0 1 0 1 0 0 0 1 0 0 1 1 0 0 1 1 1 0 0 0 1 0 0 1 0 1 0 1 0 1 1 1 0 0 1 1 0 1 1 1 0 1 1 1 0 0 0 1 0 0 0 1 1 1 1 0 0 1 0 0 0 1 0 1 0 0 0 1 1 0 1 1 0 1 0 1 1 0 0 0 1 1 1 1 0 1 1 0 0 1 1 1 0 1 0 1 1 1 1 1 1 1 0 Up-Counter Down-Counter Finish the design in class

Binary Counter with Parallel Load (Next slide) gives the logic diagram and symbol of a 4-bit synchronous binary counter with parallel load capability. The function table for this binary counter is Load Count Operation Nothing 1 Count 1 x Load

BCD counter Load x 1 Count Nothing Operation The binary counter with parallel load can be converted into a synchronous BCD counter by connecting an external AND gate to it.

BCD counter (cont.) The counter starts with an all-zero output. As long as the output of the AND gate is 0, each positive clock pulse transition increments the counter by one. When the output reaches the count of 1001, both Q0 and Q3 become 1, making the output of the AND gate equal to 1. This condition makes Load active, so on the next clock transition, the counter does not count, but is loaded from its four inputs. The value loaded then is 0000.

Arbitrary Sequence Counter Given an arbitrary sequence, design a counter that will generate this sequence. Procedure: Derive state table/diagram based on give sequence Simplify (using K-maps, etc) Draw logic diagram Example: Use D-FFs to draw the logic diagram for sequence generator (counter) for: 0  7  6  1  0 (000  111  110  001  000)

Example: Use D-FFs to draw the logic diagram for sequence generator (counter) for: 0  7  6  1  0 (000  111  110  001  000)

Example: D3=Q3’Q1’+Q3Q1 D2=Q3’Q1’+Q3Q1 D1=Q1’ Z= Q3’Q1 D3 K-Map Z K-Map

Example: D3=Q3’Q1’+Q3Q1 D2=Q3’Q1’+Q3Q1 D1=Q1’ Z= Q3’Q1

Example:

Homework Page284: 18