G. Ram, D. S. Rani, R. Balasaikesava, K. B. Sindhuri
{"title":"Design of delay efficient modified 16 bit Wallace multiplier","authors":"G. Ram, D. S. Rani, R. Balasaikesava, K. B. Sindhuri","doi":"10.1109/RTEICT.2016.7808163","DOIUrl":null,"url":null,"abstract":"The structure of modified tree multipliers with different adders is presented. Multiplication is an important fundamental arithmetic operation in all microprocessor circuits and algorithms. Currently the speed of multipliers is limited by the speed of adders used for partial products addition. In this paper Conventional Array Multiplier and Dadda Multiplier are compared with the Wallace multiplier in terms of delay. Further a proposed sixteen bit Wallace multiplier is implemented by using Carry Select Adder (CSLA) and Binary to Excess -1 Converter (BEC) adder. The delay for Wallace multiplier using CSLA is less when compared to Wallace multiplier with BEC. These multipliers are coded in Verilog HDL, simulated and synthesized by using XILINX software 12.2 on Spartan 3E FPGA device xc3s500-5fg320.","PeriodicalId":6527,"journal":{"name":"2016 IEEE International Conference on Recent Trends in Electronics, Information & Communication Technology (RTEICT)","volume":"40 1","pages":"1887-1891"},"PeriodicalIF":0.0000,"publicationDate":"2016-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE International Conference on Recent Trends in Electronics, Information & Communication Technology (RTEICT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RTEICT.2016.7808163","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15
Abstract
The structure of modified tree multipliers with different adders is presented. Multiplication is an important fundamental arithmetic operation in all microprocessor circuits and algorithms. Currently the speed of multipliers is limited by the speed of adders used for partial products addition. In this paper Conventional Array Multiplier and Dadda Multiplier are compared with the Wallace multiplier in terms of delay. Further a proposed sixteen bit Wallace multiplier is implemented by using Carry Select Adder (CSLA) and Binary to Excess -1 Converter (BEC) adder. The delay for Wallace multiplier using CSLA is less when compared to Wallace multiplier with BEC. These multipliers are coded in Verilog HDL, simulated and synthesized by using XILINX software 12.2 on Spartan 3E FPGA device xc3s500-5fg320.
给出了带有不同加法器的改进树乘法器的结构。乘法运算是所有微处理器电路和算法中重要的基本运算。目前,乘法器的运算速度受到部分乘积加法运算速度的限制。本文比较了传统阵列乘法器和达达乘法器与华莱士乘法器的时延。采用进位选择加法器(CSLA)和二进制到超-1转换器(BEC)加法器实现了16位华莱士乘法器。与使用BEC的华莱士乘法器相比,使用CSLA的华莱士乘法器延迟更小。这些乘法器用Verilog HDL编码,在Spartan 3E FPGA器件xc3s500-5fg320上使用XILINX软件12.2进行仿真和合成。