公开(公告)号：US20240289530A1

公开(公告)日：2024-08-29

申请号：US18657419

申请日：2024-05-07

Applicant: Tencent Technology (Shenzhen) Company Limited

Inventor： Shengming MA ,  Yue CHEN ,  Jianming WANG ,  Sainan HUAI ,  Shengyu ZHANG ,  Xuemeng WANG ,  Xiong XU ,  Yanghepu LI

IPC: G06F30/3953

CPC classification number: G06F30/3953

Abstract: In a routing method, an initial chip layout and routing planning information corresponding to the initial chip layout are obtained. The routing planning information includes planning information of a first site in the initial chip layout. The planning information indicates a location region, a routing orientation, and a predefined connection path. A first end of the predefined connection path is connected to the first site. According to the location region and the routing orientation, a first route segment connecting a second site of the initial chip layout and a second end of the predefined connection path is determined. According to the predefined connection path, a second route segment connecting the second end of the predefined connection path and the first site is determined. According to the first route segment and the second route segment, a connection route between the second site and the first site is generated.

公开(公告)号：US20240265187A1

公开(公告)日：2024-08-08

申请号：US18638544

申请日：2024-04-17

Applicant: Tencent Technology (Shenzhen) Company Limited

Inventor： Shengming MA ,  Yue CHEN ,  Jianming WANG ,  Sainan HUAI ,  Shengyu ZHANG ,  Xiong XU

IPC: G06F30/3953

CPC classification number: G06F30/3953

Abstract: This application discloses a circuit layout routing method performed by a computer device, and relates to the field of micro-nano processing technologies. The method includes: obtaining position information of at least one routing point in a circuit layout from routing planning information of the circuit layout; calculating, based on the position information, a turning starting position and a turning radius corresponding to each of the at least one routing point; and generating a routing path through the at least one routing point based on the turning starting position and the turning radius, the routing path turning at the turning starting position w ith the turning radius. The foregoing solution expands an applicable scenario of an automatic routing algorithm.