4. A company afraid that their intellectual property might be stolen by a revile comav and decodes all its communication. Each biù is encode within a string of garbage bits. To decose they must s...
4. A company afraid that their intellectual property might be stolen by a revile comav and decodes all its communication. Each biù is encode within a string of garbage bits. To decose they must strip the garbage bits away. The decoder only reads the bit following the sequence 0011 Example: The decoder decodes the string "010000110001010011100110" as 010 since 010000110001010011100110 This decoder can be implement by a finite-state automation shown in the state diagram on the right where State 5 outputs a "0" and State 6 outputs a "1" (a) (4 points) Complete the table below. Current State InputNext State State 1 State S 0 0 10 S 001 S2 01 00 S20 101 S100I (b) (6 points) Find the function Fi, either using logic variable of Boolean variable that determine the value oft-That is, find F; such that Fari. 22,23, 1) (c) (1 point) Decode the string: 01010000111010001100100111 yi
4. A company afraid that their intellectual property might be stolen by a revile comav and decodes all its communication. Each biù is encode within a string of garbage bits. To decose they must strip the garbage bits away. The decoder only reads the bit following the sequence 0011 Example: The decoder decodes the string "010000110001010011100110" as 010 since 010000110001010011100110 This decoder can be implement by a finite-state automation shown in the state diagram on the right where State 5 outputs a "0" and State 6 outputs a "1" (a) (4 points) Complete the table below. Current State InputNext State State 1 State S 0 0 10 S 001 S2 01 00 S20 101 S100I (b) (6 points) Find the function Fi, either using logic variable of Boolean variable that determine the value oft-That is, find F; such that Fari. 22,23, 1) (c) (1 point) Decode the string: 01010000111010001100100111 yi