ECC with BCH Algorithm
Bose-Chaudhuri-Hocquenghem, or BCH codes are a particular example of linear, cyclic, block codes. They are widely used due to their relatively strong correction capabilities and they can deal with randomly distributed errors. The encoding process for BCH does not introduce any additional latency. The initial step in the correction process generates a single error locator polynomial (ELP). The degree of this ELP indicates how many bits are in error in the code word. If the degree of the ELP is greater than the capability of the code, then too many errors have been received and the code word is flagged as uncorrectable. If the degree is less than or equal to the maximum correction capability, then it is generally possible to find and fix the errors. Once a valid ELP is found, this can be directly used to determine the locations of the bit errors. Since binary BCH codes are used, correcting the identified errors is done by flipping the bit at the error locations. The IPC-BL119A-ZM has the capability to parallelize this search by splitting up the field into multiple segments.
The IntelliProp ECC core can be customized to support a wide range of possible BCH codes. The choice of code will be highly dependent on the requirements of the application, and include factors such as the required block length, correction strength, throughput requirements, available spare area / data overhead, and resources available on the target platform. If the desired BCH configuration is not covered by the below values, please contact IntelliProp to discuss possible options.
View ECC with BCH Algorithm full description to...
- see the entire ECC with BCH Algorithm datasheet
- get in contact with ECC with BCH Algorithm Supplier