By Topic

Speedier decoding of cyclic codes using chord properties

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
$33 $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

1 Author(s)
G. R. Redinbo ; Dept. of Electr. & Comput. Eng., California Univ., Davis, CA, USA

Finite-field transform quantities, appearing in typical cyclic code decoders, obey conjugacy-based relationships commonly called chord properties. It is demonstrated that these relationships may be used to significantly expedite error estimation by the decoder. The resulting speed-up factor is proportional to the degree of the extension field in which the code design is specified. BCH codes and standard decoder structures, either of the frequency-domain or time-domain type, are used to motivate, develop, and illustrate the underlying principles. Approximate estimates of the complexities and benefits of the proposed techniques are given. Finally, these chord-directed speed-up methods are extended to Reed-Solomon and other cyclic codes that use symbols in an extension field

Published in:

IEEE Transactions on Information Theory  (Volume:34 ,  Issue: 4 )