The Backward-traversing Relaxation Algorithm for Circuit Simulation

Abstract

This paper proposes a new relaxation-based circuit simulation algorithm that is more robust and efficient than traditional methods such as waveform relaxation (WR) and iterated timing analysis (ITA). The new method employs a brand new strategy to simulate: it simulates by performing depth-first search in the signal flow graph of simulated circuits. The new method flexibly schedules subcircuits for calculating according to converging situations of subcircuits, so it can achieve robustness as well as efficiency in dealing with various types of circuits. A circuit simulation program based on the proposed method has been implemented, and various circuits have been tested to justify its performance