In this article, the effective circuit partitioning techniques are employed by using the clustering algorithms. The technique uses the circuit netlist in order to cluster the circuit in partitioning steps and it also minimizes the interconnection distance with the required iteration level. The clustering algorithm like K-Mean, Y-Mean, K-Medoid are performed on the standard benchmark circuits. The results obtained shows that the proposed techniques improves the time and also minimize the area by reducing the interconnection distance.
The results obtained in REF show that the proposed techniques improve the delay.
Effective Clustering Algorithms for VLSI Circuit Partitioning Problems
Contemporary engineering sciences
Computer Science