Illustrate working of synchronous counters, Computer Engineering

Assignment Help:

Q. Illustrate working of Synchronous Counters?

The main drawback of ripple counter is delay in changing the value. How? To understand this let's take a case when state of ripple counter is 0111. Now subsequent state will be 1000 that means change in state of all flip-flops. However will it take place concurrently in ripple counter? No first O0 will change then O1, O2 and finally O3. Delay is proportional to length of the counter. Thus to avoid this drawback of ripple counters we use synchronous counters in which all flip-flops change their states simultaneously. Figure below shows 3-bit synchronous counter.

107_Illustrate working of Synchronous Counters.png

Figure: Logic diagram of 3-bit synchronous counter

You can understand the working of this counter by analyzing sequence of states (O0, O1, O2) given in Figure below.

1538_Illustrate working of Synchronous Counters1.png

Figure: Truth table for 3 bit synchronous counter

The operation can be briefed as: -

i)  First flip-flop is complemented in each clock cycle.

ii) Second flip-flop is complemented on occurrence of a clock cycle if current state of first flip-flop is 1.

iii) Third flip-flop is fed by an AND gate which is connected with output of first and second flip-flops. It will be complemented only when first and second flip-flops are in Set State.


Related Discussions:- Illustrate working of synchronous counters

Explain about the term e-cash, Explain about the term E-Cash. E-cash is...

Explain about the term E-Cash. E-cash is cash demonstrated by two models. E-cash has one is on-line form of e-cash, that is introduced by DigiCash that permits for the completi

Modus ponens rule, Modus ponens rule: In fact the general format for t...

Modus ponens rule: In fact the general format for the modus ponens rule is as follows: like if we have a true sentence that states the proposition A implies proposition B and

Id3 algorithm - artificial intelligence, Th e ID3 algorithm The cal...

Th e ID3 algorithm The calculation for information gain is the very difficult phase of this algorithm. ID3 performs a search whereby the search states are decision trees an

Network, Give an intuitive explanation of why the maximum throughput, for s...

Give an intuitive explanation of why the maximum throughput, for small beta, is approximately the same for CSMA slotted Aloha and FCFS splitting with CSMA. Show the optimal expecte

Explain the boolean equations for logic circuits, Explain The Boolean Equat...

Explain The Boolean Equations for Logic Circuits? A Boolean equation is the mathematical representation of a logic circuit using standard Boolean terms. All the logic gates (AND,

Explain data rates in public switched telephone network, Explain data rates...

Explain data rates in public switched telephone network. Data rates in PSTNs : A voice channel in a public switched telephone network is band restricted with a nominal bandwid

Facsimile , FACSIMILE : This is often known as 'fax' and it represents the...

FACSIMILE : This is often known as 'fax' and it represents the interface between reprographic and computer technology. By using fax, the contents of a sheet of paper (text or illu

Explain concurrent sharing, Explain Concurrent Sharing Here a number of...

Explain Concurrent Sharing Here a number of programs that may share a file simultaneously. While this is the case, it is necessary to prevent mutual interference among them. Th

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd