Section B - Answer two questions out of B1, B2, and B3 from this section 0 1 4 1 Reset 2 3 Question B1 А B 51 4-bit Coun

[answerhappygod]

1 (132.74 KiB) Viewed 63 times

Section B - Answer two questions out of B1, B2, and B3 from this section 0 1 4 1 Reset 2 3 Question B1 А B 51 4-bit Counter Figure B1a shows a state diagram for a digital circuit that produces a 3-bit pattern. Assume that a synchronous counter is to be designed that produces the 3-bit output sequence shown in figure B1a. -- Encoder SO D Reset 0 4 0 Figure B1b Assuming that the 4-bit counter is already available and designed, make use of K- maps simplification technique, and obtain minimised sum of products Boolean equations describing the Encoder. To do that, consider the counter values (while circles in Figure B1b) as input in K-map and assume that any unused states can be treated as 'don't care' states. 4 2. 0 Figure B1a (d) Write down the equations in your answer book and attach the K-maps and draw the circuit diagram of the encoder. (a) Write down a state table showing the binary output sequence of the circuit, listed in the same order that they occur on the state diagram. (4 marks) Use the following block instead of the counter: Clk A B (b) Briefly describe any changes to the state diagram that may be necessary, to make the design realisable. Illustrate your proposed changes by drawing a modified version of the state diagram. (4 marks) 4-bit Counter O up to 9 с D Rst (c) Answer the following questions: i. How many D-type flip-flops would you need to implement the modified diagram? ii. How many possible states are needed to be taken into account? ili. What would be the size of the K-map? (4 marks) (13 marks) [B1 total: 25 marks] To avoid the extra work required to solve this problem, instead of solving the original problem, use a simple 4-bit counter which counts from 0 to 9 (white circles shown in Figure B1b), and an encoder to map the counter outputs to the actual states (blue rectangles shown in Figure B1b).