Query：
学者姓名：陈家瑞
Refining：
Year
Type
Indexed by
Source
Complex
Co-
Language
Clean All
Abstract ：
由于不断增长的芯片引脚数量、极高的引脚密度和独特的物理限制，印刷电路板（Printed Circuit Board,PCB）的手动布线已成为一项耗时的任务。近年来，高效率的自动化布线技术得到了广泛的研究。区域布线是PCB设计的一个重要组成部分。针对基于静态网格区域布线的方案，布线拥塞、布通率低等问题，本文提出了一套基于动态网格的135度区域布线算法，主要包括以下技术:（1）对当前布线采用实时扩展动态网格；（2）135度布线角度节点调整算法；（3）基于拥塞控制的改进A~*算法；（4）有效的拆线重布机制。实验结果表明，该算法对于所有工业界布线测试用例布通率都达到100%，并且运行时间方面优于工业布线器Free Routing和Allegro。
Keyword ：
A~*算法 A~*算法 动态网格 动态网格 区域布线 区域布线 拆线重布 拆线重布
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 陈云梦 , 陈传东 , 陈家瑞 et al. 基于动态网格的135度PCB区域布线算法 [J]. | 中国集成电路 , 2024 , 33 (03) : 19-25,31 . |
| MLA | 陈云梦 et al. "基于动态网格的135度PCB区域布线算法" . | 中国集成电路 33 . 03 (2024) : 19-25,31 . |
| APA | 陈云梦 , 陈传东 , 陈家瑞 , 周宇靖 . 基于动态网格的135度PCB区域布线算法 . | 中国集成电路 , 2024 , 33 (03) , 19-25,31 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
针对新工科背景下国产电子设计自动化（EDA）软件人才紧缺和培养难的状况，从教学内容调整、实践教学体系搭建和综合实践项目设置等方面提出“分层递进，产教融合”的模式，设计面向国产EDA人才培养的课程群实践教学体系，阐述如何采用课程群分层递进、一体化贯穿式，使实践教学体系可以有效覆盖各个层次的创新实践能力的培养，最后说明教学效果。
Keyword ：
EDA软件人才 EDA软件人才 创新实践能力 创新实践能力 实践教学体系 实践教学体系
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 陈家瑞 , 邓新国 , 陈振 . 面向国产EDA软件人才培养的课程群实践教学体系 [J]. | 计算机教育 , 2024 , PageCount-页数: 4 (07) : 174-177 . |
| MLA | 陈家瑞 et al. "面向国产EDA软件人才培养的课程群实践教学体系" . | 计算机教育 PageCount-页数: 4 . 07 (2024) : 174-177 . |
| APA | 陈家瑞 , 邓新国 , 陈振 . 面向国产EDA软件人才培养的课程群实践教学体系 . | 计算机教育 , 2024 , PageCount-页数: 4 (07) , 174-177 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Legalized routing is an essential part of PCB automatic routing. It solves the problem of wiring conflicts and obtains routing results that comply with the constraints of design rules. Traditional legalized routing problems mostly use trial backtracking methods, but with increasing design complexity and design rules, avoiding wiring conflicts between networks has become increasingly challenging. This paper proposes a legalized routing algorithm based on linear programming to obtain the optimal wiring trajectory under specified topological constraints. First, the corresponding routing model was established based on numerous routing rules, and a routing grid diagram was found using obstacles as grid points. Secondly, a global routing algorithm was used to obtain the estimated wiring path, and integer linear programming was used to realize the mathematical modeling of the legalized routing problem. Finally, a multi-line simultaneous routing strategy was used to design and implement a detailed routing algorithm, optimizing the routing results. We use C++ to complete the coding work and thoroughly test the PCB use cases of different sizes. The experimental results show that our algorithm still maintains a 100% routing success rate, good time performance, and excellent routing quality with large-scale use cases compared with the trial backtracking method.
Keyword ：
detailed algorithm detailed algorithm escape routing escape routing integer linear programming integer linear programming printed circuit board printed circuit board
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Chen, Chuandong , Tong, Xin , Liu, Qinghai et al. Legalized Routing Algorithm Based on Linear Programming [J]. | ELECTRONICS , 2023 , 12 (20) . |
| MLA | Chen, Chuandong et al. "Legalized Routing Algorithm Based on Linear Programming" . | ELECTRONICS 12 . 20 (2023) . |
| APA | Chen, Chuandong , Tong, Xin , Liu, Qinghai , Chen, Jiarui , Lin, Zhifeng . Legalized Routing Algorithm Based on Linear Programming . | ELECTRONICS , 2023 , 12 (20) . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Global routing plays a crucial role in printed circuit board (PCB) design and affects the cost of the design significantly. Conventional methods based on rectangular grids have some limitations, whereas this paper introduces a new algorithm that employs a triangular grid model, which offers a more efficient solution to the problem. Firstly, we present a technique to sort all unconnected two-pin nets. Next, a triangular grid graph is constructed to represent the routing resources on the printed circuit board. Finally, we use the concept of maximum flow to identify the paths for global routing and apply detailed routing for the completion of wires. Results from experiments demonstrate that our algorithm is faster than two state-of-the-art routers and does not have any design rule violations for all industrial PCB instances.
Keyword ：
global routing global routing maximum flow maximum flow triangular grid triangular grid
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Chen, Jiarui , Zhou, Yujing , Liu, Qinghai et al. A Novel Global Routing Algorithm for Printed Circuit Boards Based on Triangular Grid [J]. | ELECTRONICS , 2023 , 12 (24) . |
| MLA | Chen, Jiarui et al. "A Novel Global Routing Algorithm for Printed Circuit Boards Based on Triangular Grid" . | ELECTRONICS 12 . 24 (2023) . |
| APA | Chen, Jiarui , Zhou, Yujing , Liu, Qinghai , Zhang, Xinhong . A Novel Global Routing Algorithm for Printed Circuit Boards Based on Triangular Grid . | ELECTRONICS , 2023 , 12 (24) . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
PCB routing becomes time-consuming as the complexity of PCB design increases. Unlike traditional schemes that treat the two essential PCB routing processes separately, namely, escape and bus routing, we consider the continuity between them and present a golden-pin-based routing scheme to find the desired solution with angle and topology constraints. Further, conventional rip-up and reroute methods are often ineffective and inefficient for congestion alleviation and routability optimization. We construct a component graph by modeling components as vertices and applying the minimum weight vertex covering method to improve the routability. A self-adaptable ordering method is presented for escape routing to arrange the pin order on the component boundary, guaranteeing successful bus routing. In addition, escape routing is performed based on a disjoint path method. We construct a dynamic Hanan grid in bus routing and utilize a novel congestion adjustment technique to improve solution quality. Compared with FreeRouting and Allegro, the experiment results show that our algorithm achieves high routability and a significant 90% runtime reduction.
Keyword ：
bus routing bus routing disjoint path disjoint path escape routing escape routing
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Liu, Qinghai , Tang, Qinfei , Chen, Jiarui et al. Disjoint-Path and Golden-Pin Based Irregular PCB Routing with Complex Constraints [J]. | IEEE DESIGN AUTOMATION CONFERENCE, DAC , 2023 . |
| MLA | Liu, Qinghai et al. "Disjoint-Path and Golden-Pin Based Irregular PCB Routing with Complex Constraints" . | IEEE DESIGN AUTOMATION CONFERENCE, DAC (2023) . |
| APA | Liu, Qinghai , Tang, Qinfei , Chen, Jiarui , Chen, Chuandong , Zhu, Ziran , He, Huan et al. Disjoint-Path and Golden-Pin Based Irregular PCB Routing with Complex Constraints . | IEEE DESIGN AUTOMATION CONFERENCE, DAC , 2023 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Global routing is a critical problem in PCB routing, and its quality greatly affect the PCB design cost. Unlike existing methods based on traditional rectangular grid, this paper present a novel algorithm based on triangular grid model to handle the problem. We first propose a method to sort all the unconnected two-pin nets, then construct a triangular grid graph to represent the routing resources on the printed circuited board. Finally we use the idea of maximum flow to find the paths to complete global routing and use the detailed routing to get the result of completed wires. Experimental results show that our algorithm can spend less time than the two state-of-the-art routers without any design rule violations for all given industrial PCB instances. © 2023 IEEE.
Keyword ：
Printed circuit boards Printed circuit boards Printed circuit design Printed circuit design Routing algorithms Routing algorithms
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Zhou, Yujing , Liu, Qinghai , Zhang, Xinhong et al. A Global Routing Algorithm for PCB Based on Triangular Grid [C] . 2023 : 64-69 . |
| MLA | Zhou, Yujing et al. "A Global Routing Algorithm for PCB Based on Triangular Grid" . (2023) : 64-69 . |
| APA | Zhou, Yujing , Liu, Qinghai , Zhang, Xinhong , Chen, Jiarui . A Global Routing Algorithm for PCB Based on Triangular Grid . (2023) : 64-69 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
工艺参数选择是动力电池焊接行业面临的困难,为提升动力电池焊接效率并满足多项目标,采用核岭回归与多目标粒子群优化算法相结合的方法辅助优化工艺参数选择。构造了工艺参数对应的焊接下限,继而利用基于高斯核函数的核岭回归模型进行拟合;多目标粒子群的每个粒子代表一组工艺参数,通过群体进化与变异、引导者选取与优化、解集维护3种操作,并结合回归模型,有效获取了指定焊接目标下的最优解集。该方法还借鉴K近邻算法思想设计评价标准,以度量每个解的可靠性,进一步筛选更优质的解,保证所选工艺参数有更高的容错性。所提方法解决了电池焊接行业目前面临的问题,具有极其重要的应用价值。
Keyword ：
动力电池 动力电池 多目标粒子群优化 多目标粒子群优化 工艺参数 工艺参数 核岭回归 核岭回归 激光焊接 激光焊接
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 邓新国 , 王磊 , 陈家瑞 et al. 结合核岭回归与多目标粒子群优化算法的激光焊接工艺参数预测 [J]. | 计算机集成制造系统 , 2021 , 27 (11) : 3131-3137 . |
| MLA | 邓新国 et al. "结合核岭回归与多目标粒子群优化算法的激光焊接工艺参数预测" . | 计算机集成制造系统 27 . 11 (2021) : 3131-3137 . |
| APA | 邓新国 , 王磊 , 陈家瑞 , 徐海威 . 结合核岭回归与多目标粒子群优化算法的激光焊接工艺参数预测 . | 计算机集成制造系统 , 2021 , 27 (11) , 3131-3137 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
The selection of process parameters is a difficult problem in current power battery welding industry. To improve the efficiency of power battery welding and to solve the difficulty in selecting process parameters for meeting multiple objectives, a solution combining kernel ridge regression and Multi-Objective Particle Swarm Optimization (MOPSO) was adopted. In this scheme, the welding lower limit corresponding to process parameters was set, and the kernel ridge regression model was used for simulation based on Gauss kernel function. A set of process parameters was represented as a particle of MOPSO, and by means of a regression model, an optimal solution set for the specified welding objective was effectively obtained through three operational steps consisting of the evolution and variation of the population, the selection and optimization of the guide and the maintenance of solution set. In addition, K-nearest neighbor algorithm was referenced for designing an evaluation criterion to measure the reliability of each solution and further screen better solutions, which ensured that the selected process parameters own higher fault tolerance. The proposed method had solved the difficult problem in selecting process parameters faced by current power battery welding industry, which would enhance the efficiency and effectiveness of power battery welding. © 2021, Editorial Department of CIMS. All right reserved.
Keyword ：
Efficiency Efficiency Electric batteries Electric batteries Fault tolerance Fault tolerance Laser beam welding Laser beam welding Multiobjective optimization Multiobjective optimization Nearest neighbor search Nearest neighbor search Particle swarm optimization (PSO) Particle swarm optimization (PSO) Regression analysis Regression analysis
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Deng, Xinguo , Wang, Lei , Chen, Jiarui et al. Prediction of laser welding process parameters by kernel ridge regression and MOPSO [J]. | Computer Integrated Manufacturing Systems, CIMS , 2021 , 27 (11) : 3131-3137 . |
| MLA | Deng, Xinguo et al. "Prediction of laser welding process parameters by kernel ridge regression and MOPSO" . | Computer Integrated Manufacturing Systems, CIMS 27 . 11 (2021) : 3131-3137 . |
| APA | Deng, Xinguo , Wang, Lei , Chen, Jiarui , Xu, Haiwei . Prediction of laser welding process parameters by kernel ridge regression and MOPSO . | Computer Integrated Manufacturing Systems, CIMS , 2021 , 27 (11) , 3131-3137 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
逃逸布线是印刷电路板设计的一个重要组成部分.针对并行逃逸布线的方法用于较大规模电路板布线时速度慢且结果不够好的问题,该文提出一种结合改进A*算法与拆线重布的有序逃逸布线方法.首先,通过代价预估函数确定引脚的布线顺序,使用改进A*算法初始化有序逃逸布线.接着,优化同长度布线路径,调整拥挤区域布线路径.最后,使用A*算法和广度优先搜索进行拆线重布.实验结果表明,该方法对给出的所有测试用例都实现了100％的逃逸,得到有序逃逸路径的可行解非常接近最优解,CPU时间比布尔可满足性问题(SAT)算法与最小费用多商品流(MMCF)算法平均减少分别约为95.6％,?97.8％,总体线长也接近最优.提出的方法能够明显减少寻找可行解的时间,提高布线质量.
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 邓新国 , 叶似锦 , 陈家瑞 et al. 结合改进A*算法与拆线重布的有序逃逸布线 [J]. | 电子与信息学报 , 2021 , 43 (6) : 1609-1616 . |
| MLA | 邓新国 et al. "结合改进A*算法与拆线重布的有序逃逸布线" . | 电子与信息学报 43 . 6 (2021) : 1609-1616 . |
| APA | 邓新国 , 叶似锦 , 陈家瑞 , 陈传东 . 结合改进A*算法与拆线重布的有序逃逸布线 . | 电子与信息学报 , 2021 , 43 (6) , 1609-1616 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
逃逸布线是印刷电路板设计的一个重要组成部分。针对并行逃逸布线的方法用于较大规模电路板布线时速度慢且结果不够好的问题,该文提出一种结合改进A~*算法与拆线重布的有序逃逸布线方法。首先,通过代价预估函数确定引脚的布线顺序,使用改进A~*算法初始化有序逃逸布线。接着,优化同长度布线路径,调整拥挤区域布线路径。最后,使用A~*算法和广度优先搜索进行拆线重布。实验结果表明,该方法对给出的所有测试用例都实现了100%的逃逸,得到有序逃逸路径的可行解非常接近最优解,CPU时间比布尔可满足性问题(SAT)算法与最小费用多商品流(MMCF)算法平均减少分别约为95.6%, 97.8%,总体线长也接近最优。提出的...
Keyword ：
A~*算法 A~*算法 拆线重布 拆线重布 最短路径 最短路径 有序逃逸布线 有序逃逸布线
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 邓新国 , 叶似锦 , 陈家瑞 et al. 结合改进A~*算法与拆线重布的有序逃逸布线 [J]. | 电子与信息学报 , 2021 , 43 (06) : 1609-1616 . |
| MLA | 邓新国 et al. "结合改进A~*算法与拆线重布的有序逃逸布线" . | 电子与信息学报 43 . 06 (2021) : 1609-1616 . |
| APA | 邓新国 , 叶似锦 , 陈家瑞 , 陈传东 . 结合改进A~*算法与拆线重布的有序逃逸布线 . | 电子与信息学报 , 2021 , 43 (06) , 1609-1616 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Export
| Results： |
Selected to |
| Format： |
