• 제목/요약/키워드: Fourier Function

검색결과 612건 처리시간 0.027초

DFT 기반의 시스템 모델링을 이용한 DC Motor의 위치제어 (The Position Control of DC Motor using the System Modeling based on the DFT)

  • 안현진;심관식;임영철;남해곤;김광헌;김의선
    • 전기학회논문지
    • /
    • 제61권4호
    • /
    • pp.542-548
    • /
    • 2012
  • This study presents a new method of system modeling by using the Discrete Fourier Transform for the position control system of DC Motor. And the proposed method is similar to the method of System Identification by analysis of correlation of the measured input-output data. The measured output signals are transformed to the frequency domain using DFT. The Fourier Spectrum of the transformed signals is used for knowing to the feature of having an important effect on the system. And transfer function of the second order system is estimated by the dominant parameter which is computed in the magnitude and the phase of Fourier spectrum of the transformed signals. In addition, the output signal includes the unique feature of system. So, although the basic parameter of the system is unknown for us, the proposed method has an advantage to system modeling. And the controller is easily designed by the estimated transfer function. Thus, in this paper, the proposed method is applied to the system modeling for the position control system of DC Motor and the PD-controller is designed by the estimated model. And the efficiency and the reliability of the proposed method are verified by the experimental result.

상승 Cosine 함수와 그 n-제곱 함수의 Fourier 변환을 구하기 위한 용이한 방법: 부분 응답 시스 템 개념을 이용한 순환 공식 (An Easy Way to Derive the Fourier Transforms of the Truncated Raised-Cosine Function and the n-th Order Powers of it Using Partial-Response System Concept : A Recursive Formula)

  • 오용선;강창언
    • 한국통신학회논문지
    • /
    • 제17권1호
    • /
    • pp.29-37
    • /
    • 1992
  • 본 논문에서는 일반적 형태의 상승 Cosine함수와 그 n-제곱 함수에 대한 Fourier변환을 해석적으로 구하는 새롭고 용이한 방법을 제안하였다. 이는 (1+D)형 부분응답 시스템의 개념에 근거를 두고 있으며, 또 함수에 의하여 변환되는 기존의 방법에 비하여 매우 간결함을 보인다. 특히, 이러한 방법에 의하여 유도되는 해는 각각의 차수에 대하여 다루기 용이한 세 함수의 합으로 주어지며, 이들은 차수에 따라 순환적 관계를 유지한다. 따라서 이러한 과정은 컴퓨터에 의한 수치적 변환에 대해서도 매우 잘 적용된다.

  • PDF

Empirical mode decomposition based on Fourier transform and band-pass filter

  • Chen, Zheng-Shou;Rhee, Shin Hyung;Liu, Gui-Lin
    • International Journal of Naval Architecture and Ocean Engineering
    • /
    • 제11권2호
    • /
    • pp.939-951
    • /
    • 2019
  • A novel empirical mode decomposition strategy based on Fourier transform and band-pass filter techniques, contributing to efficient instantaneous vibration analyses, is developed in this study. Two key improvements are proposed. The first is associated with the adoption of a band-pass filter technique for intrinsic mode function sifting. The primary characteristic of decomposed components is that their bandwidths do not overlap in the frequency domain. The second improvement concerns an attempt to design narrowband constraints as the essential requirements for intrinsic mode function to make it physically meaningful. Because all decomposed components are generated with respect to their intrinsic narrow bandwidth and strict sifting from high to low frequencies successively, they are orthogonal to each other and are thus suitable for an instantaneous frequency analysis. The direct Hilbert spectrum is employed to illustrate the instantaneous time-frequency-energy distribution. Commendable agreement between the illustrations of the proposed direct Hilbert spectrum and the traditional Fourier spectrum was observed. This method provides robust identifications of vibration modes embedded in vibration processes, deemed to be an efficient means to obtain valuable instantaneous information.

A TIME-INDEPENDENT CONDITIONAL FOURIER-FEYNMAN TRANSFORM AND CONVOLUTION PRODUCT ON AN ANALOGUE OF WIENER SPACE

  • Cho, Dong Hyun
    • 호남수학학술지
    • /
    • 제35권2호
    • /
    • pp.179-200
    • /
    • 2013
  • Let $C[0,t]$ denote the function space of all real-valued continuous paths on $[0,t]$. Define $X_n:C[0,t]{\rightarrow}\mathbb{R}^{n+1}$ by $Xn(x)=(x(t_0),x(t_1),{\cdots},x(t_n))$, where $0=t_0$ < $t_1$ < ${\cdots}$ < $t_n$ < $t$ is a partition of $[0,t]$. In the present paper, using a simple formula for the conditional expectation given the conditioning function $X_n$, we evaluate the $L_p(1{\leq}p{\leq}{\infty})$-analytic conditional Fourier-Feynman transform and the conditional convolution product of the cylinder functions which have the form $$f((v_1,x),{\cdots},(v_r,x))\;for\;x{\in}C[0,t]$$, where {$v_1,{\cdots},v_r$} is an orthonormal subset of $L_2[0,t]$ and $f{\in}L_p(\mathbb{R}^r)$. We then investigate several relationships between the conditional Fourier-Feynman transform and the conditional convolution product of the cylinder functions.

CONDITIONAL FORUIER-FEYNMAN TRANSFORM AND CONVOLUTION PRODUCT FOR A VECTOR VALUED CONDITIONING FUNCTION

  • Kim, Bong Jin
    • Korean Journal of Mathematics
    • /
    • 제30권2호
    • /
    • pp.239-247
    • /
    • 2022
  • Let C0[0, T] denote the Wiener space, the space of continuous functions x(t) on [0, T] such that x(0) = 0. Define a random vector $Z_{\vec{e},k}:C_0[0,\;T] {\rightarrow}{\mathbb{R}}^k$ by $$Z_{\vec{e},k}(x)=({\normalsize\displaystyle\smashmargin{2}{\int\nolimits_0}^T}\;e_1(t)dx(t),\;{\ldots},\;{\normalsize\displaystyle\smashmargin{2}{\int\nolimits_0}^T}\;ek(t)dx(t))$$ where ej ∈ L2[0, T] with ej ≠ 0 a.e., j = 1, …, k. In this paper we study the conditional Fourier-Feynman transform and a conditional convolution product for a cylinder type functionals defined on C0[0, T] with a general vector valued conditioning functions $Z_{\vec{e},k}$ above which need not depend upon the values of x at only finitely many points in (0, T] rather than a conditioning function X(x) = (x(t1), …, x(tn)) where 0 < t1 < … < tn = T. In particular we show that the conditional Fourier-Feynman transform of the conditional convolution product is the product of conditional Fourier-Feynman transforms.

A NOTE ON RECURRENCE FORMULA FOR VALUES OF THE EULER ZETA FUNCTIONS ζE(2n) AT POSITIVE INTEGERS

  • Lee, Hui Young;Ryoo, Cheon Seoung
    • 대한수학회보
    • /
    • 제51권5호
    • /
    • pp.1425-1432
    • /
    • 2014
  • The Euler zeta function is defined by ${\zeta}_E(s)=\sum_{n=1}^{\infty}\frac{(-1)^{n-1}}{n^8}$. The purpose of this paper is to find formulas of the Euler zeta function's values. In this paper, for $s{\in}\mathbb{N}$ we find the recurrence formula of ${\zeta}_E(2s)$ using the Fourier series. Also we find the recurrence formula of $\sum_{n=1}^{\infty}\frac{(-1)^{n-1}}{(2_{n-1})^{2s-1}}$, where $s{\geq}2({\in}\mathbb{N})$.

반복적인 위상 랩핑 방법을 이용한 실질적인 암호화 및 복호화 시스템 (Practical Encryption and Decryption System using Iterative Phase Wrapping Method)

  • 서동환;이성근;김윤식
    • Journal of Advanced Marine Engineering and Technology
    • /
    • 제32권6호
    • /
    • pp.955-963
    • /
    • 2008
  • In this paper, we propose an improved practical encryption and fault-tolerance decryption method using a non-negative value key and random function obtained with a white noise by using iterative phase wrapping method. A phase wrapping operating key, which is generated by the product of arbitrary random phase images and an original phase image. is zero-padded and Fourier transformed. Fourier operating key is then obtained by taking the real-valued data from this Fourier transformed image. Also the random phase wrapping operating key is made from these arbitrary random phase images and the same iterative phase wrapping method. We obtain a Fourier random operating key through the same method in the encryption process. For practical transmission of encryption and decryption keys via Internet, these keys should be intensity maps with non-negative values. The encryption key and the decryption key to meet this requirement are generated by the addition of the absolute of its minimum value to each of Fourier keys, respectively. The decryption based on 2-f setup with spatial filter is simply performed by the inverse Fourier transform of the multiplication between the encryption key and the decryption key and also can be used as a current spatial light modulator technology by phase encoding of the non-negative values. Computer simulations show the validity of the encryption method and the robust decryption system in the proposed technique.

Analytical solution of the Cattaneo - Vernotte equation (non-Fourier heat conduction)

  • Choi, Jae Hyuk;Yoon, Seok-Hun;Park, Seung Gyu;Choi, Soon-Ho
    • Journal of Advanced Marine Engineering and Technology
    • /
    • 제40권5호
    • /
    • pp.389-396
    • /
    • 2016
  • The theory of Fourier heat conduction predicts accurately the temperature profiles of a system in a non-equilibrium steady state. However, in the case of transient states at the nanoscale, its applicability is significantly limited. The limitation of the classical Fourier's theory was overcome by C. Cattaneo and P. Vernotte who developed the theory of non-Fourier heat conduction in 1958. Although this new theory has been used in various thermal science areas, it requires considerable mathematical skills for calculating analytical solutions. The aim of this study was the identification of a newer and a simpler type of solution for the hyperbolic partial differential equations of the non-Fourier heat conduction. This constitutes the first trial in a series of planned studies. By inspecting each term included in the proposed solution, the theoretical feasibility of the solution was achieved. The new analytical solution for the non-Fourier heat conduction is a simple exponential function that is compared to the existing data for justification. Although the proposed solution partially satisfies the Cattaneo-Vernotte equation, it cannot simulate a thermal wave behavior. However, the results of this study indicate that it is possible to obtain the theoretical solution of the Cattaneo-Vernotte equation by improving the form of the proposed solution.

Conditional Integral Transforms on a Function Space

  • Cho, Dong Hyun
    • Kyungpook Mathematical Journal
    • /
    • 제52권4호
    • /
    • pp.413-431
    • /
    • 2012
  • Let $C^r[0,t]$ be the function space of the vector-valued continuous paths $x:[0,t]{\rightarrow}\mathbb{R}^r$ and define $X_t:C^r[0,t]{\rightarrow}\mathbb{R}^{(n+1)r}$ and $Y_t:C^r[0,t]{\rightarrow}\mathbb{R}^{nr}$ by $X_t(x)=(x(t_0),\;x(t_1),\;{\cdots},\;x(t_{n-1}),\;x(t_n))$ and $Y_t(x)=(x(t_0),\;x(t_1),\;{\cdots},\;x(t_{n-1}))$, respectively, where $0=t_0$ < $t_1$ < ${\cdots}$ < $t_n=t$. In the present paper, using two simple formulas for the conditional expectations over $C^r[0,t]$ with the conditioning functions $X_t$ and $Y_t$, we establish evaluation formulas for the analogue of the conditional analytic Fourier-Feynman transform for the function of the form $${\exp}\{{\int_o}^t{\theta}(s,\;x(s))\;d{\eta}(s)\}{\psi}(x(t)),\;x{\in}C^r[0,t]$$ where ${\eta}$ is a complex Borel measure on [0, t] and both ${\theta}(s,{\cdot})$ and ${\psi}$ are the Fourier-Stieltjes transforms of the complex Borel measures on $\mathbb{R}^r$.

Data-Driven Smooth Goodness of Fit Test by Nonparametric Function Estimation

  • Kim, Jongtae
    • Communications for Statistical Applications and Methods
    • /
    • 제7권3호
    • /
    • pp.811-816
    • /
    • 2000
  • The purpose of this paper is to study of data-driven smoothing goodness of it test, when the hypothesis is complete. The smoothing goodness of fit test statistic by nonparametric function estimation techniques is proposed in this paper. The results of simulation studies for he powers of show that the proposed test statistic compared well to other.

  • PDF