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

Predictive modelling power, Another useful feature of an experts system ...

Another useful feature of an experts system is its predicative modelling power. The system can act as an information processing theory or model of problem solving in th

Define the term- verification, Define the term- Verification It is a wa...

Define the term- Verification It is a way of preventing errors when data is copied from one medium to another (for instance from paper to disk/CD or from memory to DVD, etc.).

Implementation using 8 to 1 multiplexer, Implement the following function u...

Implement the following function using 8 to 1 multiplexer Y(A, B, C, D) = ∑(0,1,2,5,9,11,13,15) Ans. We will obtain three variables B,C and D at selection lines and also A as i

Illustrate the working of encoders, Q. Illustrate the working of Encoders? ...

Q. Illustrate the working of Encoders? An Encoder performs reverse function of decoder. An encoder has 2n input lines and 'n' output line. Let's see 8 ×3 encoder that encodes 8

Binary search tree, Given the following interface public interface WordS...

Given the following interface public interface WordSet extends Iterable { public void add(Word word); // Add word if not already added public boolean contains(Word word);

Explain the type of micro-operations, Q. Explain the type of micro-operatio...

Q. Explain the type of micro-operations? Let's first discuss type of micro-operations. Most common micro-operations performed in a digital computer can be categorized into 4 ca

Define e-cash, What do you understand by E-cash? E-Cash Ecash is ...

What do you understand by E-cash? E-Cash Ecash is a cash which is showed by two models. One is the on-line form of e-cash which permits for the completion of all types of

Define range which a normalised mantissa can signify, Now let's define rang...

Now let's define range which a normalised mantissa can signify. Let's presume that our present representations has normalised mantissa so left most bit can't be zero so it has to b

Desirable choice for the partitioning element in quick sort, A desirable ch...

A desirable choice for the partitioning element in quick sort is First element of the list.

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