Discrete-Time EC Filtering Algorithms
With the mathematical frame work established, we can now focus on the construction and characterization of algorithms for computing solutions. Convex programming is a broad class of problems and there is no general efficient method for finding solutions. Different classes of (convex programming) problems would require different algorithms depending on the specific nature imposed by engineering considerations.
KeywordsLine Search Finite Impulse Response Quadratic Programming Problem Finite Impulse Response Filter Steep Descent
Unable to display preview. Download preview PDF.