Modular analysis for H type sneak circuit in complex electrical network

When the circuit topology becomes larger, it will cost more time to analysis the sneak circuit problem using the clue table method. To solve this problem, use the modular analysis method to analyze the sneak circuit in complex electrical network. The circuit netlist was used as the input which was assembled by standard SPICE 3F5. The electrical network model was established based on the graph theory and the model wad described as adjacency matrix. The equivalent between electrical network and the graph model was determined. This model was used to search the paths in circuit and analyzed the characteristics of the H type sneak circuit problem in existing electrical network topology. The depth-first searching algorithm was chosen to determine whether there was H type sneak circuit problem in circuit network. The method used the hyper graph theory to deal with the modular in complex circuit network and proposed sub-block partition principles and the analysis method. After choosing some key point, the network was divided into some sub-block; this division followed the partition principles. After analyzing all the sub-blocks, the paths were judged to determine whether there was any sneak circuit problem. The example proved that this method can correctly analyze the H type sneak circuit problem and it can be applied to the actual sneak circuit analysis process.