A back multiplication algorithm (BMA) for decoding BCH codes

Proceedings of the Eighteenth National Radio Science Conference. NRSC'2001 (IEEE Cat. No.01EX462) Pub Date : 2001-03-27 DOI:10.1109/NRSC.2001.929398

M. Abou El Dahab, E. Abd El Naiem, A.M. Abou El Wafa, M.M. Foda

引用次数: 0

Abstract

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).

查看原文本刊更多论文

一种解码BCH码的反向乘法算法(BMA)

在本文中，我们提出了一种新的算法，它可以比现有的解码技术更容易地解码线性分组码。该算法被称为“反向乘法算法”，简称BMA。该算法的优点是易于实现，并且为解码的消息提供较少的延迟。然而，对于一些不遵循解码过程的码字，它有一些限制。应用BCH代码类型(15,7)，(15,5)，得到了满意的结果。当该算法应用于BCH代码时，可以观察到这种局限性(31,21)。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Proceedings of the Eighteenth National Radio Science Conference. NRSC'2001 (IEEE Cat. No.01EX462)

自引率

0.00%

发文量