T Flip Flop to D Flip Flop Conversion

in the last presentation we completed the introduction to flip flop conversions and also converted JK flipflop to D flipflop We know our five steps required for this process and we are going to see one example in this presentation In which i will convert T flip flop to D flip flop by using the same five steps so lets move to this without wasting any time our first step is to determine the available and required flipflop so in this case the available flip flop is a t flip flop and required flip flop is d flipflop you can see T flip flop to D flip flop conversion now lets move to our step no 2 In which we will make characteristic table for the required flipflop , that is our D flip flop so lets make it qn D and then q n+1
now you already know in case of d flip flop the q n+1 is nexted same as the value of d , so 0 0 0 1 1 0 1 1 now q n+1 will be same as d , so 0 1 0 1 so this is the charactersitic table for the required flipflop now we can move towards step no 3 in which we have to make the excitation table for the available flipflop i.e our T flipflop , so lets make the excitation table for it and , you already know that in case of t flipflop the value of t is the odd one’s detected it means when the q n and q n+1 is having the odd ones t is going to be high so let’s compare it 0 0 no ones , so t is going to be 0 0 1 ; definitely an odd one is there , T is 1 1 0 ; 1 and 1 1 even ones are there, so t is now 0 so we are done with our step no.1 at defining the flipflop step no 2: making the characteristic table for the required flipflop step no 3: making the excitation table for the available flipflop now the step no 4 is to determine the boolean expression for t you can do it by any means , for example you can do it by the boolean algebra you can use the k-map but , i am going to write it directly because it’s very simple you can see; t is high only when q n and d is having odd no. of ones like you can see it in these two cases. so t is simply XOR combination of q n and d. so i can write d XOR q n no need to make the k map in this case so this is our step 4 so lets move towards step 5: implementation of the circuit so what is the available flipflop t so we are going to make t flipflop and we are going to do some changes , that t flip flop will work as d flipflop t is our input the clock is definitely there ; this is our clock the two outputs are q n and q n -compliment now let’s see what changes we need to do t=d XOR q n so if i say this is my d and i have to take this qn upto this point like this this is d , this qn then this t is the XOR combinations we need to make XOR gate here like this and now you can see t is d XOR qn so in this way the t flipflop can be converted to a d flipflop A very simple way to perform the conversion of flipflops so, i hope now you get it more clearly that how to do it in our next presentation we are going to do another type of conversion. So see you in the next one. 