BCH Decoder

The class of Bose-Chaudhuri-Hocquenghem (BCH) codes are a remarkable generalization of Hamming codes for correcting multiple errors. They are the best, known, constructive (nonrandom) algebraic codes for channels in which errors affect successive symbols independently. Furthermore, a simply implemented decoding procedure has been devised for these codes. They are also highly flexible, allowing control of block length and acceptable error thresholds, meaning that a custom code can be designed to a given specification. Due to scalable hardware architecture they are well suited for low-power application.

Our solution is scalable in different direction:

• Scalable in number of different code configuration
  
  • e.g. Decoding in  GF(2^16) and GF(2^14)
• Scalable in number of parallel processing bits,
  
  • e.g. 90Bit parallel processing for DVB-S2, e.g. 16Bit parallel processing for FLASH application
• Scalable in throughput
  
  • High speed
    
    • Optimized for speed using extended Euclid algorithm
    • Using parallel Chien (named after R.T.Chien) search algorithm for finding faster roots
  • Low speed, optimized for area using inversionless Berlekamp algorithm

The following roadmap shows the principle processing stages necessary for decoding a BCH code including erasure decoding.

Ubiso provides customized solution for each stage in your decoding process.

Contact us for more information