High-Speed Hybrid Multiplier Design Using a Hybrid Adder with FPGA Implementation

被引:5
|
作者
Thamizharasan, V. [1 ]
Kasthuri, N. [2 ]
机构
[1] Erode Sengunthar Engn Coll, Dept Elect & Commun Engn, Perundurai 638057, Erode, India
[2] Kongu Engn Coll, Dept Elect & Commun Engn, Perundurai 638052, Erode, India
关键词
Area; delay; FPGA; hybrid; multiplier; power; Vedic; VLSI; Xilinx ISE 12; 1;
D O I
10.1080/03772063.2021.1912655
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The major role of electronic devices is providing low power dissipation and high speed with compact area. The speed of electronic devices depends on arithmetic operations. Multiplication is the important arithmetic operation in many VLSI signal processing applications. Hence, a high-speed multiplier is needed to design any signal processing module. Many multipliers are surveyed in the literature. They are Array, Wallace tree, booth, Vedic and Compressor-based multiplier. The speed of these multipliers depends on partial product accumulation. The hybrid parallel adder-based multiplier is proposed to improve the speed of multiplication compared to the existing technique. In this technique the partial products of, two consecutive bits (multiplicands), are added simultaneously with the help of a hybrid adder (Hancarlson, Weinberger and Ling adder). The proposed architecture is synthesized and simulated using Xilinx ISE 12.1 with various FPGA boards. Synthesized report shows that the speed of proposed multiplier (Spartan 6 FPGA implementation) is improved when compared to an Array multiplier (22.14%), Wallace tree multiplier (20.41%), Multiplier using compressor (13.89%), Vedic Multiplier using CLA (13.03%), Vedic Multiplier using RCA (3.54%), Modified Booth multiplier (4.42%) and Vedic Multiplier using HCA with BEC (3.28%).
引用
收藏
页码:2301 / 2309
页数:9
相关论文
共 50 条
  • [31] Advanced Multiplier Design and Implementation using Hancarlson Adder
    Rao, E. Jagadeeswara
    Ramanjaneyulu, T.
    Kumar, K. Jayaram
    [J]. 2018 INTERNATIONAL CONFERENCE ON INTELLIGENT AND INNOVATIVE COMPUTING APPLICATIONS (ICONIC), 2018, : 379 - 383
  • [32] Design high speed and low power hybrid full adder circuit
    Lueangsongchai, Sathaporn
    Tooprakai, Siraphop
    [J]. 2018 18TH INTERNATIONAL SYMPOSIUM ON COMMUNICATIONS AND INFORMATION TECHNOLOGIES (ISCIT), 2018, : 22 - 25
  • [33] Design and FPGA Implementation of High-speed Parallel FIR Filters
    Hou, Baolin
    Yao, Yuancheng
    Qin, Mingwei
    [J]. PROCEEDINGS OF THE 3RD INTERNATIONAL CONFERENCE ON MECHATRONICS, ROBOTICS AND AUTOMATION (ICMRA 2015), 2015, 15 : 975 - 979
  • [34] High-speed FPGA implementation of full-word Montgomery multiplier for ECC applications
    Khan, Safiullah
    Javeed, Khalid
    Shah, Yasir Ali
    [J]. MICROPROCESSORS AND MICROSYSTEMS, 2018, 62 : 91 - 101
  • [35] A high-speed low-latency digit-serial hybrid adder
    Landernäs, K
    Holmberg, J
    Vesterbacka, M
    [J]. 2004 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOL 3, PROCEEDINGS, 2004, : 217 - 220
  • [36] RETRACTION: Design and implementation of high-speed and low-power consumption Moore-based loopback adder on FPGA
    Kumar, B. N. Mohan
    Rangaraju, H. G.
    [J]. INTERNATIONAL JOURNAL OF INTELLIGENT UNMANNED SYSTEMS, 2024,
  • [37] A 16-bit High-Speed Low-Power Hybrid Adder
    Hussein, Assem
    Gaudet, Vincent
    Mostafa, Hassan
    Elmasry, Mohamed
    [J]. 2016 28TH INTERNATIONAL CONFERENCE ON MICROELECTRONICS (ICM 2016), 2016, : 313 - 316
  • [38] A simple high-speed multiplier design
    Kang, Jung-Yup
    Gaudiot, Jean-Luc
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 2006, 55 (10) : 1253 - 1258
  • [39] A Simple High-Speed Multiplier Design
    Dowoud, D. S.
    Dawoud, Peter D.
    Charles, Ndagije
    [J]. WMSCI 2008: 12TH WORLD MULTI-CONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL I, PROCEEDINGS, 2008, : 97 - +
  • [40] A high-speed design of Montgomery multiplier
    Fan, Yibo
    Ikenaga, Takeshi
    Goto, Satoshi
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2008, E91A (04): : 971 - 977