Low latency systolic multipliers for finite field GF (2m) based on irreducible polynomials

被引:0
|
作者
Jia-feng Xie
Jian-jun He
Wei-hua Gui
机构
[1] Central South University,School of Information Science and Engineering
来源
关键词
finite field; finite field multiplication; systolic structure; low latency; polynomials;
D O I
暂无
中图分类号
学科分类号
摘要
Systolic implementation of multiplication over GF(2m) is usually very efficient in area-time complexity, but its latency is usually very large. Thus, two low latency systolic multipliers over GF(2m) based on general irreducible polynomials and irreducible pentanomials are presented. First, 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, respectively. Analysis 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 pentanomials. The proposed low latency designs are regular and modular, and therefore they are suitable for many time critical applications.
引用
收藏
页码:1283 / 1289
页数:6
相关论文
共 50 条
  • [1] Low latency systolic multipliers for finite field GF (2 m ) based on irreducible polynomials
    Xie Jia-feng
    He Jian-jun
    Gui Wei-hua
    JOURNAL OF CENTRAL SOUTH UNIVERSITY OF TECHNOLOGY, 2012, 19 (05): : 1283 - 1289
  • [2] Low latency systolic multipliers for finite field GF(2~m) based on irreducible polynomials
    谢佳峰
    贺建军
    桂卫华
    Journal of Central South University, 2012, 19 (05) : 1283 - 1289
  • [3] Systolic and super-systolic multipliers for finite field GF(2m) based on irreducible trinomials
    Meher, Pramod Kumar
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2008, 55 (04) : 1031 - 1040
  • [4] Low Latency Systolic Montgomery Multiplier for Finite Field GF(2m) Based on Pentanomials
    Xie, Jiafeng
    He, Jian Jun
    Meher, Pramod Kumar
    IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2013, 21 (02) : 385 - 389
  • [5] Low-Latency, Low-Area, and Scalable Systolic-Like Modular Multipliers for GF(2m) Based on Irreducible All-One Polynomials
    Meher, Pramod Kumar
    Lou, Xin
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2017, 64 (02) : 399 - 408
  • [6] SYSTOLIC MULTIPLIERS FOR FINITE-FIELDS GF(2M)
    YEH, CS
    REED, IS
    TRUONG, TK
    IEEE TRANSACTIONS ON COMPUTERS, 1984, 33 (04) : 357 - 360
  • [7] Implementation of Low Complexity Finite Field GF (2m) Multiplier Using Irreducible Primitive Polynomials
    Pillutla, Siva Ramakrishna
    Vankeswaram, Bhargava Sandeep
    Velaga, Tejaswini
    Lellapalli, Sree Sowjanya
    Vadlamudi, Venkata Abhinav
    2022 SECOND INTERNATIONAL CONFERENCE ON ADVANCES IN ELECTRICAL, COMPUTING, COMMUNICATION AND SUSTAINABLE TECHNOLOGIES (ICAECT), 2022,
  • [8] Parallel programmable finite field GF(2m) multipliers
    Iliev, N
    Stine, JE
    Jachimiec, N
    VLSI 2004: IEEE COMPUTER SOCIETY ANNUAL SYMPOSIUM ON VLSI, PROCEEDINGS, 2004, : 299 - 302
  • [9] SYSTOLIC ARRAY IMPLEMENTATION OF MULTIPLIERS FOR FINITE-FIELDS GF(2M)
    WANG, CL
    LIN, JL
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, 1991, 38 (07): : 796 - 800
  • [10] Low-Latency High-Throughput Systolic Multipliers Over GF(2m) for NIST Recommended Pentanomials
    Xie, Jiafeng
    Meher, Pramod Kumar
    Mao, Zhi-Hong
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2015, 62 (03) : 881 - 890