Computer Engineering and Applications ›› 2015, Vol. 51 ›› Issue (5): 38-43.

Previous Articles     Next Articles

Low-complexity GF multiplier design based on Karatsuaba algorithm

HUO Jia, LIU Rong   

  1. State Radio Monitoring Center, Beijing 100037, China
  • Online:2015-03-01 Published:2015-04-08

基于Karatsuba算法低复杂度伽罗华域乘法器设计

霍  甲,刘  蓉   

  1. 国家无线电监测中心,北京 100037

Abstract: This paper presents a multiplier design based on Karatsuba-extended algorithm, which can more effectively reduce the complexity [GF(2m)] multiplier design. According to the proposed performance parameters P, the program can design the most efficient [GF(2m)] multipliers. In the case that m equals 2048, the designed parameter P is approximately three times that of ordinary multiplier. Therefore, according to the actual difference, for a particular value of m, the program can design the most efficient [GF(2m)] multipliers by selecting the appropriate parameters r and i.

Key words: multiplier, Galois field, complexity

摘要: 提出了一种基于Karatsuba-extended算法的乘法器设计方案,能够更有效地降低[GF(2m)]乘法器的设计复杂度。根据提出的性能参数P,该方案可以设计出最高效的[GF(2m)]乘法器。在m等于2 048的情况下,用该方案设计的乘法器的P约是普通乘法器的3倍。因此,根据实际的不同情况,对于特定m值,该方案通过选择合适的参数r和i,能够设计出最高效的[GF(2m)]乘法器。

关键词: 乘法器, 伽罗华域, 复杂度