• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.26 no.12
• /
• pp.1091-1099
• /
• 2015

UFMC(Universal-Filtered Multi-carrier) and FBMC(Filter Bank Multi-carrier) system are receiving attention as candidate waveforms for 5G mobile communication system. But, these systems have high PAPR(Peak to Average Power Ratio) problem because these systems use a number of subcarrier. In this paper, we propose DFT(Discrete Fourier Transform) spreading based DFT-s(spreading)-UFMC system and DFT-s-FBMC system in order to overcome the PAPR drawback. In order to evaluate PAPR performance of the proposed systems, we design and simulate OFDM(Orthogonal Frequency Division Multiplexing), UFMC, FBMC, DFT-s-OFDM, DFT-s-UFMC, DFT-s-FBMC system. As simulation results, each PAPR performance of DFT-s-OFDM system, DFT-s-UFMC system, and DFT-s-FBMC system rise by 2.7 dB, 2.8 dB, and 1.1 dB respectively by DFT spreading technique.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.4C
• /
• pp.440-446
• /
• 2007

This paper addresses a new representation of DFT matrix via the Jacket transform based on the element inverse processing. We simply represent the inverse of the DFT matrix following on the factorization way of the Jacket transform, and the results show that the inverse of DFT matrix is only simply related to its sparse matrix and the permutations. The decomposed DFT matrix via Jacket matrix has a strong geometric structure that exhibits a block modulating property. This means that the DFT matrix decomposed via the Jacket matrix can be interpreted as a block modulating process.

• Journal of KIISE:Databases
• /
• v.33 no.7
• /
• pp.693-707
• /
• 2006

To improve performance using a multidimensional index in similar sequence matching, we transform a high-dimensional sequence to a low-dimensional sequence, and then construct a low-dimensional MBR that contains multiple transformed sequences. In this paper we propose a formal method that transforms a high-dimensional MBR itself to a low-dimensional MBR, and show that this method significantly reduces the number of lower-dimensional transformations. To achieve this goal, we first formally define the new notion of MBR-safe. We say that a transform is MBR-safe if a low-dimensional MBR to which a high-dimensional MBR is transformed by the transform contains every individual low-dimensional sequence to which a high-dimensional sequence is transformed. We then propose two MBR-safe transforms based on DFT and DCT, the most representative lower-dimensional transformations. For this, we prove the traditional DFT and DCT are not MBR-safe, and define new transforms, called mbrDFT and mbrDCT, by extending DFT and DCT, respectively. We also formally prove these mbrDFT and mbrDCT are MBR-safe. Moreover, we show that mbrDFT(or mbrDCT) is optimal among the DFT-based(or DCT-based) MBR-safe transforms that directly convert a high-dimensional MBR itself into a low-dimensional MBR. Analytical and experimental results show that the proposed mbrDFT and mbrDCT reduce the number of lower-dimensional transformations drastically, and improve performance significantly compared with the $na\"{\i}ve$ transforms. These results indicate that our MBR- safe transforms provides a useful framework for a variety of applications that require the lower-dimensional transformation of high-dimensional MBRs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.4
• /
• pp.415-423
• /
• 2016

High PAPR (Peak-to-Average Power Ratio) characteristic causes some problems like system performance degradation and OOB (Out-of-Band) power increasement under the HPA (High Power Amplifier) nonlinearity condition. UFMC (Universal Filtered Multi-Carrier) and FBMC (Filter Bank Multi-Carrier) are regarded as 5G(Generation) candidate waveforms. In this paper, we evaluate and analyze performance of these systems with DFT-s (Discrete Fourier Transform Spreading) technique under the nonlinear HPA environment. In this paper, we describe OFDM (Orthogonal Frequency Division Multiplexing), UFMC, FBMC, DFT-s-OFDM, DFT-s-UFMC, and DFT-s-FBMC system, and evaluate BER (Bit Error Rate) performance of these systems. As simulation results, BER performance degradation by HPA nonlinearity of DFT-s-OFDM and DFT-s-UFMC is greatly overcome by DFT spreading technique. However, BER performance degradation by HPA nonlinearity of DFT-s-FBMC system is little overcome.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.66 no.6
• /
• pp.898-904
• /
• 2017

DFT(Discrete Fourier Transform) is one of the most widely used method to estimate the phasor of a relaying signal. The harmonics are eliminated by the DFT. However, high frequency components, except for harmonics, are not removed and cause an error in DFT-based phasor estimation process. This paper suggests high frequency noise reduction method by using a newly designed low-pass filter to estimate a signal phasor. When selecting a stop-band cut-off frequency of the low-pass filter, high frequency components generated by faults are considered. To reduce the phasor estimation delay caused by a low-pass filter, this paper proposes a low-pass filter whose settling time is reduced. An adverse effect of high frequency noise on DFT-based phasor estimation is reduced. To evaluate the performance of the proposed method, signals which are collected under a fault condition at a 345[kV] transmission system modeled by EMTP-RV are used.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.62 no.7
• /
• pp.891-897
• /
• 2013

The power system frequency plays an important role in monitoring and controlling the power system. The frequency can be measured through discrete Fourier transform (DFT) coefficients of its positive fundamental frequency. The accuracy of the frequency estimate is severely affected by noise in the power system signal and the leakage effect of the negative fundamental frequency in DFT. This paper proposes a DFT-based frequency estimation algorithm to cope with the noise as well as the leakage effect. In this algorithm, two suitable digital filters are introduced to reduce efficiently frequency estimate error due to the noise. These filters are designed to use a digital bandpass filter and a second-degree integrator. The effectiveness of the proposed algorithm in reduction of frequency estimate error is verified through simulations on noise, harmonics and frequency deviation.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.57 no.2
• /
• pp.102-108
• /
• 2008

AC generator plays an important role of power system. The large AC generator fault may lead to large impacts or perturbations in power system. And then the protection of a generator has very important role in maintaining stability in a power system. In present, the DFT(discrete Fourier transform) based RDR(ratio differential relay) had been widely applied to a internal fault of a generator stator winding. But DFT has a serious drawback. In the course of transforming a target signal to frequency domain, time information is lost. DWT uses a time-scale region. This paper proposes an advanced fault detection algorithm using DWT(discrete Wavelet transform) to enhance the drawback of conventional DFT based relaying. To evaluate the performance of the proposed relaying, we used the test data which were sampled with 720 [Hz] per cycle and obtained from ATP(alternative transient program) simulation. And we made a comparative study of conventional DFT based RDR and the proposed relaying.

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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.6C
• /
• pp.594-599
• /
• 2007

In this paper, we present new representation of DCT/DFT matrices via one hybrid architecture. Based on a element inverse matrix factorization algorithm, we show that the DCT and DFT have a same recursive computational pattern, and we can develop an hybrid architecture by using some diagonal matrices.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.50 no.12
• /
• pp.584-589
• /
• 2001

This paper presents an implementation method of multi-channel synchronized phasor measurement device, which is based on the ASIC implementation of the sliding-DFT. A time-shared multiplier structure is proposed to minimize the number of gates required for the implementation. The design is verified by the timing simulation of its operation. The effect of coefficient approximation in the recursive implementation of the sliding-DFT is analytically derived and verified with the computer simulations.