DocumentCode
1497361
Title
Incomplete locator polynomials and redundant iterations reduction in the Welch-Berlekamp algorithm
Author
Xin, D.
Author_Institution
Fudan Univ., Shanghai, China
Volume
145
Issue
6
fYear
1998
fDate
12/1/1998 12:00:00 AM
Firstpage
402
Lastpage
405
Abstract
A concept named `incomplete locator polynomial´ is introduced as a replacement for the traditional approach. Theorems for finding the incomplete locators were established when the Welch-Berlekamp algorithm (1986) was employed for decoding Reed-Solomon codes, and an incomplete iteration strategy of decoding Reed-Solomon codes, based on finding incomplete locator polynomials is presented, by which the redundant iterations in the Welch-Berlekamp algorithm are reduced significantly
Keywords
Reed-Solomon codes; iterative decoding; polynomials; Reed-Solomon codes; Welch-Berlekamp algorithm; decoding; incomplete locator polynomials; redundant iterations reduction;
fLanguage
English
Journal_Title
Communications, IEE Proceedings-
Publisher
iet
ISSN
1350-2425
Type
jour
DOI
10.1049/ip-com:19982450
Filename
757182
Link To Document