Timeline for FSM binary number divisible by 5 truth table
Current License: CC BY-SA 4.0
10 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Mar 19 at 4:07 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
Feb 17 at 6:24 | answer | added | greybeard | timeline score: 1 | |
Nov 27, 2020 at 20:19 | history | edited | anonymouseeeee | CC BY-SA 4.0 |
added 2 characters in body
|
Nov 27, 2020 at 19:02 | comment | added | anonymouseeeee | @ChrisStratton Yeah, they just mentioned in the class forum that it is supposed to be a rising-edge triggered D flip-flop | |
Nov 27, 2020 at 18:45 | history | edited | anonymouseeeee | CC BY-SA 4.0 |
added 351 characters in body
|
Nov 27, 2020 at 18:41 | comment | added | Chris Stratton | It seems like this problem statement is missing something, such as the clock to trigger sampling of the input data. In a practical sense of coping with a defective assignment, your greatest practical clue is probably the parity FSM they mention; effectively you can consider this thing an evolution of that thing, so whatever the official solution for that is will probably inform the shape of the expected solution for this. It's a pity teachers aren't more careful to state solid problems, however. | |
Nov 27, 2020 at 18:40 | comment | added | anonymouseeeee | From my understand, if both inputs are 1, then it doesn't matter. But, I am really confused about the instructions, which is why I am asking for help to verify whether or not my truth table is correct. | |
Nov 27, 2020 at 18:39 | history | edited | anonymouseeeee | CC BY-SA 4.0 |
added 131 characters in body
|
Nov 27, 2020 at 7:44 | comment | added | po.pe |
Why do you assign x to Qx' if both inputs are set? And why does the reminder change in some cases if D=0 ? And wouldn't the only state that would lead to Z=1 be if the current reminder is 1 0 0 and D=1 ?
|
|
Nov 27, 2020 at 3:37 | history | asked | anonymouseeeee | CC BY-SA 4.0 |