Low latency systolic multipliers for finite field GF（2m） based on irreducible polynomials

作     者：谢佳峰 贺建军 桂卫华 

作者机构：School of Information Science and EngineeringCentral South University 

出 版 物：《Journal of Central South University》 (中南大学学报（英文版）)

年 卷 期：2012年第19卷第5期

页      面：1283-1289页

核心收录：

学科分类：07[理学] 08[工学] 070104[理学-应用数学] 081201[工学-计算机系统结构] 0701[理学-数学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：Project(61174132) supported by the National Natural Science Foundation of China Project(09JJ6098) supported by the Natural Science Foundation of Hunan Province,China 

主　　题：finite field finite field multiplication systolic structure low latency polynomials 

摘      要：Systolic implementation of multiplication over GF(2m) is usually very efficient in area-time complexity,but its latency is usually very ***,two low latency systolic multipliers over GF(2m) based on general irreducible polynomials and irreducible pentanomials are ***,a signal flow graph(SFG) is used to represent the algorithm for multiplication over GF(2m).Then,the two low latency systolic structures for multiplications over GF(2m) based on general irreducible polynomials and pentanomials are presented from the SFG by suitable cut-set retiming,*** indicates that the proposed two low latency designs involve at least one-third less area-delay product when compared with the existing designs,To the authors knowledge,the time-complexity of the structures is the lowest found in literature for systolic GF(2m) multipliers based on general irreducible polynomials and *** proposed low latency designs are regular and modular,and therefore they are suitable for many time critical applications.