论文信息 - Computing Robust Walsh-Fourier Transform by Error Product Minimization

Computing Robust Walsh-Fourier Transform by Error Product Minimization

A scheme for computing the Walsh-Fourier transform of noisy data is presented. The results are insensitive to isolated noise points, even when their magnitudes are large.

C. K. Yuen | C. Yuen

[1] H. Ekblom. Calculation of linear bestLp-approximations , 1973 .

[2] J. Rice. The approximation of functions , 1964 .

[3] John L. Shanks,et al. Computation of the Fast Walsh-Fourier Transform , 1969, IEEE Transactions on Computers.

[4] Chung-Kwong Yuen. On the Twiddling Factors , 1973, IEEE Transactions on Computers.

[5] H. Andrews,et al. Hadamard transform image coding , 1969 .

[6] Irving John Good,et al. The Interaction Algorithm and Practical Fourier Analysis , 1958 .

[7] R. Fletcher,et al. The Calculation of Linear Best L_p Approximations , 1971, Comput. J..

[8] H. Ekblom,et al. $L_p $-Criteria for the Estimation of Location Parameters , 1969 .

[9] T.W. Cairns,et al. Finite Abelian Groups , 2018, Algebra.

[10] S. W. Kahng. Best _{} approximation , 1972 .