System for Automatic Generation of Parallel Multipliers over Galois Field
System for Automatic Generation of Parallel Multipliers over Galois Field
复制标题
伽罗瓦域上并行乘法器自动生成系统
DOI：
10.1109/ismvl.2015.15
复制
发表时间：
2015
期刊：
影响因子：
--
通讯作者：
and Takafumi Aoki
中科院分区：
文献类型：
--
作者：
Yukihisa Sugawara;Rei Ueno;Naofumi Homma;and Takafumi Aoki
本文提出了一种自动生成伽罗瓦域（GF）算术电路的系统，称为GF算术模块生成器（GF-AMG）。所提出的系统采用基于图形的电路描述，称为 GF 算术电路图 (GF-ACG)。首先，我们提出了 GF-ACG 的扩展来处理 GF(pm) (p ≥ 3) 算术电路，除了传统的二进制电路之外，它还可以通过多值逻辑电路有效地实现。然后，我们通过三值逻辑电路的 GF(3m) 乘法器的实验设计证明了生成系统的有效性。此外，我们还评估了我们的系统凭经验生成的典型 GF(2m) 乘法器的性能。我们从结果中确认，所提出的系统可以生成各种 GF 并行乘法器，包括度数大于 128 的 GF(2m) 和 GF(3m) 上的实用乘法器。
This paper presents a system for the automatic generation of Galois-field (GF) arithmetic circuits, named the GF Arithmetic Module Generator (GF-AMG). The proposed system employs a graph-based circuit description called the GF Arithmetic Circuit Graph (GF-ACG). First, we present an extension of the GF-ACG to handle GF(pm) (p ≥ 3) arithmetic circuits, which can be efficiently implemented by multiple-valued logic circuits in addition to the conventional binary circuits. We then show the validity of the generation system through the experimental design of GF(3m) multipliers for a ternary logic circuit. In addition, we evaluate the performance of typical GF(2m) multipliers empirically generated by our system. We confirm from the results that the proposed system can generate a variety of GF parallel multipliers, including practical multipliers over GF(2m) and GF(3m) having degrees greater than 128.