Closed-Form Solutions for the Design of Optimum Matching Networks

Abstract

<para xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> An analytic solution of optimum matching networks up through order <formula formulatype="inline"><tex Notation="TeX">$n= {4}$</tex></formula> is derived. Prior solutions use iterative methods. Examples are given that show direct solution of the matching network elements, and the examples also include insertion of an ideal transformer. Comments on <formula formulatype="inline"><tex Notation="TeX">$n= {5}~{\hbox{and}}~ 6$</tex></formula> networks are also included. </para>