A Dynamic Programming Approach to Optimization of Switching Networks Composed of Digital Switching Matrices

In this paper, the problem of selecting minimum cost switching networks composed of digital switching matrices is discussed. It is shown that the conventional continuous optimization method may lead to nonoptimal structures. The optimization problem is solved by using the dynamic programming principle. The relevant formulas are derived and samplings of the results of optimization are presented. Different network structures are compared and discussed.