Skip to Main Content
An efficient algorithm is proposed for the computer synthesis of linear networks of arbitrary configuration. Given a circuit approximately realizing a network function T(s), the element values are perturbed until T(s) is precisely realized. In the process, positive elements may be "grown" across nodes as required, or may be forced to desired values. Examples in the areas of passive and active filter design are given, and limitations of the procedure are discussed. Also, the method is shown to be related to the theory of equivalent networks.