A NONITERATIVE ALGORITHM FOR DECONVOLUTION‐INVERSE FILTERING USING THE CHEBYSHEV MINIMAX NORM FOR THE APPROXIMATION ERROR: Part II: Performance

Abstract

The aim of this paper is to show that in the case of even input signals with sidelobes of equal amplitude and arbitrary sign the D‐algorithm introduced in the first part of this paper subtitled “Theory”, may give a solution which is equal to that with the Chebyshev minimax norm for the approximation error. It is proved that, with some restrictions, in the case of two, four, and six sidelobe even input signals, the algorithm discussed gives exactly the Chebyshev minimax solution—CMS. Also, properties of the algorithm in the case of more general input signal are discussed.

Citation

DYKA, A. and UGOWSKI, H. (1989), "A NONITERATIVE ALGORITHM FOR DECONVOLUTION‐INVERSE FILTERING USING THE CHEBYSHEV MINIMAX NORM FOR THE APPROXIMATION ERROR: Part II: Performance", COMPEL - The international journal for computation and mathematics in electrical and electronic engineering, Vol. 8 No. 1, pp. 1-15. https://doi.org/10.1108/eb010048