Share Email Print
cover

Proceedings Paper

VLSI design of inverse-free Berlekamp-Massey algorithm for Reed-Solomon code
Author(s): Trieu-Kien Truong; Y. W. Chang; Jyh Horng Jeng
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

The inverse-free Berlekamp-Massey (BM) algorithm is the simplest technique for Reed-Solomon (RS) code to correct errors. In the decoding process, the BM algorithm is used to find the error locator polynomial with syndromes as the input. Later, the inverse-free BM algorithm is generalized to find the error locator polynomial with given erasure locator polynomial. By this means, the modified algorithm can be used for RS code to correct both errors and erasures. The improvement is achieved by replacing the input of the Berlekamp-Massey algorithm with the Forney syndromes instead of the syndromes. With this improved technique, the complexity of time domain RS decoders for correcting both errors and erasures is reduced substantially from previous approaches. In this paper, the register transfer language of this modified BM algorithm is derived and the VLSI architecture is presented.

Paper Details

Date Published: 20 November 2001
PDF: 3 pages
Proc. SPIE 4474, Advanced Signal Processing Algorithms, Architectures, and Implementations XI, (20 November 2001); doi: 10.1117/12.448651
Show Author Affiliations
Trieu-Kien Truong, I-Shou Univ. (Taiwan)
Y. W. Chang, I-Shou Univ. (Taiwan)
Jyh Horng Jeng, I-Shou Univ. (Taiwan)


Published in SPIE Proceedings Vol. 4474:
Advanced Signal Processing Algorithms, Architectures, and Implementations XI
Franklin T. Luk, Editor(s)

© SPIE. Terms of Use
Back to Top