Automatic Layout Synthesis of Leaf Cells

––This paper describes algorithms for automatic layout synthesisofleafcellsin1–dandinanew1–1/2–dlayoutstyle,useful for non–dual circuit styles. The graph theory based algorithms use concepts set forth by Euler and Hamilton to achieve two tasks. The transistorplacementalgorithmusestheEuler’stheorem,whilethe placement of the groups of the transistors is achieved by using Hamiltonian graphs. Results show that the algorithms produce extremely competent layouts when compared to other algorithms in the literature and manual layouts.

• Type: Conference
• Year: 1995
• Where: DAC
• Authors: Sanjay Rekhi, J. Donald Trotter, Daniel H. Linder
• Keywords: Algorithms, Computer Architecture, DAC 1995, Paper Describes Algorithms, Theory Based Algorithms