Closed-Form Solutions for the Design of Optimum Matching Networks

An analytic solution of optimum matching networks up through order n = 4 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 n = 5 and 6 networks are also included.