Hardware Implementation of an Efficient Two Error Correcting BCH Code Decoder

View at publisher Summarise with VIRAT
Authors: Maitreyee Das, Sourav Nath, Koushik Guha, Preetisudha Meher, Krishna Lal Baishnab
Cited by: 0
References: 5

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

This paper presents the design and implementation of an efficient two-error correcting BCH codes decoder using the Meggitt algorithm. The proposed decoder eliminates complex Galois field inversion operations, making it more efficient than Peterson's algorithm. The decoder can correct up to two errors in a 15-bit message word and detects failed decoding efforts by comparing results with the initial syndrome and its cyclically shifted versions. Implemented in Verilog-HDL and synthesized using Synopsys Design Vision, the decoder demonstrates favorable power and area estimations for 180nm and 65nm technology nodes. While suitable for power- and area-constrained applications, the step-by-step decoding procedure may not be ideal for high- speed applications. This work contributes to the development of efficient error-control codes for reliable data transmission.

Fields of Study & Subjects

Coding theory and cryptography Error Correcting Code Techniques Cryptography and Residue Arithmetic

Publication details

Journal / source
IEEE International Conference on Industrial and Information Systems (ICIIS)
Pages
228–233
Publication date
16 January 2026
Language
EN