By Topic

An efficient recursive cell architecture of modified Euclid's algorithm for decoding Reed-Solomon codes

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)
Sang Seol Lee ; Dept. of Electr. Eng., Wonkwang Univ., Chonbuk, South Korea ; Moon Kyou Song

For decoding Reed-Solomon (RS) codes, the Belekamp-Messay algorithm, Euclid's algorithm and modified Euclid's algorithm (MEA) have been developed among which the MEA becomes the most popular decoding scheme. We propose an efficient recursive cell architecture suitable for the MEA. The proposed architecture uses about 25% less clock cycles required in the MEA operation than the conventional scheme. In addition, the number of recursive MEA cells can be reduced when the number of clock cycles spent in the MEA operation is larger than code word length n. Thereby buffer requirement for the received words can be reduced. For demonstration, the MEA circuitry for (128, 124) RS code has been described and the MEA operation is verified through VHDL modeling.

Published in:

Consumer Electronics, IEEE Transactions on  (Volume:48 ,  Issue: 4 )