A new pre‐processing algorithm for analog circuit expression and simplification

Abstract

This paper has proposed a new pre‐processing stage algorithm to enhance the overall performance of current simplification algorithms in analog circuits. This pre‐process stage takes place after the calculation of symbolic transfer function and before the main core of the simplification algorithm. The detailed stages of this pre‐process are completely independent of the main simplification and symbolic transfer function algorithm. As such, the pre‐process algorithm can be easily added to any simplification algorithm to improve the total simplification performance. The use of this command, which is based on the stack decision method, helps the pre‐process algorithm to obtain a high‐process speed. Based on the CPU time simulation results for a transfer function with 139 terms, it is expected to have a total CPU time in the simplification of a 9820 term of about 28 to 30 seconds pulse and 1.2 to 4.9 seconds for the pre‐process algorithm. Finally, a total method, which involves the combination of this pre‐process algorithm with the main simplification algorithm is proposed in, and a CPU time of about 30 to 35 seconds is needed for simplifying a huge transfer function with 9820 terms. The addition of extra pre‐process algorithm to the main simplification algorithm will reduce the total CPU time of simulation from 820 to 35 seconds, indicating a reduction of 95% in the total needed simulation time.