A Study on Applicability of Predictive Maintenance and Vibration Data Analysis by Fast Fourier Transform into Major Equipment of Submarine

2021 ◽  
Vol 4 (1) ◽  
pp. 14-21
Author(s):  
Donghoon Kim ◽  
Sang Woo Kang ◽  
Ji Hoon Lee ◽  
Kyung Mo Nam ◽  
Seong Hun Seong ◽  
...  
Keyword(s):  
Fourier Transform ◽  
Data Analysis ◽  
Fast Fourier Transform ◽  
Predictive Maintenance ◽  
Vibration Data ◽  
Major Equipment

A Study on Applicability and Development Strategy of Predictive Maintenance into ** Ship with Equipment Vibration Data Analysis

2019 ◽  
Vol 2 (2) ◽  
pp. 61-65
Author(s):  
Donghoon Kim ◽  
Sunguk Hong ◽  
Gyeongeok Choi ◽  
Seonggyun Shin ◽  
Hyocheol Kim ◽  
...  
Keyword(s):  
Data Analysis ◽  
Development Strategy ◽  
Predictive Maintenance ◽  
Vibration Data

Recovery of Modal Information From a Beam Undergoing Random Vibration

1974 ◽  
Vol 96 (4) ◽  
pp. 1307-1313
Author(s):  
W. W. Parmenter ◽  
R. G. Christiansen
Keyword(s):  
Fourier Transform ◽  
Structural Analysis ◽  
Fast Fourier Transform ◽  
Random Process ◽  
Random Vibration ◽  
Structural Information ◽  
Process Theory ◽  
Acceleration Response ◽  
Vibration Data ◽  
Random Process Theory

An organized approach for implementing the techniques of random process theory in the recovery of structural information from random vibration data is presented. The boundaries of various configured Bernoulli-Euler like beams are subjected to random vibrations and the acceleration response of these beams is measured and recorded. The Fast Fourier Transform (FFT) makes the use of random process theory both a feasible and economical tool for experimental structural analysis.

Parallelisation of a 2-D Fast Fourier Transform Algorithm

1991 ◽  
Vol 02 (01) ◽  
pp. 363-366 ◽  
Author(s):  
ANDREW HAMMERSLEY
Keyword(s):  
Fourier Transform ◽  
Data Analysis ◽  
Fast Fourier Transform ◽  
Fourier Transforms ◽  
Computational Physics ◽  
Fast Fourier Transforms ◽  
Two Dimensional ◽  
Fast Fourier Transform Algorithm ◽  
Higher Dimension ◽  
Parallel Network

The calculation of two and higher-dimension Fast Fourier Transforms (FFT’s) are of great importance in many areas of data analysis and computational physics. The two-dimensional FFT is implemented for a parallel network using a master-slave approach. In-place performance is good, but the use of this technique as an “accelerator” is limited by the communications time between the host and the network. The total time is reduced by performing the host-master communications in parallel with the master-slave communications. Results for the calculation of the two-dimensional FFT of real-valued datasets are presented.

Sign in / Sign up

Export Citation Format

Share Document