Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 5:00 PM ET (12:00 - 21:00 UTC). We apologize for the inconvenience.
By Topic

Optimizing Chien Search Usage in the BCH Decoder for High Error Rate Transmission

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

3 Author(s)
El-Din, R.F.T. ; Dept. of Eng. Phys. & Math., Ain Shams Univ., Cairo, Egypt ; El-Hassani, R.M. ; El-Ramly, S.H.

In hybrid automatic repeat request (HARQ), Bose-Chaudhuri-Hocquenghem (BCH) coders can be used before transmission over noisy channel. A sent message is retrieved correctly via decoding, whenever it is correctable. For uncorrectable message, a retransmission is requested by the receiver. In this paper, the detection time for uncorrectable words is reduced. In particular, “Chien” search usage is optimized. It is only used when all roots of the error locator polynomial belong to F*2m = GF(2m){0}. Two binary primitive narrow sense BCH codes are considered; the short length BCH(63,39,9) and the long length BCH(16383,16215,25) codes.

Published in:

Communications Letters, IEEE  (Volume:17 ,  Issue: 4 )