Speed comparison among methods for restoring signals with missing high-frequency components using two different low-pass-filter matrix dimensions

Download
  1. Get@NRC: Speed comparison among methods for restoring signals with missing high-frequency components using two different low-pass-filter matrix dimensions (Opens in a new window)
DOIResolve DOI: http://doi.org/10.1364/OL.10.000372
AuthorSearch for: ; Search for:
TypeArticle
Journal titleOptics Letters
ISSN0146-9592
Volume10
Issue8
Pages372374; # of pages: 3
AbstractAn 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.
Publication date
LanguageEnglish
AffiliationNational Research Council Canada
Peer reviewedYes
NRC number24852
NPARC number21273712
Export citationExport as RIS
Report a correctionReport a correction
Record identifier66cbdc2f-dc5a-4e6f-bb3f-bd66145b18e4
Record created2015-01-20
Record modified2016-05-09
Bookmark and share
  • Share this page with Facebook (Opens in a new window)
  • Share this page with Twitter (Opens in a new window)
  • Share this page with Google+ (Opens in a new window)
  • Share this page with Delicious (Opens in a new window)