• Journal of Electrical Engineering and Technology
• /
• 제7권2호
• /
• pp.163-170
• /
• 2012

This paper presents a DFT (Discrete Fourier Transform) based estimation algorithm for the parameters of a low-frequency oscillating signal. The proposed method estimates the parameters, i.e., the frequency, the damping factor, the mode amplitude, and the phase, by fitting a discrete Fourier spectrum with an exponentially damped cosine function. Parameter estimation algorithms that consider the spectrum leakage of the discrete Fourier spectrum are introduced. The multi-domain mode test functions are tested in order to verify the accuracy and efficiency of the proposed method. The results show that the proposed algorithms are highly applicable to the practical computation of low-frequency parameter estimations based on DFTs.

• Journal of Communications and Networks
• /
• 제1권2호
• /
• pp.86-88
• /
• 1999

The Discrete Fourier Transform (DFT) and the Inverse Discrete Fourier Transform (IDFT) are commonly used in signal processing applications, in particular in digital communication sys-tems using the multi-carrier modulation principle. In such systems an IDFT is computed at the transmitter end, and a DFT at the re-ceiver end. This paper examines a technique of computations, for which only negligible differences appear between the DFT and the IDFT calculations while the number of arithmetic operations re-quired is substantially reduced. This offers significant advantages for the design of an IDFT/DFT processor for Discrete Multitone(DMT) systems.

• 한국철도학회논문집
• /
• 제9권1호
• /
• pp.63-68
• /
• 2006

This paper proposes a fast Fourier transform(FFT)-based spectral analysis method(SAM) for the dynamic responses of the linear discrete dynamic models with non-proportional damping. The SAM was developed by using discrete Fourier transform(DFT)-theory. To verify the proposed SAM, a three-DOF system with non-proportional viscous damping is considered as an illustrative example. The present SAM is evaluated by comparing the dynamic responses obtained by SAM with those obtained by Runge-Kutta method.

• 대한전자공학회논문지
• /
• 제26권10호
• /
• pp.1617-1623
• /
• 1989

The introduction of the fast Fourier transform(FFT),an efficient computational algorithm for the discrete Fourier transform(DFT) by Cooley and Tukey(1965), has brought to the limelight various other discrete transforms. Some of the analog functions from which these transforms have been derived date back to the early 1920's, for example, Walsh functions (Walsh, 1923) and Hadamard Transform(Enomoto et al, 1965). Fast algorithms developed for the forward transform are equally applicable, exept for minor changes, to the inverse transform. In this paper, we present a simple pipelined Hadamard matrix(HM) which is used to develop a fast algorithm for the Hadamard Processor (HP). The Fast Hadamard Transform(FHT) can be derived using matrix partitioning techniques. The HP system is incorporated through a modular design which permits tailoring to meet a wide range of video data link applications. Emphasis has been placed on a low cost, a low power design suitable for airbone system and video codec.

• Journal of Communications and Networks
• /
• 제13권5호
• /
• pp.449-455
• /
• 2011

Inspired by fast Jacket transforms, we propose simple factorization and construction algorithms for the M-dimensional discrete Fourier transform (DFT) matrices underlying generalized Chinese remainder theorem (CRT) index mappings. Based on successive coprime-order DFT matrices with respect to the CRT with recursive relations, the proposed algorithms are presented with simplicity and clarity on the basis of the yielded sparse matrices. The results indicate that our algorithms compare favorably with the direct-computation approach.

• 한국소음진동공학회논문집
• /
• 제22권3호
• /
• pp.291-297
• /
• 2012

Conventional Fourier analysis can give only limited information about the dynamic characteristics of nonstationary signals. Instead, time-frequency analysis is widely used to investigate the nonstationary signal in detail. Several time-frequency analysis methods are compared for a typical acoustic emission burst generated during the impact between a ferrite ceramic and aluminum plate. This AE burst is inherently nonstationary and random containing many frequency contents, which leads to severe interference between cross terms in bilinear convolution type distributions. The smoothing and reassignment processes can improve the readability and resolution of the results. Spectrogram and scalogram of the AE burst are obtained and compared to get the characteristics information. Renyi entropies are computed for various bilinear time-frequency transforms to evaluate the randomness. These bilinear transforms are reassigned by using the improved algorithm in discrete computation.

• ETRI Journal
• /
• 제32권1호
• /
• pp.33-43
• /
• 2010

The increasing demand for non-sinusoidal currents affects the quality of distribution networks. Harmonic detection is a crucial step in the cancellation of those components by active power filters. In this paper, the discrete cosine transform (DCT) is compared with different implementations based on Fourier transforms, demonstrating their equivalences and the advantages provided by the former. We demonstrate that the phase error in the presence of grid frequency deviations and the transient length are reduced by half in comparison to the discrete Fourier transform. A novel algorithm is developed to provide frequency adaptation to the DCT, taking advantage of its good features. The window width is adjusted in real time according to the actual value of the grid fundamental frequency by means of a phase-locked loop. A technique based on dithering is employed to overcome the limitation caused by the truncation of the window number of samples, so the frequency resolution is enhanced. The theoretical approach is verified by simulated and experimental results.

• 호남수학학술지
• /
• 제37권3호
• /
• pp.299-315
• /
• 2015

In this paper, we study the first-order system least-squares (FOSLS) spectral method for parabolic partial differential equations. There were lots of least-squares approaches to solve elliptic partial differential equations using finite element approximation. Also, some approaches using spectral methods have been studied in recent. In order to solve the parabolic partial differential equations in parallel, we consider a parallel numerical method based on a hybrid method of the frequency-domain method and first-order system least-squares method. First, we transform the parabolic problem in the space-time domain to the elliptic problems in the space-frequency domain. Second, we solve each elliptic problem in parallel for some frequencies using the first-order system least-squares method. And then we take the discrete inverse Fourier transforms in order to obtain the approximate solution in the space-time domain. We will introduce such a hybrid method and then present a numerical experiment.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2005년도 추계학술대회 논문집
• /
• pp.409-414
• /
• 2005

In the literatures, the FFT-based SAM has been well applied to the computation of the steady-state responses of discrete dynamic systems. In this paper, a fast fourier transforms (FFT)-based spectral analysis method (SAM) is proposed fur the dynamic analysis of spectral element models subjected to the non-zero initial conditions. However, the FFT-based SAM has not yet been developed for the continuous systems represented by the spectral element model.

• 한국정보처리학회논문지
• /
• 제6권4호
• /
• pp.1112-1119
• /
• 1999

디지털 워터마킹(digital watermarking)이란 영상이나 비디오, 오디오, 텍스트 등의 저작물에 잘 식별되지 않는 표시를 삽입하여 저작권을 보호하는 방법으로 소유권자의 동의 없이 저작물을 배포, 복사되는 것을 방지하는 방법이다. 주파수 공간에서의 적응형(adaptive) 워터마킹 알고리즘을 제안한다. 본 논문에서는 워터마크를 삽입하기 위해서 사인(sin)함수와 코사인(cos)함수를 이용한 푸리에(Fourier) 급수전개를 이용하였다. 우선, 원 이미지를 주파수 영역을 변환한 다음 워터마크를 삽입할 위치를 저주파 대역으로 한정지어 결정하였으며, M 개의 파형을 가장 직교성(orthogonality)이 좋다고 하는 사인함수와 코사인함수를 이용하여 푸리에 급수 전개를 하였다. 이때, 사인과 코사인의 n 차 고조파는 Random Sequence를 발생하여 결정하였다. 제안한 알고리즘은 이와 같이 푸리에급수전개를 했을 때 각 항의 푸리에 계수를 산출하여 이 푸리에계수에 워터 마크를 삽입하였다. 실험결과 JPEG 압축, 블러링(Bluring), 노이즈 삽입 등의 이미지 왜곡에 대하여 워터마크 상관관계가 최소 0.5467에서 최대 0.9507까지의 견고성(robustness)을 보였다. 본 논문에서는 256$\times$256 크기의 8비트 256 명암값(gray-level)을 갖는 Lenna 이미지를 이용하였다.