Cheap and Secure Web Hosting Provider : See Now

[Solved]: LFSR sequence computation

, , No Comments
Problem Detail: 

I need to calculate the output of the sequence generated by this shift register but I cannot find anywhere how to do it. Everywhere the results are just given but there is no explanation how to do compute them. I know the the sequence will repeat every 2^3-1=7 times. Could anyone explain me how to do it. Thank you.

enter image description here

Asked By : user1047517

Answered By : Arani

The answer seems to be simple:

First, we XOR the two least significant bits (LSB) to get the most significant bit. The two LSB are obtained by right-shifting. So, calculating in this way, we get the sequence 110, 111, 011, 001, 100, 010, 101.

Best Answer from StackOverflow

Question Source : http://cs.stackexchange.com/questions/3337

3.2K people like this

 Download Related Notes/Documents

0 comments:

Post a Comment

Let us know your responses and feedback