2020
DOI: 10.30880/ijie.2020.12.05.023
|View full text |Cite
|
Sign up to set email alerts
|

Development of a Noise Filtering Algorithm for Strain Signals Using the Fast Fourier Transform

Abstract: The purpose of this study is to filter the noise in strain signals based on the fast Fourier transform. The strain signals were measured at an automotive lower arm made from the SAE 1045 carbon steel driven on paving block and asphalt. This technique removed lower amplitude cycles as much as possible due to their contribution to the minimum fatigue damage and simultaneous maintenance of cumulative fatigue damage. The filtering algorithm was able to remove up to 36.2% of the lower amplitude cycles and maintain … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 16 publications
0
2
0
Order By: Relevance
“…To generate the smoothed displacement versus load curves shown in Figure 4(b), a fast Fourier transform (FFT) filter 18 was used. Every 20 data points (points of window, 10% of the total data on one curve) of each raw load-displacement curve were smoothed and the cutoff frequency was 0.6, which is a default parameter in Origin Pro V R (scientific graphic software).…”
Section: Smoothing Of the Load-displacement Curvementioning
confidence: 99%
“…To generate the smoothed displacement versus load curves shown in Figure 4(b), a fast Fourier transform (FFT) filter 18 was used. Every 20 data points (points of window, 10% of the total data on one curve) of each raw load-displacement curve were smoothed and the cutoff frequency was 0.6, which is a default parameter in Origin Pro V R (scientific graphic software).…”
Section: Smoothing Of the Load-displacement Curvementioning
confidence: 99%
“…where X(κ) is the frequency-domain signal and x(n) is the time-domain signal. (22) The main characteristic of FFT is that its computation speed is higher than that of DFT. The most important point is that the time-domain signal can be converted to the frequency-domain signal, and the frequency recognition has good accuracy.…”
Section: Fftmentioning
confidence: 99%