pdf

A low-power 32-bit multiplier based on a skip-type Wallace tree

  • 2013-09-22
  • 129.98KB
  • Points it Requires : 2

In order to improve the comprehensive performance of the multiplier, the multiplier was optimized from three aspects. The improved Booth algorithm was used to generate each partial product, the skipping Wallace tree structure was used to compress the partial products, and the compressed results were summed by the improved LING adder. The design was verified and tested on FPGA, and logic synthesis and layout and routing were performed under 0.18 μm SMIC process. The results show that compared with the multiplier using the traditional Wallace tree structure, the delay of the multiplier is reduced by 29%, the area is reduced by 17%, and the power consumption is reduced by 38%, which can meet the high-performance processing requirements. Keywords: Booth algorithm; skipping Wallace tree; multiplier; LING adder

unfold

You Might Like

Uploader
csdn_can
 

Recommended ContentMore

Popular Components

Just Take a LookMore

EEWorld
subscription
account

EEWorld
service
account

Automotive
development
circle

About Us Customer Service Contact Information Datasheet Sitemap LatestNews


Room 1530, 15th Floor, Building B, No.18 Zhongguancun Street, Haidian District, Beijing, Postal Code: 100190 China Telephone: 008610 8235 0740

Copyright © 2005-2024 EEWORLD.com.cn, Inc. All rights reserved 京ICP证060456号 京ICP备10001474号-1 电信业务审批[2006]字第258号函 京公网安备 11010802033920号
×