Unterschiede

Hier werden die Unterschiede zwischen zwei Versionen angezeigt.

--- introduction_to_digital_systems:sequential_logic [2022/12/16 16:54]
mexleadmin [Bearbeiten - Panel]
+++ introduction_to_digital_systems:sequential_logic [2023/02/05 02:06]
mexleadmin [Bearbeiten - Panel]
@@ Zeile 277: / Zeile 277: @@
-  * There are two transitions marked with $A$ and $B$. What values does the inputs need to have in order show all transistions explicitely?
+  * There are two transitions marked with $A$ and $B$. \\ What values does the inputs need to have in order show all transistions explicitely?
+<WRAP indent><WRAP indent>
+<button size="xs" type="link" collapse="Solution_6_1_1_1_Strategy">{{icon>eye}}Strategy</button><collapse id="Solution_6_1_1_1_Strategy" collapsed="true">
+  * Find the transitions wanted
+  * Look at which state these transitions starts.
+  * Which other transitions starts there?
+  * Which transition conditions are missing?
+</collapse> <button size="xs" type="link" collapse="Solution_6_1_1_1_Solution">{{icon>eye}}Solution</button><collapse id="Solution_6_1_1_1_Solution" collapsed="true">
+  * transition A
+    * Starts at state $000$
+    * Also transition with $11$, $00$ starts here
+    * $01$, $10$ are missing
+  * transition B
+    * Starts at state $010$
+    * Also transition with $0-$ starts here
+    * $1-$ are missing
+</collapse> <button size="xs" type="link" collapse="Solution_6_1_1_1_Result">{{icon>eye}}Result</button><collapse id="Solution_6_1_1_1_Result" collapsed="true">
+  * A: $01$, $10$
+  * B: $1-$
+</collapse>
+</WRAP></WRAP>
   * How many flipflops are necessary for such a Moore Machine?
+<WRAP indent><WRAP indent>
+<button size="xs" type="link" collapse="Solution_6_1_1_2_Strategy">{{icon>eye}}Strategy</button><collapse id="Solution_6_1_1_2_Strategy" collapsed="true">
+Each flipflop can store one Bit. Each stored bit can be used to address states. So, check the number of bits $i$ of states $Z_i$ ("size of the state vector"). \\
+Be aware, that one bit can address maximum 2 states, two bits maximum 4 states, three bits maximum 8 states and so on.
+</collapse> <button size="xs" type="link" collapse="Solution_6_1_1_2_Solution">{{icon>eye}}Solution</button><collapse id="Solution_6_1_1_2_Solution" collapsed="true">
+  * Number of bits $i$ of states $Z_i$ is given in the legend. The number of bits $i$ has also to fit to the number of states.
+  * Here the legend shows $Z_2, Z_1, Z_0$, so there are 3 bits.
+  * Also the number of states i the diagram are 5. This can only be numbered with at least 3 bits.
+</collapse> <button size="xs" type="link" collapse="Solution_6_1_1_2_Result">{{icon>eye}}Result</button><collapse id="Solution_6_1_1_2_Result" collapsed="true">
+</collapse>
+</WRAP></WRAP>
   * Fill in the missing cells in the following state transition table:
 {{drawio>STTexample1.svg}}
+<WRAP indent><WRAP indent>
+<button size="xs" type="link" collapse="Solution_6_1_1_3_Strategy">{{icon>eye}}Strategy</button><collapse id="Solution_6_1_1_3_Strategy" collapsed="true">
+Check for each line:
+  * What is the start/present state (given by the bits $\color{red}{Z_2(n), Z_1(n), Z_0(n)}$ in the line)?
+  * Which transition is shown start/present state (given by $\color{brown}{X_1, X_0}$)?
+Out of this orientation, the next columns can be derived:
+  * At the end of the transition, the next state can be found (necessary for columns $\color{green}{Z_2(n+1), Z_1(n+1), Z_0(n+1)}$)
+  * Within the state symbol of the present state, the output valuse can be found  (necessary for columns $\color{violet}{Y_2(n), Y_1(n), Y_0(n)}$)
+{{drawio>STTexample1_stategy.svg}}
+</collapse> <button size="xs" type="link" collapse="Solution_6_1_1_3_Result">{{icon>eye}}Result</button><collapse id="Solution_6_1_1_3_Result" collapsed="true">
+{{drawio>STTexample1_result.svg}}
+</collapse>
+</WRAP></WRAP>
 </WRAP></WRAP></panel>