in Digital Logic retagged by
469 views
3 votes
3 votes

Consider the following circuit :

If $A n, B n$ denote the next state corresponding to current states $A, B$ respectively, then
For this circuit, which of the following is/are true?

  1. $A n=A B+\overline{A} x \overline{y}$
  2. $B n=A B \overline{x}+x \overline{B}+A x y$
  3. The number of states in the state transition diagram of this circuit that have a transition back to the same state on some value of "$XY$ pair" is $4.$
  4. When $\mathrm{X}=0, \mathrm{Y}=0$ then the number of states in the state transition diagram of this circuit that have a transition back to the same state is $2 .$
in Digital Logic retagged by
469 views

1 Answer

2 votes
2 votes

Assume the uppar $JK$ flip flop(whose output is $A)$ is $J1, K1.$ And Lower $JK$ flip flop(whose output is $B)$ is $J2, K2.$
$\textbf{The flip flop input equations:}$
$$
\begin{aligned}
&J 1=x \oplus A \\
&K 1=\overline{B} \\
&J 2=x \\
&K 2=\overline{A}+x \overline{y}
\end{aligned}
$$

$\textbf{The State Equation:}$

The next state An is a function of $x, y, A, B$. The following is a set of min-terms of An :
$$
A n(x, y, A, B)=\Sigma m\{3,7,8,9,11,15\}
$$
From this, we can find the equation for An :
$$
A n=A B+\overline{A} x \overline{y}
$$
The next state $B n$ is a function of $x, y, A, B$. The following is a set of min-terms of $B n$ :
$$
\operatorname{Bn}(x, y, A, B)=\Sigma m\{3,7,8,10,12,14,15\}
$$
From this, we can find the equation for An :
$$
B n=A B \overline{x}+x \overline{B}+A x y
$$

$\textbf{The state diagram :}$

On Arrow, we have $XY.$ For example, from state $AB = 00,$ On $XY = 00,$ we go to state $00.$

edited by

4 Comments

@Deepak Poonia sir in this answer getting

An= (AB + A'x)

Bn= (B'x + ABx' + ABy) 

Plz see once.

1
1

@samarpita I am also getting the same answer

1
1

@Deepak Poonia sir please clarify first doubt raised by

uday_brahmi.

0
0
Answer:

Related questions