Systematic Analysis on Performance Optimization of Tree Multipliers

The microprocessor chip is the core technology of the computer industry, and the multiplier is an important computing unit of the microprocessor. Its computing speed and area performances determine the performance of the microprocessor, and its structure determines whether it is easy to implement. Tree multipliers are widely used due to their superior performance. This article analyzes and compares the performance of several typical tree structures, including Wallace tree, Dadda tree, ZM tree, and OS tree, and compares various performance optimization methods, such as optimizing compressor structure, optimizing tree structure, and using PPA. This article found that the Wallace tree and Dadda tree have the fastest speed, but their irregular structures are not conducive to implementation. ZM tree and OS tree are two types of delay balancing trees with regular structures, but sacrifice speed and area performances. The optimization of compressor structure and tree structure, as well as the use of PPA, have reduced latency, but may lead to an increase in area. This article summarizes the current development of tree multipliers and has high reference value in future research.

Authors

Institutions

Publication Details

Journal
Applied and Computational Engineering
Published
2025-01-10
DOI
https://doi.org/10.54254/2755-2721/2025.20275
Primary Topic
Machine Learning and ELM
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Systematic Analysis on Performance Optimization of Tree Multipliers

Haoran Yu
Applied and Computational Engineering
Machine Learning and ELM
article

Systematic Analysis on Performance Optimization of Tree Multipliers

Haoran Yu
article en

Abstract

The microprocessor chip is the core technology of the computer industry, and the multiplier is an important computing unit of the microprocessor. Its computing speed and area performances determine the performance of the microprocessor, and its structure determines whether it is easy to implement. Tree multipliers are widely used due to their superior performance. This article analyzes and compares the performance of several typical tree structures, including Wallace tree, Dadda tree, ZM tree, and OS tree, and compares various performance optimization methods, such as optimizing compressor structure, optimizing tree structure, and using PPA. This article found that the Wallace tree and Dadda tree have the fastest speed, but their irregular structures are not conducive to implementation. ZM tree and OS tree are two types of delay balancing trees with regular structures, but sacrifice speed and area performances. The optimization of compressor structure and tree structure, as well as the use of PPA, have reduced latency, but may lead to an increase in area. This article summarizes the current development of tree multipliers and has high reference value in future research.

Applied and Computational EngineeringVol. 127(1)
Anhui University (CN)
Industry, innovation and infrastructure
Openalex Percentile: Top 100%
Machine Learning and ELM
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.