An evaluation of move-based multi-way partitioning algorithms

2002 ◽  
Author(s):  
E. Yarack ◽  
J. Carletta
Keyword(s):  
Partitioning Algorithms

scholarly journals A Contraction-based Ratio-cut Partitioning Algorithm

VLSI Design ◽  
2002 ◽  
Vol 15 (2) ◽  
pp. 485-489
Author(s):  
Youssef Saab
Keyword(s):  
Linear Time ◽  
Fundamental Problem ◽  
Cluster Formation ◽  
Vlsi Circuits ◽  
Iterative Improvement ◽  
Partitioning Algorithm ◽  
Partitioning Algorithms ◽  
Simple Ratio ◽  
Iterative Partitioning

Partitioning is a fundamental problem in the design of VLSI circuits. In recent years, ratio-cut partitioning has received attention due to its tendency to partition circuits into their natural clusters. Node contraction has also been shown to enhance the performance of iterative partitioning algorithms. This paper describes a new simple ratio-cut partitioning algorithm using node contraction. This new algorithm combines iterative improvement with progressive cluster formation. Under suitably mild assumptions, the new algorithm runs in linear time. It is also shown that the new algorithm compares favorably with previous approaches.

scholarly journals Pair Wise Swapping Based Hypergraph Partitioning Algorithms for VLSI Design

2019 ◽  
Vol 8 (2) ◽  
pp. 5589-5593
Keyword(s):  
Integrated Circuit ◽  
Digital Camera ◽  
Vlsi Design ◽  
Electronic Systems ◽  
Circuit Partitioning ◽  
Computing Device ◽  
Hypergraph Partitioning ◽  
Vlsi Physical Design ◽  
Portable Computing ◽  
Partitioning Algorithms

A VLSI integrated circuit is the most significant part of electronic systems such as personal computer or workstation, digital camera, cell phone or a portable computing device, and automobile. So development within the field of electronic space depends on the design planning of VLSI integrated circuit. Circuit partitioning is most important step in VLSI physical design process. Many heuristic partitioning algorithms are proposed for this problem. The first heuristic algorithm for hypergraph partitioning in the domain of VLSI is FM algorithm. In this paper, I have proposed three variations of FM algorithm by utilizing pair insightful swapping strategies. I have played out a relative investigation of FM and my proposed algorithms utilizing two datasets for example ISPD98 and ISPD99. Test results demonstrate that my proposed calculations outflank the FM algorithm.

scholarly journals Two Measurement Set Partitioning Algorithms for the Extended Target Probability Hypothesis Density Filter

Sensors ◽  
2019 ◽  
Vol 19 (12) ◽  
pp. 2665 ◽  
Author(s):  
Yulan Han ◽  
Chongzhao Han
Keyword(s):  
Mahalanobis Distance ◽  
Nearest Neighbors ◽  
Set Partitioning ◽  
Measurement Information ◽  
Probability Hypothesis Density ◽  
Dbscan Algorithm ◽  
Target Probability ◽  
Extended Target ◽  
Density Filter ◽  
Partitioning Algorithms

The extended target probability hypothesis density (ET-PHD) filter cannot work well if the density of measurements varies from target to target, which is based on the measurement set partitioning algorithms employing the Mahalanobis distance between measurements. To tackle the problem, two measurement set partitioning approaches, the shared nearest neighbors similarity partitioning (SNNSP) and SNN density partitioning (SNNDP), are proposed in this paper. In SNNSP, the shared nearest neighbors (SNN) similarity, which incorporates the neighboring measurement information, is introduced to DP instead of the Mahalanobis distance between measurements. Furthermore, the SNNDP is developed by combining the DBSCAN algorithm with the SNN similarity together to enhance the reliability of partitions. Simulation results show that the ET-PHD filters based on the two proposed partitioning algorithms can achieve better tracking performance with less computation than the compared algorithms.

Sign in / Sign up

Export Citation Format

Share Document