• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.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.06a
• /
• 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.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.3
• /
• pp.231-238
• /
• 2004

This paper presents the high speed noise reduction processing system using the modified discrete fourier transform(MDFT) on the frequency domain. The proposed filter uses the linear prediction coefficients of the adaptive line enhance(ALE) method based on the Sign algorithm The signals with a random noise tracking performance are examined through computer simulations. It is confirmed that the fast adaptive digital filter is realized by the high speed adaptive noise reduction(HANR) algorithm with rapid convergence on the frequency domain(FD).

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.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.

• Aerospace Engineering and Technology
• /
• v.9 no.1
• /
• pp.98-105
• /
• 2010

Fast Fourier Transform is the fast implementation of Discrete Fourier Transform, which deletes periodic operation of DFT. According to the definition, radix-2 FFT can be implemented byre cursive call which divides the input signal points into 2 signal points. Because of its time-consuming stack-copy operation, this recursive method is very slow. To overcome this drawback, butterfly operation with signal rearrangement was devised. Based on the ideas of signal rearrangement and butterfly operation, this paper applies the signal rearrangement method to the Radix-3 FFT and checks the validity of this method.

• Journal of Electrical Engineering and Technology
• /
• v.7 no.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.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.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.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.14 no.6
• /
• pp.26-30
• /
• 1977

Redundancies in the Calculation of DFT and FFT are analized and new algorithms are proposed which are capable of reducing the machine time by a considerable amount. New extensions of T.D C.F. and T.D.F.T. are given for the discrete case which permit a deeper insights for the techniques of digital signal Proessing i. e. Discrete Fourier Transform, Convolution Sum and Correlation sequences.

• Journal of Communications and Networks
• /
• v.8 no.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.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.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.