The study of circuit placement in VLSI physical design has been conducted for several decades. As circuit complexity increases, it is non-trivial to place all cells of the circuit within a reasonable time. Many researchers have presented new placement algorithms and tools to address placement issues such as minimization of wire length, routability, and run-time. Our approach is different in tha...

In this paper, we propose a new hierarchical timing-driven standard-cell placement method, in which a new cluster placement model is introduced. The proposed method is divided into three phases, clustering cells, global placement and detailed placement. After clustering cells, in the global placement phase, we determine and improve cluster placement by a simulated annealing based method. In mos...

Nowadays, bulk of the designers prefer to outsource some parts of their design and fabrication process to the third-part companies due to the reliability problems, manufacturing cost and time-to-market limitations. In this situation, there are a lot of opportunities for malicious alterations by the off-shore companies. In this paper, we proposed a new placement algorithm that hinders the hardwa...

Regarding the nature of non-linear discrete placement, and in order to determine the optimal capacity of the substation, the goal in the present study will be a number of local optimum points. In this research, the problem of optimal placement posts to reduce power losses by considering Distributed Generation (DG). In formulating the objective function, geographical distribution density in the ...

Routing is a challenging issue in Mobile Ad hoc Network to pass the data packets through intermediate hops in an efficient manner. In this paper, Reactive routing protocols namely AODV and DSR are evaluated under the feasible placement and random placement models. Simulation results shows that AODV and DSR are performing better in feasible placement approach comparative to the existing random p...

Traditional VLSI systems automatically place and route circuits using two independent steps; first an optimal placement is determined by using wire length estimates, then an optimal routing is attempted for the given placement. In actuality, placement and routing can have complicated interactions, and separating them can lead to conservative and un-optimal solutions. GRAPE, a Genetic Routing An...