BRAIN Journal-A Synoptic of Software Implementation for Shift Registers Based on 16th Degree Primitive Polynomials-Figure 7. Ring Implementation for the Polynomial X6+X^12+X^3+X+1

<p>VlăduŃiu and Crişan (1989) show three types of schemes for a 4th degree polynomial. Similar to it, there were developed the three different implementations for the Primitive Polynomial X^16+X^12+X^3+X+1. It can be specified that these schemes are according to the well-known Galois Form, Fibonacci representation and some other Forms that are rarely used, called Ring Implementation. All of these Implementations have the same function, because they describe a linear feedback shift register. In the experimental work there has been analyzed the behavior of 14 Primitive Polynomial degrees, 16 randomly selected. For each of these polynomials there has been developed the simulation of the specific functioning with a program. Because the goal of this experimental work was to compare the different obtained results, a few rows of input data of a different length have been selected.&nbsp;&nbsp;</p>