K9 Analysis

Make Analog Circuit Design & Analysis

Dog-Gone Simple

 

Daisy

Plato

Brandy

Shadow

 

Analog Circuit Analysis has changed little in the last 30 years.  The purpose of this web site is to illustrate that there is a simpler and better way.  Analog Circuit Design and Analysis need not be difficult.  To make it Dog-Gone Simple, K9 Analysis introduces a new circuit theorem, Daisy's Theorem, two new gain formula's, Plato’s Gain Formula and Brandy's Gain Formula, plus Shadow’s Design procedure.

Daisy’s Theorem states that a linear circuit can not have net gain.  The sum of ALL circuit gains must be equal to one.  This theorem is virtually unknown.  K9 Analysis uses Daisy’s theorem to create a unified Design procedure. 

Plato’s Gain Formula is the gain formula for single op-amp circuits.  The formula covers most circuit configurations.  It states that the circuit gain is the Feedback Impedance divided by the Input Impedance times a fudge factor.

Brandy’s Gain Formula is the gain formula for passive circuits.  It states that the circuit gain is the parallel combination of the destination node impedances divided by the connecting Impedance.  This simplifies passive circuit design and allows circuit schematics to be transformed into Signal Flow Graphs.

Shadow’s Design Procedure will create a passive or single op-amp circuit to implement a linear circuit equation. You specify the gain or gains that you want and the procedure creates the circuit. Shadow creates optimum circuits.  Ozzie’s Rule identifies components that can be eliminated if a balanced design is not required.

K9 Analysis uses a unified approach.  For op-amps, there is no distinction between inverting amplifiers, non-inverting amplifiers, differential amplifiers, or integrators.  For passive circuits, there is no distinction between resistors, capacitors, or inductors.  Every passive component is simply an Impedance. 

Analog Circuit Analysis has the reputation of requiring a lot of math.  Deriving Circuit equations can be a difficult task.  K9 Analysis makes the derivation of circuit equations Dog-Gone Simple.  The need for calculus, complex variables, and differential equations is eliminated by using Impedances instead of reactive components.  The Procedure creates a Signal Flow Graph from the circuit schematic.  Circuit equations are created via Mason's Gain Formula.  You simply write the desired equation.  There is no need for matrices or algebraic manipulations.  The procedure works for all linear circuits.  There is no need to use tricks to reduce the circuit.  Feedback is handled automatically.

The K9 procedures contain simple checks to verify results.  These checks are designed to catch some errors.  They are not intended to replace bread boarding, or circuit simulation.

K9 Analysis is indeed Dog-Gone Simple. Unfortunately, the explanation may not meet this standard.  I need your help to improve this site.  Please send comments & suggestions to k9analysis@netzero.net.    

Visit Dieter's Home Page.                  Check out the Introduction Page.           Best viewed with Firefox.

© Dieter Knollman

Legal issues:

I claim ownership of the intellectual property rights to K9 analysis. My employer claimed, via an employment agreement, ownership to all intellectual property that I create.  My employer has given me permission to release the K9 Analysis intellectual property developed during my past employment.

I grant you the right to use the procedures and algorithms presented on this web site for personal, non-commercial use only. Any other use requires a donation to a K9 charity.

Disclaimer:

The material presented on this web page is presented as is. I have corrected many typos.

Verify your results via simulation, bread boarding, or legacy analysis.

 

History:

Added Ozzie s Rule

Added Analysis Examples

Added General Summing Amplifier Analysis

Expanded Daisy’s Theorem

Added Shadow

Added Noise reduction

Added Intro Page

 Added Simple Interpretations

Expanded Analysis

Last updated Nov 24 2007

Copyright 1999 Dieter Knollman

<

>