Design and Evaluation of Finite Field Multipliers Using Fast XNOR Cells

被引:2
|
作者
Patwari, Nitin D. [1 ]
Srivastav, Anjul [1 ]
Kabra, Mayank [1 ]
Jonna, Prashant [1 ]
Rao, Madhav [1 ]
机构
[1] IIIT Bangalore, Bangalore, Karnataka, India
关键词
Finite Field Multiplier; Karatsuba Algorithm; Overlap free Karatsuba; Standard Cell library; Polynomial Multiplication; HIGH-SPEED; MULTIPLICATION; IMPLEMENTATION; EFFICIENT; PROCESSOR;
D O I
10.1145/3583781.3590290
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The current polynomial multiplication is built on conventional CMOS cells, and no major changes are explored in the standard cell library to improve the performance. Hence state-of-the-art (SOTA) finite field multipliers of operand sizes ranging from 93 to 409 bits were designed and evaluated by adopting faster XNOR cells. The hardware metrics in the form of gates usage, and propagation delay were compared. The SOTA multipliers of different approaches including Conventional Algorithm (CA), Karatsuba Algorithm (KA), Overlap free Karatsuba Algorithm (OKA), and Overlap-free based multiplication strategy (OBS) were designed and synthesized through ASIC flow using 45 nm GPDK library files. The fast XNOR cell adopted SOTA multipliers improved the compute delay in the range of 8.24% to 33.45%, 8% to 37.05%, 4.63% to 18.36%, and 1.01% to 38.73% for OKA, OBS, CA, and KA respectively. All the design files are made freely available for further usage to research and designers' community.
引用
收藏
页码:163 / 166
页数:4
相关论文
共 50 条
  • [21] Generating fast multipliers using clever circuits
    Sheeran, M
    FORMAL METHODS IN COMPUTER-AIDED DESIGN, PROCEEDINGS, 2004, 3312 : 6 - 20
  • [22] FAST CONVOLUTION WITH FINITE FIELD FAST TRANSFORMS
    BRULE, JD
    IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING, 1975, AS23 (02): : 240 - 240
  • [23] A fast finite field multiplier
    Ferrer, Edgar
    Bollman, Dorothy
    Moreno, Oscar
    RECONFIGURABLE COMPUTING: ARCHITECTURES, TOOLS AND APPLICATIONS, 2007, 4419 : 238 - +
  • [24] High-Throughput Finite Field Multipliers Using Redundant Basis for FPGA and ASIC Implementations
    Xie, Jiafeng
    Meher, Pramod Kumar
    Mao, Zhi-Hong
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2015, 62 (01) : 110 - 119
  • [25] Low complexity Reed-Solomon encoder using globally optimized finite field multipliers
    Jittawutipoka, J
    Ngarmnil, J
    TENCON 2004 - 2004 IEEE REGION 10 CONFERENCE, VOLS A-D, PROCEEDINGS: ANALOG AND DIGITAL TECHNIQUES IN ELECTRICAL ENGINEERING, 2004, : D423 - D426
  • [26] A COMPARISON OF VLSI ARCHITECTURE OF FINITE-FIELD MULTIPLIERS USING DUAL, NORMAL, OR STANDARD BASES
    HSU, IS
    TRUONG, TK
    DEUTSCH, LJ
    REED, IS
    IEEE TRANSACTIONS ON COMPUTERS, 1988, 37 (06) : 735 - 739
  • [27] Area and delay efficient RNS-based FIR filter design using fast multipliers
    Balaji M.
    Padmaja N.
    Measurement: Sensors, 2024, 31
  • [28] Bit-parallel finite field multipliers for irreducible trinomials
    Imaña, JL
    Sánchez, JM
    Tirado, F
    IEEE TRANSACTIONS ON COMPUTERS, 2006, 55 (05) : 520 - 533
  • [29] Finite field multiplication in Lagrange representation using Fast Fourrier Transform
    Negre, Christophe
    SECRYPT 2006: Proceedings of the International Conference on Security and Cryptography, 2006, : 320 - 323
  • [30] On the design of reconfigurable multipliers for integer and Galois field multiplication
    Hinkelmann, Heiko
    Zipf, Peter
    Li, Jia
    Liu, Guifang
    Glesner, Manfred
    MICROPROCESSORS AND MICROSYSTEMS, 2009, 33 (01) : 2 - 12