Question

Question 3 40 pts The owner of a store is about to do a grand reopening. She has purchased a "Welcome sign that lights up with different colors depending on the binary sequence it receives The entire sign lights up with a color, stays on with that color for a foved amount of time, then after the same fixed amount of time the sign shut off, then lights up with the next color for the same fixed amount of time, then continues the process until all colors are displayed. Then the sign should start lighting up in that order over again. Design the digital control unit for this sign, so that the sign is lit up, "blue" (using value 001), then "purple" (using value 010), then "pink" (using value 100), and lastly "orange" (using value 101) before it starts over again. Your digital circuit design for the control unit for this sign must be implemented using D-flipflops, your answer must include: The state graph (be detailed and contain all proper directions, labels, and values) The next state truth table (needs to include the next-state and the logic for the flipflops) The K-maps for next-state equation and the K-maps for the logic gates connected to the flipflops Determine the optimal SoP next state equations and the optimal SoPequations for the logic gate(s) connected to the flipflops Lastly, draw the digital circuit of the control unit for the Welcome sign Upload Choose a File

Answer 1

S (4,5)+ d (0,3,6,7) A B C blue OO! Purple 010 pink do 101 orange ţ state-Graph blue purple colo) (001) pink orange (101) 100 (ы state Transition grap table: Next state f lip-flop inputs Present state Dc DB DA B + At C CX B A o 0 o 0 0 0 o - 0 o 0 0 0 0 0 o 1 O 0 0 Boolean functions for next states Ata DA= {(2, 4)+ d(0,3, 6, 7) d10,3,6,7) {(1) + 8+ DB eta Dc =

k maps BC li 10 10 IBC 0001 11 ܐ ܘ ܝܘ ܩ A A Х x X X X x x X V - At=DA = Bt. Po = Ā B IBC Il 10 ܐ ܘ ܘ ܘ X С. taoca x x - logic Diagram C Dc B DA DB A. B clk Fora