Title :
Euclid´s algorithm and LFSR synthesis
Author_Institution :
Dept. of Comput. Sci. & Software Eng., Melbourne Univ., Parkville, Vic., Australia
Abstract :
We consider two methods of Euclid´s algorithm to solve the linear feedback shift register (LFSR) synthesis problem. One of the methods is identically equivalent to the celebrated Berlekamp-Massey (B-M) algorithm. The other method is distinctly Euclidean. The formulation of the problem from Euclid´s algorithm leads to the characterization of the LFSR synthesis for the reverse sequence given the LFSR synthesis for the forward sequence
Keywords :
binary sequences; Berlekamp-Massey algorithm; Euclid´s algorithm; Euclidean method; LFSR synthesis; forward sequence; linear feedback shift register synthesis; reverse sequence; Algorithm design and analysis; Australia Council; Computer science; Feedback; Galois fields; Polynomials; Software algorithms; Software engineering; Tin;
Conference_Titel :
Information Theory, 2000. Proceedings. IEEE International Symposium on
Conference_Location :
Sorrento
Print_ISBN :
0-7803-5857-0
DOI :
10.1109/ISIT.2000.866718
