{"title":"基于Radix-32改进Booth算法和Wallace结构的高性能流水线带符号64x64位乘法器","authors":"Manish Bansal, Sangeeta Nakhate, A. Somkuwar","doi":"10.1109/CICN.2011.86","DOIUrl":null,"url":null,"abstract":"This paper manly focus on enhancing speed performance of signed multiplication using radix-32 modified Booth algorithm and Wallace Structure. It is designed for fixed length 64x64 bit operands. 3:2and 4:2 Compressor used in Wallace tree structure accumulate partial products. Using both compressor, No. of levels has been reduced that also causes enhancing the speed of multiplier. An efficient VHDL code has been written and successfully synthesized and simulated using Xilinx ISE 9.2i and Model Sim PE Student Edition 10.2c. Proposed pipelined signed 64x64 bit multiplier using radix-32 Booth algorithm and Wallace tree structure provides less delay 1.4 ns and required 87% less number of levels in Wallace tree structure, 76% less total number of Compressor, 70% less generated partial products as compared to conventional multipliers.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"High Performance Pipelined Signed 64x64-Bit Multiplier Using Radix-32 Modified Booth Algorithm and Wallace Structure\",\"authors\":\"Manish Bansal, Sangeeta Nakhate, A. Somkuwar\",\"doi\":\"10.1109/CICN.2011.86\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper manly focus on enhancing speed performance of signed multiplication using radix-32 modified Booth algorithm and Wallace Structure. It is designed for fixed length 64x64 bit operands. 3:2and 4:2 Compressor used in Wallace tree structure accumulate partial products. Using both compressor, No. of levels has been reduced that also causes enhancing the speed of multiplier. An efficient VHDL code has been written and successfully synthesized and simulated using Xilinx ISE 9.2i and Model Sim PE Student Edition 10.2c. Proposed pipelined signed 64x64 bit multiplier using radix-32 Booth algorithm and Wallace tree structure provides less delay 1.4 ns and required 87% less number of levels in Wallace tree structure, 76% less total number of Compressor, 70% less generated partial products as compared to conventional multipliers.\",\"PeriodicalId\":292190,\"journal\":{\"name\":\"2011 International Conference on Computational Intelligence and Communication Networks\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 International Conference on Computational Intelligence and Communication Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CICN.2011.86\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Computational Intelligence and Communication Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CICN.2011.86","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11
摘要
本文主要研究利用改进的基数-32的Booth算法和Wallace结构来提高有符号乘法的速度性能。它是为固定长度的64x64位操作数设计的。3:2和4:2压缩机采用华莱士树形结构积累部分产品。双压缩机使用时,No。等级的降低也会导致速度倍增器的提高。利用Xilinx ISE 9.2i和Model Sim PE Student Edition 10.2c编写了高效的VHDL代码,并成功地进行了合成和仿真。与传统乘法器相比,采用基数32 Booth算法和Wallace树结构的流水线带符号64x64位乘法器的延迟减少了1.4 ns,所需的Wallace树结构层数减少了87%,压缩器总数减少了76%,生成的部分乘积减少了70%。
High Performance Pipelined Signed 64x64-Bit Multiplier Using Radix-32 Modified Booth Algorithm and Wallace Structure
This paper manly focus on enhancing speed performance of signed multiplication using radix-32 modified Booth algorithm and Wallace Structure. It is designed for fixed length 64x64 bit operands. 3:2and 4:2 Compressor used in Wallace tree structure accumulate partial products. Using both compressor, No. of levels has been reduced that also causes enhancing the speed of multiplier. An efficient VHDL code has been written and successfully synthesized and simulated using Xilinx ISE 9.2i and Model Sim PE Student Edition 10.2c. Proposed pipelined signed 64x64 bit multiplier using radix-32 Booth algorithm and Wallace tree structure provides less delay 1.4 ns and required 87% less number of levels in Wallace tree structure, 76% less total number of Compressor, 70% less generated partial products as compared to conventional multipliers.