Parallel implementation of the Schur Berlekamp-Massey algorithm on a linearly connected processor array

Abstract

The Berlekamp-Massey algorithm (BMA) (E. Berlekamp, 1968; J. Massey, 1969) is important in the decoding of Reed-Solomon (RS), and more generally, Bose-Chaudhuri-Hocquenghem (BCH) block error control codes. For a t-error correcting code the BMA has time complexity O(t/sup 2/) when implemented on a sequential computer. However, the BMA does not run efficiently on a parallel computer. The BMA can be mapped into the Schur BMA. The paper presents the implementation of the BMA and Schur BMA together on a linearly connected array of 2t processors. The resulting machine computes the error locator polynomial with a time complexity of O(t). >