|
马上注册,结交更多好友,享用更多功能,让你轻松玩转社区。
您需要 登录 才可以下载或查看,没有账号?注册
x
Symbolic analysis techniques offer a complementary way to analyze analog
integrated circuits. Since the results of symbolic analysis are analytic equations that
explicitly describe the functionality (e.g. transfer function, impedance, pole/zero...) of
the circuit as a symbolic expression of the design variables, it lends itself more for
designers to gain insight into the behavior of the circuit. Questions like “how does the
circuit actually work?”, “at what node is the dominant pole located?”, “what is the
relation between the bias current and the gain-bandwidth?”, “what is the impact of
device mismatch on the PSRR of this circuit”, “which transistor(s) actually is the
dominant noise source?”, “which nonlinearity is creating the most third-order
distortion?” etc. can be answered by means of symbolic analysis. Originally
hampered by the exponential complexity of the symbolic analysis problem,
approximation techniques that typically exploit designer intent or common design
practice had to be developed to make the results interpretable for humans. Symbolic
expressions are however also useful in many other applications that require the
repeated evaluation of circuit characteristics for a wide range of parameter values,
such as for example encountered in circuit optimization or in yield analysis. Not
requiring interpretation by humans, a wide range of efficient algorithmic techniques
iv
has been developed in the past years to overcome the complexity issue and to make
symbolic analysis tractable for circuits of practical size.
1608050955.part1.rar
(14 MB, 下载次数: 783 )
1608050955.part2.rar
(1.69 MB, 下载次数: 436 )
|
|