Recursive evaluation of the generalized reed-muller coefficients

被引：0

作者：

Na, GS ^{[1
]}

Kim, SW ^{[1
]}

Choi, JS ^{[1
]}

Kim, HS ^{[1
]}

机构：

[1] Inha Univ, Dept Elect Engn, Inchon 402751, South Korea

来源：

33RD INTERNATIONAL SYMPOSIUM ON MULTIPLE-VALUED LOGIC, PROCEEDINGS | 2003年

关键词：

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this paper, we propose the computation method of GRM(Generalized Reed - Muller) coefficients over GF(2) using triangle cell recursively. GRM expansions of each polarity contain different numbers of product terms. Hence, the minimum form may be selected from them. Many authors have presented various algorithms of calculating the coefficients of GRM expansions under mixed polarities. The method proposed by W. Besslich requires 2(n-1) x (2(n) - 1) modulo - sums(i.e. ExOR)[1], but the method proposed in this paper requires only 2 X (the number of modulo-sums for n-1 variable) + 3(n-1) ones. From this proposed method we can get easily GRM coefficients.

引用

页码：117 / 121

页数：5

共 8 条

[1] EFFICIENT COMPUTER METHOD FOR EXOR LOGIC DESIGN [J].