Counters Counters | Digital Logic - Computer Science Engineering (CSE) PDF Download

Introduction

An ā€˜Nā€™ bit binary counter consists of ā€˜Nā€™ T flip-flops. If the counter counts from 0 to 2š‘ āˆ’ 1, then it is called as binary up counter. Similarly, if the counter counts down from 2š‘ āˆ’ 1 to 0, then it is called as binary down counter.
There are two types of counters based on the flip-flops that are connected in synchronous or not.

  • Asynchronous counters
  • Synchronous counters

Asynchronous Counters

If the flip-flops do not receive the same clock signal, then that counter is called as Asynchronous counter. The output of system clock is applied as clock signal only to first flip-flop. The remaining flip-flops receive the clock signal from output of its previous stage flip-flop. Hence, the outputs of all flip-flops do not change affect at the same time.
Now, let us discuss the following two counters one by one.

  • Asynchronous Binary up counter
  • Asynchronous Binary down counter

Asynchronous Binary Up Counter

An ā€˜Nā€™ bit Asynchronous binary up counter consists of ā€˜Nā€™ T flip-flops. It counts from 0 to 2š‘ āˆ’ 1. The block diagram of 3-bit Asynchronous binary up counter is shown in the following figure.
Counters Counters | Digital Logic - Computer Science Engineering (CSE)

The 3-bit Asynchronous binary up counter contains three T flip-flops and the T-input of all the flip-flops are connected to ā€˜1ā€™. All these flip-flops are negative edge triggered but the outputs change asynchronously. The clock signal is directly applied to the first T flip-flop. So, the output of first T flip-flop toggles for every negative edge of clock signal.
The output of first T flip-flop is applied as clock signal for second T flip-flop. So, the output of second T flip-flop toggles for every negative edge of output of first T flip-flop. Similarly, the output of third T flip-flop toggles for every negative edge of output of second T flip-flop, since the output of second T flip-flop acts as the clock signal for third T flip-flop.Assume the initial status of T flip-flops from rightmost to leftmost is Q2Q1Q0=000. Here, Q2 & Q0 are MSB & LSB
respectively. We can understand the working of 3-bit asynchronous binary counter from the following table.
Counters Counters | Digital Logic - Computer Science Engineering (CSE)

Here Q0 toggled for every negative edge of clock signal. Q1 toggled for every Q0 that goes from 1 to 0, otherwise remained in the previous state. Similarly, Q2 toggled for every Q1 that goes from 1 to 0, otherwise remained in the previous state.
The initial status of the T flip-flops in the absence of clock signal is Q2Q1Q0=000. This is incremented by one for every negative edge of clock signal and reached to maximum value at 7th negative edge of clock signal. This pattern repeats when further negative edges of clock signal are applied.

Test: Latches
Start Test
Start Test

Asynchronous Binary Down Counter

An ā€˜Nā€™ bit Asynchronous binary down counter consists of ā€˜Nā€™ T flip-flops. It counts from 2š‘ āˆ’ 1 to 0. The block diagram of 3-bit Asynchronous binary down counter is shown in the following figure.
Counters Counters | Digital Logic - Computer Science Engineering (CSE)

The block diagram of 3-bit Asynchronous binary down counter is similar to the block diagram of 3-bit Asynchronous binary up counter. But, the only difference is that instead of connecting the normal outputs of one stage flip-flop as clock signal for next stage flip-flop, connect the complemented outputs of one stage flip-flop as clock signal for next stage flip-flop. Complemented output goes from 1 to 0 is same as the normal output goes from 0 to 1.
Assume the initial status of T flip-flops from rightmost to leftmost is Q2Q1Q0=000. Here, Q2 & Q0 are MSB & LSB respectively. We can understand the working of 3-bit asynchronous binary down counter from the following table.
Counters Counters | Digital Logic - Computer Science Engineering (CSE)

Here Q0 toggled for every negative edge of clock signal. Q1 toggled for every Q0 that goes from 0 to 1, otherwise remained in the previous state. Similarly, Q2 toggled for every Q1 that goes from 0 to 1, otherwise remained in the previous state.
The initial status of the T flip-flops in the absence of clock signal is Q2Q1Q0=000. This is decremented by one for every negative edge of clock signal and reaches to the same value at 8th negative edge of clock signal. This pattern repeats when further negative edges of clock signal are applied.

Synchronous Counters

If all the flip-flops receive the same clock signal, then that counter is called as Synchronous counter. Hence, the outputs of all flip-flops change affect at the same time.
Now, let us discuss the following two counters one by one.

  • Synchronous Binary up counter
  • Synchronous Binary down counter

Synchronous Binary Up Counter

An ā€˜Nā€™ bit Synchronous binary up counter consists of ā€˜Nā€™ T flip-flops. It counts from 0 to 2š‘ āˆ’ 1. The block diagram of 3-bit Synchronous binary up counter is shown in the following figure.
Counters Counters | Digital Logic - Computer Science Engineering (CSE)

The 3-bit Synchronous binary up counter contains three T flip-flops & one 2-input AND gate. All these flip-flops are negative edge triggered and the outputs of flip-flops change affect synchronously. The T inputs of first, second and third flip-flops are 1, Q0 & Q1Q0 respectively.
The output of first T flip-flop toggles for every negative edge of clock signal. The output of second T flip-flop toggles for every negative edge of clock signal if Q0 is 1. The output of third T flip-flop toggles for every negative edge of clock signal if both Q0 & Q1 are 1.

Download the notes
Counters Counters
Download as PDF
Download as PDF

Synchronous Binary Down Counter

An ā€˜Nā€™ bit Synchronous binary down counter consists of ā€˜Nā€™ T flip-flops. It counts from 2š‘ āˆ’ 1 to 0. The block diagram of 3-bit Synchronous binary down counter is shown in the following figure.

Counters Counters | Digital Logic - Computer Science Engineering (CSE)

The 3-bit Synchronous binary down counter contains three T flip-flops & one 2-input AND gate. All these flip-flops are negative edge triggered and the outputs of flip-flops change affect synchronously. The T inputs of first, second and third flip-flops are 1, Q0ā€² &' Q1ā€²Q0ā€² respectively.
The output of first T flip-flop toggles for every negative edge of clock signal. The output of second T flip-flop toggles for every negative edge of clock signal if Q0ā€² is 1. The output of third T flip-flop toggles for every negative edge of clock signal if both Q1ā€² & Q0ā€² are 1.

The document Counters Counters | Digital Logic - Computer Science Engineering (CSE) is a part of the Computer Science Engineering (CSE) Course Digital Logic.
All you need of Computer Science Engineering (CSE) at this link: Computer Science Engineering (CSE)
Are you preparing for Exam? Then you should check out the best video lectures, notes, free mock test series, crash course and much more provided by EduRev. You also get your detailed analysis and report cards along with 24x7 doubt solving for you to excel in exam. So join EduRev now and revolutionise the way you learn!
Sign up for Free Download App for Free
32 docs|15 tests

Up next

32 docs|15 tests
Download as PDF

Up next

Related Searches

shortcuts and tricks

,

practice quizzes

,

Semester Notes

,

Counters Counters | Digital Logic - Computer Science Engineering (CSE)

,

Sample Paper

,

Important questions

,

video lectures

,

Previous Year Questions with Solutions

,

Objective type Questions

,

MCQs

,

Summary

,

Counters Counters | Digital Logic - Computer Science Engineering (CSE)

,

Counters Counters | Digital Logic - Computer Science Engineering (CSE)

,

mock tests for examination

,

pdf

,

Extra Questions

,

ppt

,

Exam

,

study material

,

Viva Questions

,

Free

,

past year papers

;