• 전기학회논문지
• /
• 제57권9호
• /
• pp.1485-1490
• /
• 2008

This paper proposes a new Fourier transform-based phasor estimation method to eliminate the adverse influence of the exponentially decaying dc offsets when Discrete Fourier Transform (DFT) is used to calculate the phasor of the fundamental frequency component in a relaying signal. By subtracting the result of odd-sample-set DFT from the result of even-sample-set DFT, the information of dc offsets can be obtained. Two dc offsets in a relaying signal are treated as one dc offset which is piecewise approximated in one cycle data window. The effect of the dc offsets can be eliminated by the approximated dc offset. The performance of the proposed algorithm is evaluated by using computer-simulated signals and EMTP-generated signals. The algorithm is also tested on a hardware board with TMS320C32 microprocessor. The evaluation results indicate that the proposed algorithm has the stable and accurate eliminating performance even if the input signal contains two decaying dc components having different time constants.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.225-228
• /
• 2005

According to a popularization of the Internet and digital lifestyle, digital watermarks have been proposed for protection of copyrighted multimedia content. In blind watermark detection, which an original image is not provided, robustness against geometric distortion and compression remains challenging. In this paper, we propose a new perceptual blind discrete wavelet transform - discrete Fourier transform (DWT-DFT) composite watermarking scheme that is robust against both general linear transform and JPEG compression. This algorithm constructs an image-dependent watermark in the most significant DWT coefficients, which is determined by using a hierarchical tree structure. Strength of watermark is determined from a just-noticeable difference (JND) profile of a perceptual model. Furthermore, a desired template is inserted into DFT domain of the watermarked image. In new manner, a cross-ratio of four collinear points is used for detecting the template. Experimental results have showed that the proposed scheme is robust against general linear distortion, JPEG compression and various general kinds of attacks in the Stirmark 3.1 watermark evaluation tool.

• 대한전자공학회논문지SP
• /
• 제41권3호
• /
• pp.231-238
• /
• 2004

주파수 영역에서의 적응 신호처리는 입력의 자기 상관 행렬에 이산 퓨리에 변환(DFT Discrete Fourier Transform)을 이용할 때 거의 대각선화 되는 특성으로 인해 시간영역 적응필터보다 주파수 영역 적응 필터가 빠르게 적응한다. 본 논문에서는 변형된 이산 퓨리에 변환(MDFT: modified DFT)을 이용하여 주파수 영역 적응 필터를 설계함으로써 안정한 수렴 속도를 갖는 잡음 제거 시스템을 제안한다. 제안한 구조는 MDFT를 이용하여 연산수를 최소화하며, 안정한 수렴을 유지하면서 블록 없는 처리를 할 수 있고, 최적의 수렴 속도를 위해 입력 자기 상관 행렬에 MDFT를 사용해 근사적으로 대각화 시키고 시간적으로 변하는 스텝 크기를 정규화 하는 고속 적응 잡음 제거(HANR: high speed adaptive noise reduction) 알고리즘이다. HANR 알고리즘을 적용한 필터는 DFT변환법을 사용한 LMS방법(non-proposed)보다 30%정도의 속도 개선이 있다.

• 대한전자공학회논문지
• /
• 제26권11호
• /
• pp.1880-1885
• /
• 1989

In this paper, a new approach for systolic array realizing the discrete cosine transform (DCT) based on discrete Fourier transform (DFT) of an input sequence is presented. The proposed array is based on a simple modified DFT(MDFT) version of the Goertzel algorithm combined with Kung's approach and is proved perfectly. This array requires N cells, one multiplier and takes N clock cycles to produce a complete N-point DCT and also is able to process a continuous stream of data sequences. We have analyzed the output signal-to-noise ratio(SNR) and designed the circuit level layout of one-PE chip. The array coefficients are static adn thus stored-product ROM's can be used in place of multipliers to limit cost as eliminate errors due to coefficients quantization.

• 항공우주기술
• /
• 제9권1호
• /
• pp.98-105
• /
• 2010

고속푸리에변환(Fast Fourier Transform)은 이산푸리에변환(Discrete Fourier Transform)의 주기적으로 반복되는 연산을 생략하여 그 속도를 향상시킨 연산방법이다. Radix-2 FFT는 그 정의에 따라 함수 재귀호출에 의해 구현될 수 있는데 이 방법은 스택복사 과정의 시간소모 때문에 고속동작이 어렵게 된다. 이를 극복하기 위해 신호점을 연산순서에 맞게 미리 재배열하고 배열된 신호점을 나비연산하는 방법으로 고속연산을 구현할 수 있다. 이 논문은 신호점 재배열 방법에 의한 Radix-2 FFT의 고속연산에 착안하여 Radix-3 FFT에 신호점 재배열 방식을 적용해 보고 그 타당성에 관해 고찰하였다.

• 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.

• 전기학회논문지
• /
• 제59권8호
• /
• pp.1360-1365
• /
• 2010

In this paper, we propose a distance relaying algorithm using a Discrete Fourier Transform (DFT)-based modified phasor estimation method to eliminate the adverse influence of exponentially decaying DC offsets. Most distance relays are based on estimating phasors of the voltage and current signals. A DFT is generally used to calculate the phasor of the fundamental frequency component in digital protective relays. However, the output of the DFT contains an error due to exponentially decaying DC offsets. For this reason, distance relays have a tendency to over-reach or under-reach in the presence of DC offset components in a fault current. Therefore, the decaying DC components should be taken into consideration when calculating the phasor of the fundamental frequency component of a relaying signal. The error due to DC offsets in a DFT is calculated and eliminated using the outputs of an even-sample-set DFT and an odd-sample-set DFT, so that the phasor of the fundamental component can be accurately estimated. The performance of the proposed algorithm is evaluated for a-phase to ground faults on a 345 kV, 50 km, simple overhead transmission line. The Electromagnetic Transient Program (EMTP) is used to generate fault signals. The evaluation results indicate that adopting the proposed algorithm in distance relays can effectively suppress the adverse influence of DC offsets.

• 대한전자공학회논문지
• /
• 제14권6호
• /
• pp.26-30
• /
• 1977

DFT 및 FFT의 계산과정에 포함된 redunduncy를 분석하고 이 redundancy를 최대한으로 감소시키는 방장을 제안하였다. 이로서 FFT계산 등을 위한 계산기시간이 대폭감축됨을 실증하였다. T.D.C.F와 T.D.F.T 등을 Discrete한 경우에 확장하여 Digital Signal Processing의 여러 과정에 있어서 더 길은 물리적 뜻을 부여할 수가 있었다.

• Journal of Communications and Networks
• /
• 제8권3호
• /
• pp.323-329
• /
• 2006

For orthogonal frequency division multiplexing (OFDM), the discrete Fourier transform (DFT)-based processing at the receiver has been perceived equivalent to the matched filter (MF)-based processing. In this paper, we revisit the equivalence and mathematically show that when the guard interval is insufficient, the well-known DFT-based processing inherently causes more intersymbol and interchannel interference (ISI/ICI) than the MF-based processing. Then, with the adverse increase of interference, analytical expressions for the link performance are derived in terms of bit error rate (BER). Numerical results from computer simulation and analysis are presented to justify our claims.

• 대한전자공학회논문지
• /
• 제25권7호
• /
• pp.851-858
• /
• 1988

In this paper, we propose two different VLSI architectures for the parallel computation of DCT (discrete cosine transform) algorithm. First, it is shown that the DCT algorithm can be implemented on the existing systolic architecture for the DFT(discrete fourier transform) by introducing some modification. Secondly, a new prime factor DCT algorithm based on the prime factor DFT algorithm is proposed. And it is shown that the proposed algorihtm can be implemented in parallel on the systolic architecture for the prime factor DFT. However, proposed algorithm is only applicable to the data length which can be decomposed into relatively prime and odd numbers. It is also found that the proposed systolic architecture requires less multipliers than the structures implementing FDCT(fast DCT) algorithms directly.