New serial architecture for the Berlekamp-Massey algorithm
- 1 April 1999
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 47 (4) , 481-483
- https://doi.org/10.1109/26.764911
Abstract
We propose a new efficient serial architecture to implement the Berlekamp-Massey algorithm, which is frequently used in BCH and Reed-Solomon decoders. An inversionless Berlekamp-Massey algorithm is adopted which not only elimi- nates the finite-field inverter but also introduces additional par- allelism. We discover a clever scheduling of three finite-field mul- tipliers to implement the algorithm very efficiently. Compared to a previously proposed serial Berlekamp-Massey architecture, our technique significantly reduces the latency.Keywords
This publication has 9 references indexed in Scilit:
- VLSI design of inverse-free Berlekamp—Massey algorithmIEE Proceedings E Computers and Digital Techniques, 1991
- Simplified procedure for correcting both errors and erasures of Reed-Solomon code using Euclidean algorithmIEE Proceedings E Computers and Digital Techniques, 1988
- Architecture for VLSI Design of Reed-Solomon DecodersIEEE Transactions on Computers, 1984
- Continued fractions and Berlekamp's algorithmIEEE Transactions on Information Theory, 1979
- A method for solving key equation for decoding goppa codesInformation and Control, 1975
- Inversionless decoding of binary BCH codesIEEE Transactions on Information Theory, 1971
- Shift-register synthesis and BCH decodingIEEE Transactions on Information Theory, 1969
- Polynomial Codes Over Certain Finite FieldsJournal of the Society for Industrial and Applied Mathematics, 1960
- On a class of error correcting binary group codesInformation and Control, 1960