A Centralized Block Placement Algorithm Based on Sequence Pair Representation

In the field of Electronic Design Automation (EDA), particularly in Printed Circuit Board (PCB) design, the placement of blocks is a very important issue. Superior PCB designs implement a placement strategy centered around key blocks such as processors, memory, and power management blocks. Designers arrange auxiliary blocks and connections around these core blocks to ensure logical clarity, effective signal transmission, and minimal interference. Research on a centralized block placement algorithm based on sequence pairs has been conducted in this paper, extracting the positional relationships between the central block and other blocks from the sequence pairs. On this basis, this paper proposes a new sequence pair initialization method and perturbation strategy, and also studies a modified version of the Longest Common Subsequence (LCS) algorithm. Through testing several examples in the industry, the experimental results show that the algorithm proposed in this paper can achieve centralized placement. Block placement is actually a common scientific problem in the field of EDA, so that the centralized block placement algorithm proposed in this paper can be applied not only to PCB design but also to the problem of VLSI placement.