• Title/Summary/Keyword: fourier

Search Result 4,993, Processing Time 0.034 seconds

Noise Reduction of PPG Signal During Free Movements Using Adaptive SFLC(Scaled Fourier Linear Combiner) (적응 SFLC(Scaled Fourier Linear Combiner)를 이용한 활동 중의 PPG 신호의 잡음 감소)

  • Kim, Sung-Min;Cha, Eun-Jong;Kim, Deok-Won;Yoo, Jae-Ha;Kim, Dong-Yon;Kim, Soo-Chan
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.55 no.3
    • /
    • pp.138-141
    • /
    • 2006
  • Blood flow is one of vital signals related to human physiological information. Photoplethysmograph (PPG) has been used to measure indirectly heart rate, blood oxygen saturation ($SpO_2$), and so on. Because PPG signal is weak and sensitive to motion artifacts, it is very important to continuously obtain stable PPG signal during free movement. In this study, we applied the scaled Fourier linear combiner (SFLC) using both the adaptive filter and FLC to remove effectively the motion artifacts as well as background noise in the real time without additional signal correlated with motion from a accelerometer. The proposed method would be useful to reduce the movement and background noise which are not synchronized with heart rate.

A Study on Signal Analyser Design using Fast Walsh Transform (고속월쉬변환을 이용한 신호분석기 설계에 관한 연구)

  • Han, Sang-Wook;Shin, Seung-Kwon;Park, Jun-Hun;Oh, Min-Whan;Han, Sang-In;Ahn, Du-Su
    • Proceedings of the KIEE Conference
    • /
    • 2000.07d
    • /
    • pp.2614-2616
    • /
    • 2000
  • This paper presents the Walsh-Fourier conversion algorithm and Signal Analysis Technique. The Fourier coefficients are determined as the combinations of the Walsh coefficients in terms of the new Walsh-Fourier conversion algorithm. This paper checks the analysis of the Walsh-Fourier spectra and the approximate synthesis of the waveform via one example.

  • PDF

Stamping Tool Wearing Analysis by Time-Frequency Analysis (시간-주파수 분석에 의한 금형 마모 분석)

  • Lee, Chang-Hee;Han, Ho-Young;Seo, Geun-Seok;Kim, Yong-Yun
    • Journal of the Korean Society of Manufacturing Technology Engineers
    • /
    • v.19 no.3
    • /
    • pp.407-413
    • /
    • 2010
  • This paper reports on the research which analyzes acoustic signals acquired in progressive compressing, hole blanking, and burr compacting process. An acoustic sensor was set on the bed of hydraulic press. Acoustic signal is generated from progressive stamping process. First the signal acquired from the unit process; compressing, blanking or compacting, is studied by Fourier Transform and Short Time Fourier Transform. The blanking process emitted ultrasonic signal with more than 20kHz, but the compressing and compacting processes emitted acoustic signals with lower than 10kHz. The combined signals periodically acquired right after the tool grinding were then analyzed. 70-80kHz signals appeared in time-frequency domain, but not in the frequency domain, the magnitude of which was related to the tool wear. Short Time Fourier Transform made up for the Fourier Transform in analyzing the emitted signal for stamping process in the ultrasonic domain.

Modified Constrained Notch Fourier Transform (MCNFT) for Sinusoidal Signals in Noise and Its Performance

  • Xiao, Yegui
    • Proceedings of the IEEK Conference
    • /
    • 2000.07b
    • /
    • pp.673-676
    • /
    • 2000
  • Adaptive Fourier analysis of sinusoidal signals in noise is of essential importance in many engineering fields. So far, many adaptive algorithms have been developed for this purpose. In particular, a filter bank based algorithm called constrained notch Fourier transform of its cost-efficiency and easily controllable performance. However, its performance deteriorates when the signal frequencies are not uniformly spaced. This paper proposes, at first, a new structure for the CNFT, referred to as modified CNFT (MCNFT), to compensate the performance degeneration of the CNFT for noisy sinusoidal signals with non-uniformly spaced frequencies. Next, a detailed performance analysis for the MCNFT is conducted. Closed form expression of steady-state mean square error (MSE) for the discrete Fourier coefficients (DFCs) is derived. Extensive simulations are presented to demonstrate the improved performance of the MCNFT and the validity of the analytical results.

  • PDF

Path Planning for Manipulators Using Fourier Series (퓨리에 급수를 이용한 매니퓰레이터 경로 계획)

  • 원종화;최병욱;정명진
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.29B no.10
    • /
    • pp.27-36
    • /
    • 1992
  • This paper proposes a numerical method of motion planning for manipulators using Foruier series. For a redundant manipulator, we predetermine the trajectories of redundant joints in terms of the Nth partial sum of the fourier series. then the optimal coefficients of the fourier series are searched by the Powell's method. For a nonredundant or redundant manipulator, CS02T-continuous smooth joint trajectory for a point-to-point task can be obtained while considering the frequency response. We apply the proposed method to the 3-link planar manipulator and the PUMA 560 manipulator. To show the validity of the proposed method, we analyze solutions by the Fast Fourier Transform (FFT). Also, several features are discussed to obtain an optimal solution.

  • PDF

Shift-invariant face recognition based on the karhunen-loeve approximationof amplitude spectra of fourier-transformed faces (Fourier 변환된 얼굴의 진폭스펙트럼의 karhunen-loeve 근사 방법에 기초한 변위불변적 얼굴인식)

  • 심영미;장주석;김종규
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.35C no.3
    • /
    • pp.97-107
    • /
    • 1998
  • In face recognition based on the Karhunen-Loeve approximation, amplitudespectra of Fourier transformed facial images were used. We found taht the use of amplitude spetra gives not only the shift-invariance property but also some improvment of recognition rate. This is because the distance between the varing faces of a person compared with that between the different persons perfomed computer experiments on face recognitio with varing facial images obtained from total 55 male and 25 females. We confirmed that the use of amplitude spectra of Fourier-trnsformed facial imagesgives better recognition rate for avariety of varying facial images including shifted ones than the use of direct facial images does.

  • PDF

A TRANSLATION THEOREM FOR THE GENERALIZED FOURIER-FEYNMAN TRANSFORM ASSOCIATED WITH GAUSSIAN PROCESS ON FUNCTION SPACE

  • Chang, Seung Jun;Choi, Jae Gil;Ko, Ae Young
    • Journal of the Korean Mathematical Society
    • /
    • v.53 no.5
    • /
    • pp.991-1017
    • /
    • 2016
  • In this paper we define a generalized analytic Fourier-Feynman transform associated with Gaussian process on the function space $C_{a,b}[0,T]$. We establish the existence of the generalized analytic Fourier-Feynman transform for certain bounded functionals on $C_{a,b}[0,T]$. We then proceed to establish a translation theorem for the generalized transform associated with Gaussian process.

A NONLINEAR CONVEX SPLITTING FOURIER SPECTRAL SCHEME FOR THE CAHN-HILLIARD EQUATION WITH A LOGARITHMIC FREE ENERGY

  • Kim, Junseok;Lee, Hyun Geun
    • Bulletin of the Korean Mathematical Society
    • /
    • v.56 no.1
    • /
    • pp.265-276
    • /
    • 2019
  • For a simple implementation, a linear convex splitting scheme was coupled with the Fourier spectral method for the Cahn-Hilliard equation with a logarithmic free energy. However, an inappropriate value of the splitting parameter of the linear scheme may lead to incorrect morphologies in the phase separation process. In order to overcome this problem, we present a nonlinear convex splitting Fourier spectral scheme for the Cahn-Hilliard equation with a logarithmic free energy, which is an appropriate extension of Eyre's idea of convex-concave decomposition of the energy functional. Using the nonlinear scheme, we derive a useful formula for the relation between the gradient energy coefficient and the thickness of the interfacial layer. And we present numerical simulations showing the different evolution of the solution using the linear and nonlinear schemes. The numerical results demonstrate that the nonlinear scheme is more accurate than the linear one.

PAPR reduction of OFDM systems using H-SLM method with a multiplierless IFFT/FFT technique

  • Sivadas, Namitha A.
    • ETRI Journal
    • /
    • v.44 no.3
    • /
    • pp.379-388
    • /
    • 2022
  • This study proposes a novel low-complexity algorithm for computing inverse fast Fourier transform (IFFT)/fast Fourier transform (FFT) operations in binary phase shift keying-modulated orthogonal frequency division multiplexing (OFDM) communication systems without requiring any twiddle factor multiplications. The peak-to-average power ratio (PAPR) reduction capacity of an efficient PAPR reduction technique, that is, H-SLM method, is evaluated using the proposed IFFT algorithm without any complex multiplications, and the impact of oversampling factor for the accurate calculation of PAPR is analyzed. The power spectral density of an OFDM signal generated using the proposed multiplierless IFFT algorithm is also examined. Moreover, the bit-error-rate performance of the H-SLM technique with the proposed IFFT/FFT algorithm is compared with the classical methods. Simulation results show that the proposed IFFT/FFT algorithm used in the H-SLM method requires no complex multiplications, thereby minimizing power consumption as well as the area of IFFT/FFT processors used in OFDM communication systems.

Multiple change-point estimation in spectral representation

  • Kim, Jaehee
    • Communications for Statistical Applications and Methods
    • /
    • v.29 no.1
    • /
    • pp.127-150
    • /
    • 2022
  • We discuss multiple change-point estimation as edge detection in piecewise smooth functions with finitely many jump discontinuities. In this paper we propose change-point estimators using concentration kernels with Fourier coefficients. The change-points can be located via the signal based on Fourier transformation system. This method yields location and amplitude of the change-points with refinement via concentration kernels. We prove that, in an appropriate asymptotic framework, this method provides consistent estimators of change-points with an almost optimal rate. In a simulation study the proposed change-point estimators are compared and discussed. Applications of the proposed methods are provided with Nile flow data and daily won-dollar exchange rate data.