Using the following state diagram, construct the state table without encoding: 1/0 A 1/0 0/0 A...

   

Transcribed Image Text:

Using the following state diagram, construct the state table without encoding: 1/0 A 1/0 0/0 A B B C D 0/0 1/0 0/1 0/0 Current State Input Next State 0 0 0 0 1/0 B C C B D Output 0 0 0 1 Activa Go to Se O Current State Input Next State 0 A A B B C C DO A A B B C C D D Current State A A B B C C D D 0 1 0 1 0 1 0 1 Current State Input Next State 0 1 1 0 1 0 1 Input 0 1 0 1 0 1 0 1 A B A с D B A C A C D C A B B A Next State B A C A C D B Output 0 Output 0 0 0 0 0 0 1 0 1 1 1 0 0 0 0 Output 0 1 0 1 0 0 1 0 O 0 0 1 1 1 1 0 1 Current State Input Next State Output Q₁ Qo X Q1* Qo* Z 0 0 0 0 0 0 0 1 0 1 0 0 1 1 Current State Q₁ Qo 0 0 0 1 1 1 1 0 0 1 1 0 1 0 1 0 1 0 0 1 1 0 Input X 0 0 0 1 0 QUESTION 2 Using encoding, reconstruct the following state table of a sequence detector circuit. Current State Input Next State A A 0 A 1 B 0 B 1 C C D D 1 0 1 1 1 0 1 0 1 0 1 0 0 0 0 0 Next State Output Q1* Qo* 0 0 0 0 1 0 0 1 NOOOO 0 0 0 0 31 0 0 1 0 1 BUBADCB > Current State Input X 0 1 0 1 0 1 0 1 Q₁ 0 0 1 1 0 0 1 1 Q₁ 0 0 0 0 Output 0 0 0 0 0 0 0 1 1 1 1 1 Qo 0 1 0 1 0 1 0 1 Qo 0 0 1 1 0 0 1 1 X 0 1 0 1 0 1 0 1 Next State Output Q1* Qo* 0 0 0 1 0 0 1 1 0 Q1* 0 0 1 0 0 1 1 0 1 0 1 0 1 0 1 11 Qo* 0 1 0 1 0 1 0 1 Z 0 0 0 0 0 0 0 1 Z 0 1 0 1 0 1 0 1 O O Current State Input Qo X 0 0 Q₁ 0 0 0 0 1 1 1 1 I Q₁ 0 0 0 0 1 1 1 1 1 1 0 0 1 1 Current State Qo 0 0 1 1 0 0 1 1 0 1 0 1 0 1 0 1 Input X 0 1 0 1 0 1 0 1 0 1 0 0 1 1 0 Next State FF inputs Q1* Qo* T₁ To 0 0 0 0 1 0 1 0 Using T FFs, reconstruct the following state table by computing the FF inputs: 0 1 1 0 0 1 QUESTION 3 0 1 0 1 Current State Input Qo X 0 0 1 0 1 0 1 Q₁ 0 0 0 0 1 1 1 1 1 0 1 0 1 0 1 1 0 1 0 1 0 0 1 1 1 0 1 Next State FF inputs Q1* Qo* T₁ 0 0 0 1 0 1 1 0 0 1 1 1 1 1 1 1 1 To 1 0 1 1 1 0 0 1 1 1 0 1 Next State Q1* Qo* 0 0 0 1 0 0 1 1 0 1 0 1 0 1 0 - 1 Current State | Input | Next State Qo X Q1* Qo* 0 0 0 0 0 1 0 1 0 1 0 Q1 0 0 0 0 1 1 1 1 Q1 0 0 0 0 1 1 Current State Input Qo X 0 0 0 1 1 1 0 0 1 1 1 0 0 1 1 1 1 1 0 1 0 0 1 0 1 0 1 1 0 1 1 0 0 1 1 0 0 1 0 1 1 0 Next State FF inputs Q1* Qo* T₁ To 0 0 1 0 0 1 1 1 0 1 1 1 0 0 0 1 0 0 1 rr inputs T₁ 0 0 1 0 1 0 0 1 0 1 1 0 1 1 0 1 1 1 To 0 0 0 0 0 1 1 1 Using the following state diagram, construct the state table without encoding: 1/0 A 1/0 0/0 A B B C D 0/0 1/0 0/1 0/0 Current State Input Next State 0 0 0 0 1/0 B C C B D Output 0 0 0 1 Activa Go to Se O Current State Input Next State 0 A A B B C C DO A A B B C C D D Current State A A B B C C D D 0 1 0 1 0 1 0 1 Current State Input Next State 0 1 1 0 1 0 1 Input 0 1 0 1 0 1 0 1 A B A с D B A C A C D C A B B A Next State B A C A C D B Output 0 Output 0 0 0 0 0 0 1 0 1 1 1 0 0 0 0 Output 0 1 0 1 0 0 1 0 O 0 0 1 1 1 1 0 1 Current State Input Next State Output Q₁ Qo X Q1* Qo* Z 0 0 0 0 0 0 0 1 0 1 0 0 1 1 Current State Q₁ Qo 0 0 0 1 1 1 1 0 0 1 1 0 1 0 1 0 1 0 0 1 1 0 Input X 0 0 0 1 0 QUESTION 2 Using encoding, reconstruct the following state table of a sequence detector circuit. Current State Input Next State A A 0 A 1 B 0 B 1 C C D D 1 0 1 1 1 0 1 0 1 0 1 0 0 0 0 0 Next State Output Q1* Qo* 0 0 0 0 1 0 0 1 NOOOO 0 0 0 0 31 0 0 1 0 1 BUBADCB > Current State Input X 0 1 0 1 0 1 0 1 Q₁ 0 0 1 1 0 0 1 1 Q₁ 0 0 0 0 Output 0 0 0 0 0 0 0 1 1 1 1 1 Qo 0 1 0 1 0 1 0 1 Qo 0 0 1 1 0 0 1 1 X 0 1 0 1 0 1 0 1 Next State Output Q1* Qo* 0 0 0 1 0 0 1 1 0 Q1* 0 0 1 0 0 1 1 0 1 0 1 0 1 0 1 11 Qo* 0 1 0 1 0 1 0 1 Z 0 0 0 0 0 0 0 1 Z 0 1 0 1 0 1 0 1 O O Current State Input Qo X 0 0 Q₁ 0 0 0 0 1 1 1 1 I Q₁ 0 0 0 0 1 1 1 1 1 1 0 0 1 1 Current State Qo 0 0 1 1 0 0 1 1 0 1 0 1 0 1 0 1 Input X 0 1 0 1 0 1 0 1 0 1 0 0 1 1 0 Next State FF inputs Q1* Qo* T₁ To 0 0 0 0 1 0 1 0 Using T FFs, reconstruct the following state table by computing the FF inputs: 0 1 1 0 0 1 QUESTION 3 0 1 0 1 Current State Input Qo X 0 0 1 0 1 0 1 Q₁ 0 0 0 0 1 1 1 1 1 0 1 0 1 0 1 1 0 1 0 1 0 0 1 1 1 0 1 Next State FF inputs Q1* Qo* T₁ 0 0 0 1 0 1 1 0 0 1 1 1 1 1 1 1 1 To 1 0 1 1 1 0 0 1 1 1 0 1 Next State Q1* Qo* 0 0 0 1 0 0 1 1 0 1 0 1 0 1 0 - 1 Current State | Input | Next State Qo X Q1* Qo* 0 0 0 0 0 1 0 1 0 1 0 Q1 0 0 0 0 1 1 1 1 Q1 0 0 0 0 1 1 Current State Input Qo X 0 0 0 1 1 1 0 0 1 1 1 0 0 1 1 1 1 1 0 1 0 0 1 0 1 0 1 1 0 1 1 0 0 1 1 0 0 1 0 1 1 0 Next State FF inputs Q1* Qo* T₁ To 0 0 1 0 0 1 1 1 0 1 1 1 0 0 0 1 0 0 1 rr inputs T₁ 0 0 1 0 1 0 0 1 0 1 1 0 1 1 0 1 1 1 To 0 0 0 0 0 1 1 1