Self-shrinking Generator - Example

Example

This example will use the connection polynomial x8 + x4 + x3 + x2 + 1, and an initial register fill of 1 0 1 1 0 1 1 0.

Below table lists, for each iteration of the LFSR, its intermediate output before self-shrinking, as well as the final generator output. The tap positions defined by the connection polynomial are marked with blue headings. The state of the zeroth iteration represents the initial input.

Iteration # 8 7 6 5 4 3 2 1 Intermediate output Generator output
0 1 0 1 1 0 1 1 0 N/A N/A
1 1 1 0 1 1 0 1 1 0 N/A
2 1 1 1 0 1 1 0 1 1
3 1 1 1 1 0 1 1 0 1 0
4 1 1 1 1 1 0 1 1 0

At the end of four iterations, the following sequence of intermediate bits is produced: 0110.

The first pair of bits, 01, is discarded since it does not match either 10 or 11. The second pair of bits, 10, matches the second step of the algorithm so a zero is output.

More bits are created by continuing to clock the LFSR and shrinking its output as described above.

Read more about this topic:  Self-shrinking Generator

Famous quotes containing the word example:

    Our intellect is not the most subtle, the most powerful, the most appropriate, instrument for revealing the truth. It is life that, little by little, example by example, permits us to see that what is most important to our heart, or to our mind, is learned not by reasoning but through other agencies. Then it is that the intellect, observing their superiority, abdicates its control to them upon reasoned grounds and agrees to become their collaborator and lackey.
    Marcel Proust (1871–1922)