An arithmetic operations (multiplications and divisions) count is presented for three recent algorithms that restore signals with missing high-frequency components. The cases when the discrete Fourier-transform (DFT) low-pass-filter matrices had dimensions (a) N by N and (b) N by L were studied, where N is the whole signal length and L is the length of its known part. We show that when N is large all these algorithms are 2 orders of magnitude slower for case (a) than for case (b). We also suggest a method for calculating the rank of the DFT low-pass-filter matrix for case (b) that gives more-accurate results than those previously published.

© 1985 Optical Society of America

You do not have subscription access to this journal. Citation lists with outbound citation links are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Log in to access OSA Member Subscription

You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Log in to access OSA Member Subscription

You do not have subscription access to this journal. Article level metrics are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Log in to access OSA Member Subscription