基于电路压缩的单开路故障快速分析算法  

An efficient algorithm for single open-defect analysis based on circuit compaction

作　　者：骆祖莹[1] 张昌明[1] 邢霄雄[1] 甯青松[1] 吴文川[1] 

机构地区：[1]北京师范大学信息科学与技术学院,北京100875

出　　处：《高技术通讯》2009年第11期1170-1175,共6页Chinese High Technology Letters

基　　金：863计划(2009AA01Z126;2007AA01Z109);国家自然科学基金(60876025;40672195)资助项目

摘　　要：基于多网格和等效电路这两种电路压缩方法,提出了一种电源线/地线(P/G)网络单故障高效分析算法,以有效地提高P/G网单开路电阻故障的测试效率。该算法包括3个算法步骤:先采用多网格方法和等效电路方法对电路进行大幅度地压缩,此过程具有快速与高精度的优点,再采用连续过松弛(SOR)求解算法求解剩余电路的电压分布,最后根据已知电压节点快速而精确地返算出被压缩节点的电压。实验数据表明:该算法具有精度高、算法复杂性低、应用范围广等优点。与通用的不完全乔勒斯基分解共轭梯度(ICCG)求解算法相比,该算法在保持较高精度(误差小于0.0276%)的前提下,速度可以提高106倍,同时还可以求解ICCG算法无法处理的测例。Based on the muh-grid method for circuit compaction and the equivalent circuit method for circuit compaction, an efficient algorithm for single open-defect analysis is proposed in this paper to augment the test efficiency for debugging open defects in power/ground （P/G） networks. The algorithm consists of three successive steps. The first step uses the equivalent circuit method and the multi-grid method to aggressively compact the circuit, which is of visible advantages on efficiency and accuracy. The second step uses the successive over-relaxation （SOR） algorithm for solving the remaindering circuit. The SOR algorithm becomes the favor owing to high efficiency and easy coding. The third step efficiently and accurately back-solves the cancelled nodes based on the voltage-known nodes. The experiments show that the new algorithm is of high accuracy, low complexity, wide applications, and so on. Compared with the general incomplete Cholesky decomposition conjugate gradient （ICCG） algorithm, this method is 106 times the speed with the penalty of 0. 0276% accuracy loss, and can solve two additional test cases that are unsolved to ICCG.

关 键 词：P/G网 连续过松驰(SOR) 开路故障 算法 不完全乔勒斯基分解共轭梯度(ICCG) 

分 类 号：TN401[电子电信—微电子学与固体电子学]