论文部分内容阅读
在分析全串行和全并行 GF(2 k)域乘法的基本原理基础上提出了一种适合于任意 GF(2 k)域的乘法器 UHGM(U nified Hybrid Galois Field Multiplier) .它为当前特别重要的 k为素数的 GF(2 k)域乘法 ,提供了一种高效的实现方法 .该乘法器具有结构规整、模块化好的特点 ,特别适合于 VL SI实现 ,同时这种结构具有粗粒度的面积和速度的可伸缩性 ,方便了在大范围内进行实现面积和速度的权衡 .最后给出了 GF(2 1 6 3)域上乘法器的 ASIC综合的结果
Based on the analysis of the basic principle of full-serial and full-parallel GF (2 k) domain multiplication, a new multiplicative polynomial multiplier named Unified Hybrid Galois Field Multiplier (GFG) is proposed, which is suitable for the current special An important k is prime GF (2k) domain multiplication, which provides an efficient implementation method. The multiplier has the characteristics of regular structure and good modularization, and is especially suitable for VLSI implementation. At the same time, the structure has coarse granularity The scalability of area and speed facilitates the trade-off between area and speed over a large area.Finally, the result of ASIC synthesis of multipliers on the GF (2 1 6 3) domain is given