The problem of the unique parameter identification of nonuniform distributed RC networks is addressed in this dissertation. Previous literature provides for the equivalence of distributed networks with respect to the terminal characteristics. Therefore, the question is whether unique parameter identification is even possible. This work settles that question by presenting the sufficient conditions to insure a unique solution to the parameter identification problem. One theorem requires the knowledge of a driving-point impedance, the knowledge of the physical length, and the constraint that the r(x)c(x) product remains constant to insure uniqueness of the parameters r(x) and c(x). Relaxation of the r(x)c(x) product constraint allows for other combinations of r(x) and c(x) which produce identical terminal characteristics, thus destroying the uniqueness property. However, knowledge of a driving-point impedance, of the physical length, and of r(x) is sufficient to uniquely determine c(x). Sufficiency theorems which involve one of the [A,B,C,D] parameters rather than a driving-point impedance are also included.
A practical parameter identification routine is then presented in order to find the unknown parameters. A Fletcher-Powell/Davidon unconstrained minimization technique is used although any routine with appropriate convergence properties may be utilized. Examples of parameter identification of known networks are given --Abstract, page iii
