ECE620_hw5sol

ECE620_hw5sol - b) State assignment: Let: 1, 3 A; 2, 4 B;...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
ECE 620 Dr. R. ROOSTA H.W # 5 SOLUTIONS P1) Primitive Flow Map : x1x2 00 01 11 10 1 1 2 -- 3 2 1 2 4 -- 3 1 -- 5 3 4 -- 2 4 6 5 -- 2 5 7 6 1 -- 8 6 7 1 -- 5 7 8 -- 2 8 6 From either state 5 or 6, the output should remain 1 as long as x1 remains 1, regardless of further changes in x2. So, we provide states 7 and 8 , both with z = 1, such that the circuit with cycle between 5 and 7 or 6 and 8, for consecutive changes in x2. A change of x1 to 0 will take 6 or 7 to 1, and 5 or 8 to 2. P2) a). Compatible states: By inspection above flow table, we found : 1 3; 2 4; 5 6 ~ 7 ~ 8 .
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: b) State assignment: Let: 1, 3 A; 2, 4 B; 5, 6, 7, 8 C. c) Reduced state table: 0 0 0 1 1 1 1 0 A A , 0 B C A , 0 B A B , 0 B , 0 C C A B C , 1 C , 1 P3) The primitive flow table of the machine with the given word description is as follows : x 1 x 2 0 0 0 1 1 1 1 0 1 , 00 2 3 2 1 , 01 4 3 1 5 , 10 4 6 , 01 7 5 8 , 10 9 6 1 , 10 5 7 1 10 , 11 8 1 , 11 10 9 1 11 , 00 10 13 , 11 12 11 2 , 00 3 12 1 4 , 01 13 1 , 00 11 P4) Universal 8-state connected row set state assignment:...
View Full Document

This note was uploaded on 02/27/2010 for the course ECE 620 taught by Professor Raminroosta during the Spring '10 term at CSU Northridge.

Page1 / 2

ECE620_hw5sol - b) State assignment: Let: 1, 3 A; 2, 4 B;...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online