Illustration to demonstrate design of sequential circuits, Computer Engineering

Assignment Help:

Q. Illustration to demonstrate design of sequential circuits?

Let us take an illustration to demonstrate above process. Suppose we want to design 2-bit binary counter employing D flip-flop. Circuit goes through repeated binary states 00, 01, 10 and 11 whenever external input X = 1 is applied. State of circuit won't change when X = 0. State table and state diagram for this is displayed in figure. Although how do we make the state diagram? Please note number of flip-flops- 2 in our illustration as we are designing 2 bits counter. Different states of two bit input will be 00 01 10 and 11.  These are displayed in circle. The arrow denotes transitions on an input value X.  For illustration when counter is in state 00 and input value X=0 happens counter remains in 00 state.  Therefore loop back on X= 0.  But on encountering X=1 counter moves to state 01.  Similarly in all other states similar transition happen.  For making state table consider excitation table of D flip-flop given in figure (c).

Present state of two flip-flops and subsequent states of flip-flops are put into the table with any input value.  For illustration if present state of flip-flops is 01 and input value is 1 then counter will move to state 10.  Notice these values in fourth row of values in state table (figure (a) Or we can write as below:

582_Illustration to demonstrate design of sequential circuits.png

This denotes flip-flop A has moved from state clear to set. As we are constructing the counter using D flip-flop the main question is what would be input DA value of A flip-flop which allows this transition which  is Q(t) = 0 to Q(t+1) =1 possible for A flip flop.  On checking excitation table for D Flip-flop we find value of D input of a flip-flop (known as DA in this illustration) would be 1.  Similarly B flip-flop have a transition Q(t) = 1 to Q(t+1)=0 so DB, would be 0.  Therefore notice the values of flip-flop inputs DA and DB. (Row 3).


Related Discussions:- Illustration to demonstrate design of sequential circuits

Simplified boolean expression, Simplified the Boolean Algebra (x + y)(x + z...

Simplified the Boolean Algebra (x + y)(x + z) simplifies to ? Ans. x + yz as simplified the Boolean Algebra expression. [(x + y) (x + z)] = xx + xz + xy + yz = x + xz + xy + y

Discuss functioning of different network access equipments, Discuss the fun...

Discuss the functioning of different network access equipments. The E1 multiplexers MX2000 and MX2411 and E1/T1 MX200 are giving multi interface user access to network PDH or S

Discuss in detail table management techniques, Discuss in detail Table mana...

Discuss in detail Table management Techniques? An Assembler uses the subsequent tables: OPTAB: Operation Code Table consists of mnemonic operation code and machine langua

What are transmission bridges, What are transmission bridges? A usual ...

What are transmission bridges? A usual transmission bridge is demonstrated in figure. The series capacitance and the shunt inductances of the two relays give a high-pass filte

What is input - output instructions, Q. What is Input - Output Instructions...

Q. What is Input - Output Instructions? An I/O instruction is stored in memory of computer and is fetched as well as executed by processor producing an I/O-related command for

Explain frequency division multiplexing, Explain FDM and show how CCITT sta...

Explain FDM and show how CCITT standards help in building the base band? Frequency Division Multiplexing: This is the process of combining some information channels through s

How does tcp take of wrapping over of sequence numbers, How does TCP take o...

How does TCP take of wrapping over of sequence numbers? To handle out of instruct deliveries, transport protocols utilize sequencing. The sending side attaches a sequence numbe

How to make frames for web documents, Q. How to make frames for web documen...

Q. How to make frames for web documents? Intelligent use of frames can give your pages a cleaner look and make easier to navigate. The fundamental concept goes like this: Every

Rules for minimisation using k maps, 1) All squares containing a 1 must be ...

1) All squares containing a 1 must be grouped. 2) The largest possible groups must be formed. 3) Groups can overlap if this allows larger groups to be formed. 4) Groups mu

Dialog-task updates, Dialog-task updates are Synchronous updates.

Dialog-task updates are Synchronous updates.

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