DOI | Trouver le DOI : https://doi.org/10.1364/OL.10.000372 |
---|
Auteur | Rechercher : Abdelmalek, Nabih N.1; Rechercher : Otsu, Nobuyuko |
---|
Affiliation | - Conseil national de recherches du Canada
|
---|
Format | Texte, Article |
---|
Résumé | 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. |
---|
Date de publication | 1985-08-01 |
---|
Dans | |
---|
Langue | anglais |
---|
Publications évaluées par des pairs | Oui |
---|
Numéro du CNRC | NRCC 24852 |
---|
Numéro NPARC | 21273712 |
---|
Exporter la notice | Exporter en format RIS |
---|
Signaler une correction | Signaler une correction (s'ouvre dans un nouvel onglet) |
---|
Identificateur de l’enregistrement | 66cbdc2f-dc5a-4e6f-bb3f-bd66145b18e4 |
---|
Enregistrement créé | 2015-01-20 |
---|
Enregistrement modifié | 2020-03-17 |
---|