Optimization of digital MTI using quadratic programming

Procedures for optimization of nonrecursive and recursive digital MTI systems are reviewed and compared. A limitation in the current method used to synthesize nonrecursive MTI filters is identified and discussed. It is shown how the general nonrecursive MTI optimization problem can be put in the form of a Quadratic Programming problem. A general solution method using Dantzig´s modified simplex Linear Programming Algorithm is presented and discussed. A numerical example is provided to illustrate the method, and the results are compared against those obtained using current methods.