On the Minimal Realizations of a Finite Sequence

We develop a theory of minimal realizations of a finite sequence over an integral domain R, from first principles. Our notion of a minimal realization is closely related to that of a linear recurring sequence and of a partial realization (as in Mathematical Systems Theory). From this theory, we derive Algorithm MR. which computes a minimal realization of a sequence of L elements using at most L(5L + 1)/2 R-multiplications. We also characterize all minimal realizations of a given sequence in terms of the computed minimal realization.This algorithm computes the linear complexity of an R sequence, solves non-singular linear systems over R (extending Wiedemann's method), computes the minimal polynomial of an R-matrix, transfer/growth functions and symbolic Pade approximations. There are also a number of applications to Coding Theory.We thus provide a common framework for solving some well-known problems in Systems Theory, Symbolic/Algebraic Computation and Coding Theory.

[1]  W. F. Trench.  An Algorithm for the Inversion of Finite Toeplitz Matrices , 1964 .

[3]  Robert J. McEliece,et al.  The Theory of Information and Coding , 1979 .

[4]  Michael K. Sain,et al.  Minimal Torsion Spaces and the Partial Input/Output Problem , 1975, Inf. Control..

[5]  Rudolf Lide,et al.  Finite fields , 1983 .

[6]  Graham H. Norton.  Some Decoding Applications of Minimal Realization , 1995, IMACC.

[7]  Gui Liang Feng,et al.  A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes , 1991, IEEE Trans. Inf. Theory.

[8]  Chingwo Ma,et al.  A simple Hankel interpretation of the Berlekamp-Massey algorithm , 1989 .

[9]  Yasuo Sugiyama,et al.  An algorithm for solving discrete-time Wiener-Hopf equations based upon Euclid's algorithm , 1986, IEEE Trans. Inf. Theory.

[10]  Wataru Yoshida,et al.  A simple derivation of the Berlekamp- Massey algorithm and some applications , 1987, IEEE Trans. Inf. Theory.

[11]  Dai Zongduo,et al.  A relationship between the Berlekamp-Massey and the euclidean algorithms for linear feedback shift register synthesis , 1988 .

[12]  Harald Niederreiter,et al.  Sequences With Almost Perfect Linear Complexity Profile , 1987, EUROCRYPT.

[13]  Grazia Lotti.  Fast Solution of Linear Systems with Polynomial Coefficients over the Ring of Integers , 1992, J. Algorithms.

[14]  N. J. A. Sloane,et al.  Shift-Register Synthesis (Modula m) , 1985, CRYPTO.

[15]  Linear recurring sequences and the path weight enumerator of a convolutional code , 1991 .

[16]  B. Dickinson,et al.  A minimal realization algorithm for matrix sequences , 1973, CDC 1973.

[17]  W. H. Mills.  Continued fractions and linear recurrences , 1975 .

[18]  Paul Camion.  An Iterative Euclidean Algorithm , 1987, AAECC.

[19]  Robert A. Scholtz,et al.  Continued fractions and Berlekamp's algorithm , 1979, IEEE Trans. Inf. Theory.

[20]  Eduardo D. Sontag,et al.  On the Existence of Minimal Realizations of Linear Dynamical Systems over Noetherian Integral Domains , 1979, J. Comput. Syst. Sci..

[21]  Shojiro Sakata,et al.  Extension of the Berlekamp-Massey Algorithm to N Dimensions , 1990, Inf. Comput..

[22]  Jean Louis Dornstetter.  On the equivalence between Berlekamp's and Euclid's algorithms , 1987, IEEE Trans. Inf. Theory.

[23]  Wai-Kai Chen,et al.  Linear Networks and Systems , 1983 .

[24]  Graham H. Norton,et al.  On n-Dimensional Sequences I , 1995, J. Symb. Comput..

[25]  Graham H. Norton,et al.  A new algebraic algorithm for generating the transfer function of a trellis encoder , 1995, IEEE Trans. Commun..

[26]  Elwyn R. Berlekamp,et al.  Algebraic coding theory , 1984, McGraw-Hill series in systems science.

[27]  James L. Massey,et al.  Shift-register synthesis and BCH decoding , 1969, IEEE Trans. Inf. Theory.

[28]  R. Blahut.  Theory and practice of error control codes , 1983 .

[29]  Douglas H. Wiedemann.  Solving sparse linear equations over finite fields , 1986, IEEE Trans. Inf. Theory.