• Proceedings of the KIEE Conference
• /
• 1999.11b
• /
• pp.288-290
• /
• 1999

In view of the importance of DFT(Discrete Fourier Transform) in spectrum analysis, its computation efficiency is a topic. This paper presents calculation time to extract the power frequency at a fault signal using DFT. Furthermore, it is tested a relaying algorithm based on modified DFT and its application to Micro-controller.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.261-264
• /
• 2001

본 논문에서는 OFDM 시스템용 복조기의 구현에 가장 핵심적인 소자인 2K/4K/8K-point FFT 프로세서를 제안하였다. 구현된 프로세서는 30MHz 시스템 클럭에 서 8,192개의 복소 입력 샘플을 273㎲에 2,048개의 복소 입력 샘플을 68.26㎲에 수행함으로써 OFDM방송에서 요구하는 심볼 fp이트의 데이터를 처리할 수 있다. 기본 구조는 1차원 DFT를 작은 크기의 2차원 DFT로 변환할 수 있는 쿨리-투키 알고리듬을 적용하였으며 다차원 DFT 변환에 적합한 전치 메모리와 셔플 메모리를 사용하였다. 복소 곱셈기는 기존의 방법보다 더 효율적인 메모리 구조를 갖는 CORDIC 프로세서를 사용하였으며 제안하는 트위들팩터 발생 방법은 트위들팩터를 저장하기 위한 ROM의 크기를 효과적으로 줄일 수 있다.

• Proceedings of the KIEE Conference
• /
• 2007.10a
• /
• pp.157-158
• /
• 2007

본 논문에서는 산업전반에 걸쳐 널리 사용되는 유도전동기의 고장상태를 검출하기 위해 DFT(Discreet Fourier Transform)와 LDA에 기반을 둔 진단 알고리즘을 제안하고자 한다. 실험에 의해 측정된 전류값을 DFT에 의해 시간공간에서 주파수 공간으로 변환한 후에 LDA기법을 이용하여 특징벡터를 산출한 후 거리 유사도에 의해 진단이 수행된다. 제안된 방법의 타당성을 보이기 위해 여섯 가지의 고장을 대상으로 다양한 조건하에서 실험한 결과 기존 방법에 비교하여 우수한 결과를 나타냈다.

• 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 KIISE:Databases
• /
• v.35 no.6
• /
• pp.481-494
• /
• 2008

In this paper we propose Fourier magnitudes based privacy preserving clustering on time-series data. The previous privacy-preserving method, called DFT coefficient method, has a critical problem in privacy-preservation itself since the original time-series data may be reconstructed from privacy-preserved data. In contrast, the proposed DFT magnitude method has an excellent characteristic that reconstructing the original data is almost impossible since it uses only DFT magnitudes except DFT phases. In this paper, we first explain why the reconstruction is easy in the DFT coefficient method, and why it is difficult in the DFT magnitude method. We then propose a notion of distance-order preservation which can be used both in estimating clustering accuracy and in selecting DFT magnitudes. Degree of distance-order preservation means how many time-series preserve their relative distance orders before and after privacy-preserving. Using this degree of distance-order preservation we present greedy strategies for selecting magnitudes in the DFT magnitude method. That is, those greedy strategies select DFT magnitudes to maximize the degree of distance-order preservation, and eventually we can achieve the relatively high clustering accuracy in the DFT magnitude method. Finally, we empirically show that the degree of distance-order preservation is an excellent measure that well reflects the clustering accuracy. In addition, experimental results show that our greedy strategies of the DFT magnitude method are comparable with the DFT coefficient method in the clustering accuracy. These results indicate that, compared with the DFT coefficient method, our DFT magnitude method provides the excellent degree of privacy-preservation as well as the comparable clustering accuracy.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05b
• /
• pp.241-246
• /
• 2004

Medical images are being managed more by PACS in general medical institutions. It is important to protect patients from being invaded their privacy related to the images. It is also necessary to confirm the ownership, the right of properity of the medical images and notice whether the data are modified. In this paper, we propose a robust watermarking against RST attacks in medical images on the PACS. The proposed scheme modifies and improves Log-Polar Mapping and Fourier Mellin Transform in order to realize and recover serious image degradation and watermark data loss caused by the conversion between cartesian coordinate and log-polar coordinate. We used the radius and theta Look Up Table to solve the realization of the Fourier Mellin Transform, and inserted a watermark into 2D-DFT magnitudes using Spread Spectrum. Experimental results shows that this method are robust to several attack.

• Journal of Korea Multimedia Society
• /
• v.8 no.11
• /
• pp.1510-1519
• /
• 2005

We proposed a digital watermarking method that it is possible to identify the copyright because the watermark is detected in the first print-scan and to protect a forgery because the watermark is not detected in the second print-scan. The proposed algorithm uses LPM and DFT transform for the robustness to the distortion of pixel value and geometrical distortion. This methods could improve watermark detection performance and image quality by selecting maximum sampling radius in LPM transform. After analyzing the characteristics of print-scan process, we inserted the watermark in the experimentally selected frequency bands that survives robustly to the first print-scan and is not detected in the second print-scan, using the characteristic of relatively large distortion in high frequency bands of DFT As the experimental result, the original proof is possible because average similarity degree 5.13 is more than the critical value 4.0 in the first print-scan. And the detection of forgery image is also possible because average similarity degree 2.76 is less than the critical value 4.0 in the second print-scan.

• 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 the Korea Institute of Military Science and Technology
• /
• v.9 no.4
• /
• pp.81-89
• /
• 2006

In this paper, a watermark technique for identifying friendly and foe is proposed during communication. The speech signal is processed in several stages. First, speech signal is partitioned into small time frames and the frames are transformed into frequency domain using DFT(Discrete Frequency Transform). The DFT coefficients are quantized and the watermark signal is embedded into the quantized DFT coefficients. At the destination channel quantization errors of received signal are regarded as the watermark signal. Identification of friendly and foe are done by correlating the detected watermark and the original watermark. As in most other watermark techniques, this method has a trade off between noise robustness and quality. However, this is solved by a partial quantization and a noise level dependent quantization step. Simulation results in the various noisy environments show that the proposed method is reliable for identification between friendly and foe.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.24 no.6
• /
• pp.655-663
• /
• 2021

In this paper, DFT-Based channel estimation with channel response mirroring is proposed and analyzed. In General, pilot symbols for channel estimation in MIMO(Multi-Input Multi-Output) OFDM(Orthogonal Frequency-Division Multiplexing) Systems have a diamond shape in the time-frequency plane. An interpolation technique to estimate the channel response of sub-carriers between reference symbols is needed. Various interpolation techniques such as linear interpolation, low-pass filtering interpolation, cubic interpolation and DFT interpolation are employed to estimate the non-pilot sub-carriers. In this paper, we investigate the conventional DFT-based channel estimation for noise reduction and channel response interpolation. The conventional method has performance degradation by distortion called "edge effect" or "border effect". In order to mitigate the distortion, we propose an improved DFT-based channel estimation with channel response mirroring. This technique can efficiently mitigate the distortion caused by the DFT of channel response discontinuity. Simulation results show that the proposed method has better performance than the conventional DFT-based channel estimation in terms of MSE.