论文信息 - Optimal smoothing of 'noisy' data by fast Fourier transform

Optimal smoothing of 'noisy' data by fast Fourier transform

The theory of optimal filtering and smoothing of noisy data is presented. Implementation of this theory is made on the AS/7000 computer at Daresbury Laboratory. The Fortran code and examples of application on 'typical' spectroscopic data are given. The routine size is 35 kbytes and the CPU time 0.11 s for 1024 points.

E. L. Kosarev | E Pantos | E. Kosarev | E. Pantos

[1] J. P. Christiansen,et al. Four67, a fast fourier transform package , 1984 .

[2] E. L. Kosarev,et al. Applications of integral equations of the first kind in experiment physics , 1980 .

[3] Norman C. Rasmussen,et al. Application of fourier transforms to the analysis of spectral data , 1968 .

[4] W. Murray. Numerical Methods for Unconstrained Optimization , 1975 .

[5] H. Spath. Spline-Algorithmen zur Konstruktion glatter Kurven und Flächen , 1978 .

[6] Emmanuel Pantos. The SRS program library , 1983 .

[7] Spline interpolation and smoothing of data , 1984 .

[8] J. Kaiser,et al. Data smoothing using low‐pass digital filters , 1977 .

[9] Richard C. Singleton,et al. Algorithm 338: algol procedures for the fast Fourier transform , 1968, Commun. ACM.

[10] M J Hopper,et al. Harwell Subroutine Library. A Catalogue of Subroutines (1973). Supplement Number 2. , 1973 .