Abstract

A criterion for simplicity, D norm criterion V (sub 2 infinity ) , and a noniterative algorithm (MEDD) proposed by Cabrelli, are based on the Varimax norm V (sub 2 4 ) of the minimum entropy deconvolution (MED). Mathematical analysis of the MEDD algorithm reveals that some part of the MEDD computation is unnecessary. In this paper, we present a fast algorithm (FD) which gives the same results as the MEDD algorithm but is ten times more efficient than MEDD. To improve the results of the MEDD algorithm, a new computational procedure (FD-MEDP) is also advanced and some numerical examples show the advantages of the new procedure.

This content is PDF only. Please click on the PDF icon to access.

First Page Preview

First page PDF preview
You do not currently have access to this article.