ECE620_hw2sol

# ECE620_hw2sol - ECE 620 Dr R ROOSTA H.W 2 SOLUTIONS P1 step...

This preview shows pages 1–4. Sign up to view the full content.

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

View Full Document

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: ECE 620 Dr. R. ROOSTA H.W # 2 SOLUTIONS P1) step 1: Find MCC's a). pair chart: b). MCC’s: k S k L 6 － 6 5 6 56 4 5 45 3 46 36, 34 2 356 256, 236 1 246 14, 126 ∴ MCC's for this machine are: (126, 236, 256, 14, 34, 45) step 2: Find the prime compatible table PC Class Set PC CS 126 34, 45 126 34, 45 12 26 236 45 16 34, 26 256 14, 45 26 45 12 26 1 φ 16 34, 26 2 φ 23 φ 6 φ 25 φ 236 45 56 14 23 φ => 45 16 36 45 34 φ 3 φ 14 12 256 14, 45 1 φ 25 φ 6 φ 56 14 5 φ 45 16 4 φ 34 φ 14 12 Pre-PC Table Final PC Table step 3: find frequency count State 1 2 3 4 5 6 Frequency 5 6 3 3 4 6 Choice 4 5 1 2 3 6 Since, states 3 and 4 have minimal frequency number (3), we choose state 3 arbitrarily as the starting state of the Meisel tree. step 4: construct Meisel tree The PC's which contain state 3 are: 236, 23, 34. Therefore, the minimal closed cover is: {126, 34, 45} The reduced state table for this machine: I 1 I 2 I 3 (126) → A B, 0 C, 0 A, 0 (3 4) → B C, 1 A, 1 A, 0 (4 5) → C A, － A, 1 A, 0 P2) Ambiguity tree: 00 10 01 11 (can be a different state assignment) This is a finite-input-memory machine (whose present state is determined by a fixed number of preceding input and output values). Reading from bottom to top, let's construct the following of preceding input and output values)....
View Full Document

{[ snackBarMessage ]}

### Page1 / 9

ECE620_hw2sol - ECE 620 Dr R ROOSTA H.W 2 SOLUTIONS P1 step...

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

View Full Document
Ask a homework question - tutors are online