New systolic array architecture for finite field division
New systolic array architecture for finite field division
复制标题
DOI：
10.1587/elex.15.20180255
复制
发表时间：
2018-06-10
影响因子：
0.8
通讯作者：
Gebali, Fayez
中科院分区：
文献类型：
--
作者：
Ibrahim, Atef;Elsimary, Hamed;Gebali, Fayez
本文提出了一种新的脉动阵列结构，在GF（2（m））的基础上修改Stein的算法进行除法运算。通过将常规方法应用于除法算法来提取心脏收缩结构。该方法开始于获得用于预期算法的依赖图，并使用调度函数将时间值分配给依赖图中的每个节点，并且结束于将依赖图的若干节点投影到处理元件以构成脉动阵列。所获得的设计结构具有减少所需的触发器的数量来存储的算法的中间变量，因此减少了总的门数在很大程度上相比，其他相关的设计。分析结果表明，所提出的设计优于相关的设计方面的面积（至少减少32%的面积）和速度（至少减少60%的总计算时间），并具有最低的AT复杂度，范围从80%到94%。
This paper proposes a new systolic array architecture to perform division operations over GF(2(m)) based on the modified Stein's algorithm. The systolic structure is extracted by applying a regular approach to the division algorithm. This approach starts by obtaining the dependency graph for the intended algorithm and assigning a time value to each node in the dependency graph using a scheduling function and ends by projecting several nodes of the dependency graph to a processing element to constitute the systolic array. The obtained design structure has the advantage of reducing the number of flip-flops required to store the intermediate variables of the algorithm and hence reduces the total gate counts to a large extent compared to the other related designs. The analytical results show that the proposed design outperforms the related designs in terms of area (at least 32% reduction in area) and speed (at least 60% reduction in the total computation time) and has the lowest AT complexity that ranges from 80% to 94%.