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.

3.11 Linear Simplification Techniques 389<br />

Compute the voltage<br />

transfer function<br />

symbolically and expand<br />

the result.<br />

In[6]:= solution = Solve[eqs, V$5];<br />

v5 = Together[V$5 /. First[solution]]<br />

Out[7]=<br />

C2 R1 R2 RC RL s C1 RE s beta$Q1 C1 Ro$Q1 s C1 Cbc$Q1 Rbe$Q1 RE s 2 <br />

C1 Cbe$Q1 Rbe$Q1 RE s 2 C1 Cbc$Q1 Rbe$Q1 Ro$Q1 s 2 <br />

C1 Cbc$Q1 RE Ro$Q1 s 2 beta$Q1 C1 Cbc$Q1 RE Ro$Q1 s 2 <br />

C1 Cbc$Q1 Cbe$Q1 Rbe$Q1 RE Ro$Q1 s 3 <br />

R1 R2 RC R1 Rbe$Q1 RC R2 Rbe$Q1 RC R1 R2 RE R1 Rbe$Q1 RE <br />

R2 Rbe$Q1 RE R1 RC RE R2 RC RE R1 R2 Ro$Q1 R1 Rbe$Q1 Ro$Q1 <br />

R2 Rbe$Q1 Ro$Q1 R1 RE Ro$Q1 beta$Q1 R1 RE Ro$Q1 <br />

R2 RE Ro$Q1 beta$Q1 R2 RE Ro$Q1 C1 R1 R2 Rbe$Q1 RC s <br />

Cbc$Q1 R1 R2 Rbe$Q1 RC s Cbe$Q1 R1 R2 Rbe$Q1 RC s <br />

C1 R1 R2 Rbe$Q1 RE s 94 C2 Cbe$Q1 R2 Rbe$Q1 RE RL Ro$Q1 s 2 <br />

C2 Cbc$Q1 R1 RC RE RL Ro$Q1 s 2 beta$Q1 C2 Cbc$Q1 R1 RC RE RL<br />

Ro$Q1 s 2 C2 Cbc$Q1 R2 RC RE RL Ro$Q1 s 2 beta$Q1 C2 Cbc$Q1<br />

R2 RC RE RL Ro$Q1 s 2 C1 C2 Cbc$Q1 R1 R2 Rbe$Q1 RC RE RL s 3 <br />

C1 C2 Cbe$Q1 R1 R2 Rbe$Q1 RC RE RL s 3 C1 C2 Cbe$Q1 R1 R2 Rbe$Q1<br />

RC RE Ro$Q1 s 3 C1 Cbc$Q1 Cbe$Q1 R1 R2 Rbe$Q1 RC RE Ro$Q1 s 3 <br />

C2 Cbc$Q1 Cbe$Q1 R1 R2 Rbe$Q1 RC RE Ro$Q1 s 3 <br />

C1 C2 Cbc$Q1 R1 R2 Rbe$Q1 RC RL Ro$Q1 s 3 C2 Cbc$Q1 Cbe$Q1 R1 R2<br />

Rbe$Q1 RC RL Ro$Q1 s 3 C1 C2 Cbe$Q1 R1 R2 Rbe$Q1 RE RL Ro$Q1 s 3 <br />

C2 Cbc$Q1 Cbe$Q1 R1 R2 Rbe$Q1 RE RL Ro$Q1 s 3 <br />

C1 C2 Cbc$Q1 R1 R2 RC RE RL Ro$Q1 s 3 beta$Q1 C1 C2 Cbc$Q1 R1 R2<br />

RC RE RL Ro$Q1 s 3 C2 Cbc$Q1 Cbe$Q1 R1 Rbe$Q1 RC RE RL Ro$Q1 s 3 <br />

C2 Cbc$Q1 Cbe$Q1 R2 Rbe$Q1 RC RE RL Ro$Q1 s 3 <br />

C1 C2 Cbc$Q1 Cbe$Q1 R1 R2 Rbe$Q1 RC RE RL Ro$Q1 s 4 <br />

Here, the complexity estimate is identical to the true number of terms in the denominator of the<br />

symbolic transfer function. In the general case, the estimate yields a lower bound for this number.<br />

Determine number of<br />

terms in the denominator<br />

of the transfer function.<br />

In[8]:= Length[Denominator[v5]]<br />

Out[8]= 132<br />

3.11.2 ApproximateTransferFunction<br />

ApproximateTransferFunction[expr, fvar, dp, error]<br />

approximates the transfer function expr by discarding<br />

insignificant terms where fvar, dp, and error denote the<br />

complex frequency variable, the design point, and the<br />

bound for the coefficient error<br />

Command structure of ApproximateTransferFunction.<br />

ApproximateTransferFunction approximates a symbolic transfer function by discarding insignificant<br />

terms from its coefficients (simplification after generation, SAG). The significance or insignificance of<br />

a term is evaluated on the basis of numerical reference values for the symbols (the design point). For<br />

each coefficient, the algorithm removes the numerically least significant terms until the maximum<br />

coefficient error is reached.

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

Saved successfully!

Ooh no, something went wrong!