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

Execute a reduce operation over members of specified group, Q. Execute a re...

Q. Execute a reduce operation over members of specified group? int info = pvm_reduce( void (*func)(), void *data, int count, int datatype, int msgtag, char    *group, int root

What is a process scheduling, What is a Process Scheduling? Scheduling...

What is a Process Scheduling? Scheduling is a key element of the workload management software that usually performs several or all of: Queuing Scheduling Monito

Assessing heuristic searches-artificial intelligence, Assessing Heuristic S...

Assessing Heuristic Searches Given a specific problem you want to create an agent to solve, there can be more than one way of specifying it as a search problem, more than one o

Target - data phase, Target abort -computer architecture: Usually, a t...

Target abort -computer architecture: Usually, a target holds DEVSEL# asserted through the final data phase. However, if a target desserts DEVSEL# before disconnecting without

Illustrate about compact disk rewritable, Q. Illustrate about Compact Disk ...

Q. Illustrate about Compact Disk Rewritable? CD-RW optical disk can be repeatedly written and overwritten same as with a magnetic disk. Even though a number of techniques have

Finite automata, applications of context free grammar

applications of context free grammar

What are simm and dimm, What are SIMM and DIMM? SIMM are Single In-Line...

What are SIMM and DIMM? SIMM are Single In-Line Memory Module. DIMM is Dual In-Line Memory Modules. Such modules are an assembly of various memory chips on a separate small boa

Asymptotic notations, Asymptotic Notations These notations are used fo...

Asymptotic Notations These notations are used for evaluating functions. Assume we have two functions f(n) and g(n) defined on real numbers, Theta Notation Big Notation

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