23.01.2015 Views

Download - Wolfram Research

Download - Wolfram Research

Download - Wolfram Research

SHOW MORE
SHOW LESS
  • No tags were found...

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

130 2. Tutorial<br />

2.8 Linear Symbolic Approximation<br />

2.8.1 Introduction to Symbolic Approximation<br />

The Complexity Problem<br />

If you have previous experiences with symbolic circuit analysis programs or if you have done some<br />

experiments with Analog Insydes before reading this chapter you may have already become aware<br />

of a major obstacle which is inherent to symbolic computations. While the carefully selected example<br />

circuits analyzed in the preceding chapters all yield transfer functions of no more than a few lines<br />

in length minor modifications such as adding an element or two to the circuit or choosing a slightly<br />

more complex transistor model may already lead to expressions of incredible size. In fact, expression<br />

complexity increases exponentially with the number of symbols in your circuit descriptions, allowing<br />

for full symbolic analysis of very small circuits only.<br />

6<br />

V1<br />

R1<br />

100k<br />

RC<br />

2.2k<br />

C2<br />

3 5<br />

C1<br />

1u<br />

1 2<br />

VCC<br />

Q1<br />

100n 4 RL Vout<br />

47k<br />

R2 RE<br />

47k<br />

1k<br />

Figure 8.1: Common-emitter amplifier with coupling capacitors and resistive load<br />

Let us demonstrate this effect by computing the symbolic voltage transfer function of the commonemitter<br />

amplifier displayed in Figure 8.1. This circuit is essentially the same as the common-emitter<br />

amplifier from Section 2.3.1 (see Figure 3.1) except that coupling capacitors and a resistive load have<br />

been added.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!