3. Finite State Machine. Using a ROM based finite state machine (FSM), design a bi-directional repetitive 3-bit modulo-6 (0,1,2,3,4,5) counter (see Table 3). The design has one input named Dir and three outputs named B2, B1 and BO. The outputs (B2, B1 and BO) are dependent upon being in the present state only. After each clock pulse, when Dir is at logic "O', the outputs (B2, B1, BO) step through the count sequence in following order:- 0,1,2,3,4,5. After each clock pulse, when Dir is at logic "l'", the outputs (B2, B1, BO) step through the count sequence in following order:-5,4,3,2,1,0. Question 3 continues on the next page. 6E5Z1101_EC Page 5/8 Question 3 continued Table 3 Modulo-s Count sequence Count B2 B1 BO 0 0 0 1 1 0 0 1 2 3 4 5 OOO OO 0 0 0 1 1 (a) Draw the state diagram for the circuit described in Q3. (3 marks) (b) Create a state table for the state diagram for answer 23-la). (3 marks) (c) Update the state table for answer 03-(b) to include assigned state values and take account of any unused states. (5 marks) (d) Determine the size of the ROM required for the design. (2 marks) Determine the ROM's addresses (identify and include signal names) (2 marks) Determine the ROM's data (identify and include signal names). le) (f) 12 marks)

it Dir -0 olp sequence is 0,1,2,3,4,5. it Dir-l olp sequence is 5,4,3,2,1,0, state diagram :{p:6 :40:1 ipp:0 AP ilp:1 100 ifp1 ifp-o Mlima i/p: 1 imo 010 ilp=0 b state table (unaeed states not influded present stated B2B Noutstate Bel Bit Rd D, D. Po - - 10 0 0 - - 00 - 0 Q o - 0 0 0 0 0 O 10 - OTO O!! 10 l ดูแฯ state table: (Upatutado,=3,1,- tacitation went state is made 'o' it any present state is Unused steuta p present state not state (w) P2P Po B2B, BO B+ 3,4 Bet o - o O O 0 o o ) o - o 0 0 Il - o 0 0 0 0 0 00 00 o 1 0 1 O - a ol o 0 0 o 1 0 0 0 o - 0 0 11 10 0 o 1 0 0 0 equations for D2 ID, drobeing lomap solving! Dei 0,00 то а о о | 0 Няват, во то, в,0. ГФ) о | (мо No rommon о о Tirms) , , , 13, 0,00 P2 : я B.3, 3. t яв, 3130+32 В) По 1 и 2, В, Во Р.; Ово В.. то о: оо 1 оъ д о о (ро common monterns) а о 10 Di - (122, 1, 2) р, п32 3 во 1 и 3 по 1102 В,во +32 , пә Do Biro TIRL 11 - 0 - O 0 0 11 10 1 we should not do reduction, IL map is not atall needed. Because ROM used ill, Rom is Programable OR and Fimed AND contiguration, SO nerd all minterms minters needed foreach. (сма Р is only to know min terimg. Do = E(0,2,4,8,10,12) Gine of ROM needed is 2'x 3 EX 441!impet's 3 is no: otolp circuit diagram Uling ROM: Bi -D > h RO 11 D 13 14 BIPLA cloele addresses 5,6,7,9,14,15 not used in are Our RoM.The remaining need to realize addreeses are olpe DziDi, Do, .

3. Finite State Machine. Using a ROM based finite sta…

Answers

it Dir -0 olp sequence is 0,1,2,3,4,5. it Dir-l olp sequence is 5,4,3,2,1,0, state diagram :{p:6 :40:1 ipp:0 AP ilp:1 100 ifp

b state table (unaeed states not influded present stated B2B Noutstate Bel Bit Rd D, D. Po - - 10 0 0 - - 00 - 0 Q o - 0 0 0

Similar Solved Questions

1 answer

Brief Exercise 7-14 On March 20, Harbor's petty cash fund of $100 is replenished when the...

Brief Exercise 7-14 On March 20, Harbor's petty cash fund of $100 is replenished when the fund contains $41 in cash and receipts for postage $31, supplies $18, and travel expense $10 Prepare the journal entry to record the replenishment of the petty cash fund. (Credit account titles are automati...

3. Finite State Machine. Using a ROM based finite state machine (FSM), design a bi-directional repetitive...

Question:

Answers

Similar Solved Questions