• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.42 no.7
• /
• pp.610-615
• /
• 2014

Filterbanks have been widely used in the field of multi-channel signal processing for their simple efficient implementation architectures. Especially, the polyphase DFT(Discrete Fourier Transform) filterbank is the most preferred filterbank for the uniform spaced multi-channel processing due to its simplicity. In frequency hopped communication systems, however, the use of the polyphase DFT filterbank is limited due to its undesirable transient response from hop-to-hop transitions. In this paper, the transient response of polyphase DFT filterbanks in the hop-to-hop transition was analyzed, and the efficient methods to overcome such a problem was proposed. Simulation results showed that the proposed schemes could resolve this issue efficiently.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.17 no.7 s.110
• /
• pp.638-647
• /
• 2006

Recently, the DFT-Spread OFDM has been studied for the PAPR reduction. However, the DFT-Spread OFDM produces more ICI and SCI problems than OFDM because phase offset mismatch of the DFT spreading code results from the random phase noise in the oscillator. In this paper, at first, phase noise influence on the DFT-Spread OFDM system is theoretically analyzed in terms of the BER performance. Then, the conventional ICI self-cancellation methods are discussed and two kinds of ICI self-cancellation methods are newly proposed. Lastly, a new DFT-Spread OFDM system which selectively adopts the ICI self-cancellation technique is proposed to resolve the interference problem and PAPR reduction simultaneously. Proposednew DFT-Spread OFDM system can minimize performance degradation caused by phase noise, and still maintain the low PAPR property. Among the studied methods, DFT-Spread OFDM with data-conjugate method or newly proposed symmetric data-conjugate method show the significant performance improvements, compared with the DFT-Spread OFDM without ICI self-cancellation schemes. The data-conjugate method is slightly better than symmetric data-conjugate method.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.11a
• /
• pp.213-216
• /
• 2007

본 논문에서는 DFT(Discret Fourier Transform)과 웨이블렛을 이용한 고장진단 알고리즘을 제안한다. 제안된 방법은 주파수 기반의 DFT에 의한 고장패턴의 추출방법과 시간-주파수 기반의 웨이블렛을 이용한 고장패턴의 추출방법을 제안한다. 유도전동기의 진단을 DFT와 웨이블렛에 의해 추출된 특정값들을 효과적으로 융합할 수 있는 융합 알고리즘에 의해 수행된다. 개발된 알고리즘은 다양한 실측 데이터에 적용하여 그 타당성을 보이고자 한다.

• Proceedings of the KIEE Conference
• /
• 2006.04a
• /
• pp.117-119
• /
• 2006

In this work, we suggest another method to localize DFT in spatial domain. This enables DFT algorithm to be used for local pattern matching. Once calculated, it costs same load to calculate localized DFT regardless of the size or the position of local region In spatial domain. We applied this method to face detection problem and got the results which prove the utility of our method.

• Proceeding of EDISON Challenge
• /
• 2017.03a
• /
• pp.11-15
• /
• 2017

We present a study of transition metal compounds using density functional theory (DFT), and density-corrected density functional theory(DC-DFT). By replacing the self-consistent density with that obtained from Hartree-Fock calculation, i.e., HF-DFT, the abnormality driven by self-interaction error is removed in several important cases. We discuss when and how HF-DFT works by examining 3d orbital dimers using approximate functionals and by comparing the results from self-consistent-DFT and HF-DFT with experimental values.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.4
• /
• pp.790-794
• /
• 2007

This paper presents a new index mapping method for DFT (Discrete Fourier Transform) and its application to multidimensional DFT. Unlike conventional index mapping methods such as DIT (Decimation in Time) or DIF (Decimation in Frequency) algorithms, the proposed method is based on two levels of decomposition and it can be very efficiently used for implementing multidimensional DFT as well as 1-dimensional DFT. The proposed pipelined architecture for multidimensional DFT is very flexible so that it can lead to the best tradeoff between performance and hardware requirements. Also, it can be easily extended to higher dimensional DFTs since the number of CEs (Computational Elements) and DCs (Delay Commutators) increase only linearly with the dimension. Various implementation options based on different radices and different pipelining depths will be presented.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.10A
• /
• pp.941-948
• /
• 2008

In this paper, the effect of unobtainable channel frequency response (CFR) inside virtual subcarreiers on DFT-based channel estimation is derived and introduced numerically because the CFRs cause the leakage to the estimated channel and degrade the estimation performance. In addition, the performance of DFT-based channel estimation is analyzed with respect to the number of virtual subcarriers, pilot spacing and the number of unobtainable CFRs at equi-distance subcarriers inside virtual subcarriers.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.29 no.3
• /
• pp.192-199
• /
• 2018

This paper proposes an improved discrete Fourier transform spread single sideband(DFT-s-SSB) orthogonal frequency division multiplexing(OFDM) system that solves the problems of conventional DFT-s-SSB OFDM systems. Conventional DFT-s-SSB systems use pulse amplitude modulation(PAM) for applying SSB modulation. The higher the modulation level, the worse is the BER performance. Further, transmission is possible only through the lower sideband(LSB) spectrum. When transmitting using the LSB and upper sideband(USB) spectra simultaneously, interference occurs and spectrum recovery is not performed correctly. To solve this problem, the proposed system applies the 2/3 convolution coding to improve the bit error rate(BER) performance, adjusts the DFT size, and selects the USB spectrum to utilize the remaining spectrum resources. In addition, when using this system in an environment that supports multiuser or limited bandwidth, it uses only half of the spectrum; therefore, it can utilize the remaining spectrum resources and improve the spectral efficiency.

• 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.27 no.1A
• /
• pp.51-57
• /
• 2002

In this paper, a simple interpolation technique in a frequency domain is proposed for the discrete Fourier transform(DFT) algorithm. Frequency and phase resolution capabilities of the DFT algorithm can be significantly improved by the proposed interpolation technique without increase of a DFT size(the number of points for the DFT). The new technique uses a diving point in amplitude and phase spectrums. As an application, the technique can be used for joint estimation of fine frequency and phase offsets in burst mode digital transmission. Simulation results show that the joint estimator using the technique is robust to estimation errors.