You are on page 1of 24

Conversion from one flipflop to other

• Write the characteristic table of required Flipflop


• Write the available Flipflop Excitation table
• Derive the Excitation input(Flipflop inputs) values for
the given (available) flipflop
• Using K-map find the Sum of Products
(SOP)expressions for the Excitation inputs
• Draw the Circuit

G RAVI KUMAR REDDY


Implementing SR Flipflop Using JK flipflop
JK flipflop to SR Flipflop
1.Required Flipflop (SR Flipflop ) characteristic table
Characteristic table
Present Next
Inputs
state state
S R Qn Qn+1
0 0 0 0
0 0 1 1
0 1 0 0
0 1 1 0
1 0 0 1
1 0 1 1
1 1 0 X
1 1 1 X
G RAVI KUMAR REDDY
2.Available Flipflop (JK Flipflop) Excitation table
Excitation table Present State Next State Inputs
Qn Qn+1 J K
0 0 0 X
0 1 1 X
1 0 X 1
1 1 X 0
3.Writing Excitation table
Present Next
Inputs Excitation Inputs
state state
S R Qn Qn+1 J K
0 0 0 0 0 X
0 0 1 1 X 0
0 1 0 0 0 X
0 1 1 0 X 1
1 0 0 1 1 X
1 0 1 1 X 0
1 1 0 X X X
1 1 1 X X X
G RAVI KUMAR REDDY
4.Minimization
Boolean Expression for Excitation Input ‘ J ’

5.Implementation

Boolean Expression for Excitation Input ‘ K ’

G RAVI KUMAR REDDY


Implementing D Flipflop Using JK flipflop
JK flipflop to D Flipflop
1.Required Flipflop (D Flipflop ) 2.Available Flipflop (JK Flipflop)
characteristic table Excitation table
Present State Next State Inputs
Inputs Present state Next state
Qn Qn+1 J K
D Qn Qn+1
0 0 0 X
0 0 0 0 1 1 X
0 1 0 1 0 X 1
1 0 1 1 1 X 0
1 1 1

3.Writing Excitation table

Inputs Present state Next state Excitation Inputs


D Qn Qn+1 J K
0 0 0 0 X

0 1 0 X 1

1 0 1 1 X

1 1 1 X 0
G RAVI KUMAR REDDY
4.Minimization
Boolean Expression for Excitation Input ‘ J ’ Boolean Expression for Excitation Input ‘ K ’

5.Implementation

G RAVI KUMAR REDDY


Implementing T Flipflop Using JK flipflop
JK flipflop to T Flipflop
1.Required Flipflop (T Flipflop ) 2.Available Flipflop (JK Flipflop)
characteristic table Excitation table
Present State Next State Inputs
Inputs Present state Next state
Qn Qn+1 J K
T Qn Qn+1
0 0 0 X
0 0 0 0 1 1 X
0 1 1 1 0 X 1
1 0 1 1 1 X 0
1 1 0

3.Writing Excitation table

Inputs Present state Next state Excitation Inputs


T Qn Qn+1 J K
0 0 0 0 X

0 1 1 X 0

1 0 1 1 X

1 1 0 X 1
G RAVI KUMAR REDDY
4.Minimization
Boolean Expression for Excitation Input ‘ J ’ Boolean Expression for Excitation Input ‘ K ’

5.Implementation

G RAVI KUMAR REDDY


Implementing SR Flipflop Using D flipflop
D flipflop to SR Flipflop
1.Required Flipflop (SR Flipflop ) 2.Available Flipflop (D Flipflop)
characteristic table Excitation table
Present Next
Inputs Present State Next State Inputs
state state
S R Qn Qn+1 Qn Qn+1 D
0 0 0
0 0 0 0
0 1 1
0 0 1 1
1 0 0
0 1 0 0 1 1 1
0 1 1 0
1 0 0 1
1 0 1 1
1 1 0 X
1 1 1 X

G RAVI KUMAR REDDY


3.Writing Excitation table

Present Next Excitation


Inputs
state state Inputs
S R Qn Qn+1 D
0 0 0 0 0
0 0 1 1 1
0 1 0 0 0
0 1 1 0 0
1 0 0 1 1
1 0 1 1 1
1 1 0 X X
1 1 1 X X

G RAVI KUMAR REDDY


4.Minimization
Boolean Expression for Excitation Input ‘ D ’

Fig: SR Flip flop design using D Flip flop G RAVI KUMAR REDDY
Implementing JK Flipflop Using D flipflop
D flipflop to JK Flipflop
1.Required Flipflop (JK Flipflop ) 2.Available Flipflop (D Flipflop)
characteristic table Excitation table
Present Next
Inputs Present State Next State Inputs
state state
J K Qn Qn+1 Qn Qn+1 D
0 0 0
0 0 0 0
0 1 1
0 0 1 1 1 0 0
0 1 0 0 1 1 1
0 1 1 0
1 0 0 1
1 0 1 1
1 1 0 1
1 1 1 0

G RAVI KUMAR REDDY


3.Writing Excitation table

Excitation
Inputs Present state Next state
Inputs

J K Qn Qn+1 D
0 0 0 0 0
0 0 1 1 1
0 1 0 0 0
0 1 1 0 0
1 0 0 1 1
1 0 1 1 1
1 1 0 1 1
1 1 1 0 0

G RAVI KUMAR REDDY


4.Minimization
Boolean Expression for Excitation Input ‘ D ’

Fig: JK Flip flop design using D Flip flop G RAVI KUMAR REDDY
Implementing T Flipflop Using D flipflop
D flipflop to T Flipflop
1.Required Flipflop (T Flipflop ) 2.Available Flipflop (D Flipflop)
characteristic table Excitation table

Inputs Present state Next state Present State Next State Inputs
T Qn Qn+1
Qn Qn+1 D
0 0 0
0 0 0
0 1 1
0 1 1
1 0 1
1 0 0
1 1 0
1 1 1
3.Writing Excitation table

Inputs Present state Next state Excitation Inputs


T Qn Qn+1 D
0 0 0 0
0 1 1 1
1 0 1 1
1 1 0 0
G RAVI KUMAR REDDY
4.Minimization
Boolean Expression for Excitation Input ‘ D ’

D = T `Qn + TQn`
D=T Qn

OR

G RAVI KUMAR REDDY


Implementing SR Flipflop Using T flipflop
T flipflop to SR Flipflop
1.Required Flipflop (SR Flipflop ) 2.Available Flipflop (T Flipflop)
characteristic table Excitation table
Present Next
Inputs Present State Next State Inputs
state state
Qn Qn+1 T
S R Qn Qn+1
0 0 0
0 0 0 0
0 1 1
0 0 1 1 1 0 1
0 1 0 0 1 1 0

0 1 1 0
1 0 0 1
1 0 1 1
1 1 0 X
1 1 1 X

G RAVI KUMAR REDDY


3.Writing Excitation table

Present Next Excitation


Inputs
state state Inputs
S R Qn Qn+1 T
0 0 0 0 0
0 0 1 1 0
0 1 0 0 0
0 1 1 0 1
1 0 0 1 1
1 0 1 1 0
1 1 0 X X
1 1 1 X X

G RAVI KUMAR REDDY


4.Minimization
Boolean Expression for Excitation Input ‘ T ’

G RAVI KUMAR REDDY


Implementing JK Flipflop Using T flipflop
T flipflop to JK Flipflop
1.Required Flipflop (JK Flipflop ) 2.Available Flipflop (T Flipflop)
characteristic table Excitation table
Present Next
Inputs Present State Next State Inputs
state state
Qn Qn+1 T
J K Qn Qn+1
0 0 0
0 0 0 0 0 1 1
0 0 1 1 1 0 1
0 1 0 0 1 1 0

0 1 1 0
1 0 0 1
1 0 1 1
1 1 0 1
1 1 1 0

G RAVI KUMAR REDDY


3.Writing Excitation table

Excitation
Inputs Present state Next state
Inputs

J K Qn Qn+1 T
0 0 0 0 0
0 0 1 1 0
0 1 0 0 0
0 1 1 0 1
1 0 0 1 1
1 0 1 1 0
1 1 0 1 1
1 1 1 0 1
G RAVI KUMAR REDDY
4.Minimization
Boolean Expression for Excitation Input ‘ T ’

G RAVI KUMAR REDDY


Implementing D Flipflop Using T flipflop
T flipflop to D Flipflop
1.Required Flipflop (D Flipflop ) 2.Available Flipflop (T Flipflop)
characteristic table Excitation table

Inputs Present state Next state Present State Next State Inputs
D Qn Qn+1 Qn Qn+1 T
0 0 0 0 0 0
0 1 0 0 1 1
1 0 1 1 0 1
1 1 1 1 1 0

3.Writing Excitation table

Inputs Present state Next state Excitation Inputs


D Qn Qn+1 T
0 0 0 0
0 1 0 1
1 0 1 1
1 1 1 0
G RAVI KUMAR REDDY
4.Minimization
Boolean Expression for Excitation Input ‘ D ’

T = D `Qn + DQn`
T=D Qn

G RAVI KUMAR REDDY

You might also like