By Topic

An approach to double error correcting Reed-Solomon decoding without Chien search

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Le-Ngoc, S. ; Fac. of Eng. & Appl. Sci., Memorial Univ. of Newfoundland, St. John''s, Nfld., Canada ; Zhenpen Young

A fast decoding algorithm for double error correcting Reed Solomon (RS) codes is presented. A new approach to the RS code decoding is introduced to eliminate the Chien search, to reduce substantially the root search time and hence to increase the decoding speed. It is interesting that the error locating time almost constant as the number of bits per symbol is increased. The algorithm finds suitable for microprocessor-based as well as VLSI implementations. Various RS codes are considered. Complexity, memory space and decoding time are all minimized as compared to the normal Chien search approach

Published in:

Circuits and Systems, 1993., Proceedings of the 36th Midwest Symposium on

Date of Conference:

16-18 Aug 1993