Please use this identifier to cite or link to this item:
Title: A hardware analysis of the fundamental iterative algorithm for decoding a (17,9) binary BCH code
Authors: Mississippi State University. Department of Electrical Engineering.
Campbell, Roy L., 1942-
Keywords: Berlekamp-Massey Algorithm
Fundamental Iterative Algorithm
Computer algorithms
Publisher: Information Technology Laboratory (U.S.)
Engineer Research and Development Center (U.S.)
Series/Report no.: Technical report (U.S. Army Engineer Waterways Experiment Station) ; ITL-96-7.
Description: Technical Report
Abstract: The Berlekamp-Massey Algorithm (BMA) is commonly used in BCH decoding, but the Fundamental Iterative Algorithm (FIA) can, in many instances, correct more errors. The trade-off lies in hardware complexity. The BMA has concise stages that do not require addressable memory, whereas the FIA struggles with memory management and complex stages. For the (17,9) BCH code over GF(256) with 𝑔(𝑥)=𝑚₁(𝑥), the FIA can correct up to two errors, but the BMA can correct only one error. Also, for a BER of 10⁻⁵, the coding gains for the BMA and FIA are -.25dB and 1.4dB, respectively, which makes the FIA seem to be the better algorithm. The main drawback is the FIA is approximately 20 times more complex than the BMA. Also, the FIA does not have a critical path that is easily identified.
Rights: Approved for public release; distribution is unlimited.
Appears in Collections:Technical Report

Files in This Item:
File Description SizeFormat 
411.pdf872.49 kBAdobe PDFThumbnail