A back multiplication algorithm (BMA) for decoding BCH codes

In this paper, we present a novel algorithm by which linear block codes could be decoded more easily than by existing decoding techniques. The algorithm is called "back multiplication algorithm" or BMA. This algorithm has the advantage of being easy to implement and offers less latency for...

Full description

Saved in:
Bibliographic Details
Main Authors: Abou El Dahab, M., Abd El Naiem, E., Abou El Wafa, A.M., Foda, M.M.
Format: Conference Proceeding
Language:English
Subjects:
Block codes
Channel coding
Decoding
Delay
Digital communication
Error correction
Hardware
Interference
Linear code
Parity check codes
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we present a novel algorithm by which linear block codes could be decoded more easily than by existing decoding techniques. The algorithm is called "back multiplication algorithm" or BMA. This algorithm has the advantage of being easy to implement and offers less latency for the decoded message. However, it has some limitations concerning a number of codewords which do not follow the decoding process. Application is made to BCH codes types (15,7),(15,5) and satisfactory results are obtained. The limitation is observed when the algorithm is applied to BCH code (31,21).
DOI:10.1109/NRSC.2001.929398