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

Author

Zarowski, Christopher J.

Author_Institution

Dept. of Electr. Eng., Queen´´s Univ., Kingston, Ont., Canada

Volume

44

Issue

7

fYear

1995

fDate

7/1/1995 12:00:00 AM

Firstpage

930

Lastpage

932

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²) 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)

Keywords

Reed-Solomon codes; block codes; computational complexity; decoding; error correction codes; parallel algorithms; 2t processors; BMA; Bose-Chaudhuri-Hocquenghem block error control codes; Reed-Solomon decoding; Schur BMA; Schur Berlekamp-Massey algorithm; error locator polynomial; linearly connected array; linearly connected processor array; parallel implementation; sequential computer; t-error correcting code; time complexity; Computer errors; Concurrent computing; Decoding; Equations; Parallel algorithms; Polynomials; Reed-Solomon codes; Registers; Signal processing; Terminology;

fLanguage

English

Journal_Title

Computers, IEEE Transactions on

Publisher

ieee

ISSN

0018-9340

Type

jour

DOI

10.1109/12.392862

Filename

392862