Illustrate master-slave flip-flop, Computer Engineering

Assignment Help:

Q. Illustrate Master-Slave Flip-Flop?

Master slave flip-flop comprise two flip-flops. One is master flip-flop and other one is known as slave flip-flop. Fig below shows implementation of master-slave flip-flop employing J-K flip-flop.

2107_Illustrate Master-Slave Flip-Flop.png

Figure:  Master - Slave flip- flop

Note:  Master-slave flip-flop can be constructed using D or SR flip-flop in similar way.

(i) When clock pulse is 0 master flip-flops is disabled however slave becomes active and its output Q & Q¯ becomes equivalent to Y and Y¯ correspondingly. Why? Well possible combination of value of Y and Y' are either Y=1, Y¯ =0 or Y=0 Y¯ =1. So slave flip-flop can have subsequent combinations: -

(a) J=1, K=0 that means Q=1, Q =0 (stet flip-flop)

(b) J=0, K=1 that means Q=0, Q =1 (clear flip-flop)

(ii) when inputs are applied at JK and clock pulse becomes 1 only master gets triggered resulting in intermediary output Y going to state 0 or 1 relying on input and previous state. Remember during this time slave is also preserving its previous state only. As clock pulse becomes 0 master becomes inactive and slave obtains same state as master as described in (a) and (b) conditions above.

However why do we need this master-slave combination?  To realize this consider a situation where output of one flip-flop is going to be input of other flip-flop. Here assumption is that clock pulse inputs of all flip-flops are synchronized and happen at same time. The change of state of master happens when clock pulse goes to 1 however during that time output of slave still hasn't changed So the state of flip-flops in system can be changed concurrently during the same clock pulse even though output of flip-flops are linked to inputs of other flip-flops.


Related Discussions:- Illustrate master-slave flip-flop

Implement the concept of true and radix minus one complement, Q. Develop a...

Q. Develop a program to implement the concept of true and radix minus one complement. Program should ask for radix and two numbers from that radix. For that two numbers program

Average access time experienced by the processor, Give the formula for the ...

Give the formula for the average access time experienced by the processor in a system with 2 levels of caches. Ans: Formula is for the average access time experienced by the pr

What is the basic approach of page replacement, What is the basic approach ...

What is the basic approach of page replacement?  If no frame is free is available, find one that is not currently being used and free it. A frame can be freed by writing its co

NETWORK ADMIN, Discuss the risks of having a single root user and how more ...

Discuss the risks of having a single root user and how more limited management abilities can be given to others users on Linux/UNIX systems.uestion #Minimum 100 words accepted#

Mip method for the problem solving, 1. Solve the following grouping problem...

1. Solve the following grouping problem using the DCA method. 2.  Use the ROC methodfor the previous problem. 3. Use the MIP method for the problem above assuming a tota

Write a subroutine in c for toggling the cursor, Write a subroutine in C fo...

Write a subroutine in C for toggling the cursor using old directives. ; ; use small memory model for C - near code segment _DATA SEGMENT WORD   'DATA'   CURVAL EQU   [B

Threads model - parallel programming model, In this model a one process can...

In this model a one process can have multiple, concurrent implementations paths. The major programs are scheduled to run by the native operating system. It loads and obtains all th

C PROGAMM, CODING FOR...WHAT IS THE PROBABILITY THAT A CARD DRAWN FROM A PA...

CODING FOR...WHAT IS THE PROBABILITY THAT A CARD DRAWN FROM A PACK OF 52 CARDS WILL BE A DIAMOND OR A KING .

Queue depth should be greater than zero, Tell me which queue having present...

Tell me which queue having present queue depth should be greater than zero? Ans) Event queues Open MQ Explorer by selecting Start > Programs > IBM WebSphere MQ > WebSphere

Example of blocking probability for the three stage network, A three stage ...

A three stage network is realized by using switching matrices of size p x s in stage 1, r x r matrices in stage 2 and s x p matrices in stage 3. Using the Lee's probability graph s

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