A On The Matrix Berlekamp-Massey Algorithm
نویسنده
چکیده
We analyze the Matrix Berlekamp/Massey algorithm, which generalizes the Berlekamp/Massey algorithm [Massey 1969] for computing linear generators of scalar sequences. The Matrix Berlekamp/Massey algorithm computes a minimal matrix generator of a linearly generated matrix sequence and has been first introduced by [Rissanen 1972a], [Dickinson et al. 1974] and [Coppersmith 1994]. Our version of the algorithm makes no restrictions on the rank and dimensions of the matrix sequence. We also give new proofs of correctness and complexity for the algorithm, which is based on self-contained loop invariants and includes an explicit termination criterion for a given determinantal degree bound of the minimal matrix generator.
منابع مشابه
Generalised Berlekamp-Massey algorithm
The BerlekampMassey algorithm is revisited and proven again by using the matrix representation. This approach makes the derivation and proof of the algorithm straightforward, simple and easily understood. It further enables the presentation of a generalised Berlekamp Massey algorithm, including the conventional algorithm and the inversion-free algorithm as two special cases. -,
متن کاملA Fraction Free Matrix Berlekamp/Massey Algorithm*
We describe a fraction free version of the Matrix Berlekamp/Massey algorithm. The algorithm computes a minimal matrix generator of linearly generated square matrix sequences over an integral domain. The algorithm performs all operations in the integral domain, so all divisions performed are exact. For scalar sequences, the matrix algorithm specializes to a more efficient algorithm than the algo...
متن کاملEffective method for coding and decoding RS codes using SIMD instructions
a method is introduced for efficient encoding and decoding of the Reed-Solomon codes based on the matrix formalism. In this ideology, a method is suggested for vectorization of the Berlekamp-Massey algorithm for detecting and correcting several silent data corruptions. The results of comparison of suggested method with other knows ways of decoding RS codes are presented. This approach requires ...
متن کاملThe Berlekamp-Massey Algorithm and the Euclidean Algorithm: a Closer Link
The two primary decoding algorithms for Reed-Solomon codes are the Berlekamp-Massey algorithmand the Sugiyama et al. adaptation of the Euclidean algorithm, both designed to solve a key equation. In this article an alternative version of the key equation and a newway to use the Euclidean algorithm to solve it are presented, which yield the Berlekamp-Massey algorithm. This results in a new, simpl...
متن کاملNew permutation codes using Hadamard unscrambling
Another viewpoint is presented on the derivation of theBerlekamp-Massey algorithm. Our approach differs from previous ones inthe following manner. The properties of the shortest linear feedback shiftregister that generates a given sequence are first derived without referenceto the Berlekamp-Massey algorithm. The Berlekamp-Massey algorithm isthen derived using these propertie...
متن کامل