AN ITERATIVE ALGORITHM OF SHIFT-REGISTER SYNTHESIS FOR MULTIPLE SEQUENCES
Guo Sheng Feng · 1985
Recently, in information theory and cybernetics the problem of the shortest-length linear shift-register synthesis for t sequences has attracted many researchers' interest and attention, but a better algorithm has not yet been found. In this paper, an iterative algorithm to find a shortest-length linear shift-register for multiple sequences is presented, and it is proved that the linear shift-register found by this algorithm is one with the shortest length. A necessary and sufficient condition for the uniqueness of the shortest-length linear shift-register is given and a set of all shortest-length linear shiftregisters will also be given if it is not unique. When t=1, the algorithm presented in this paper is just the famous Berlekamp-Massey algorithm.