• 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.41 no.12
• /
• pp.1715-1720
• /
• 2016

In the upcoming 5-generation mobile communication system, various techniques for improving the power efficiency and spectral efficiency have been proposed. 5G mobile communication system also have been studied a lot of multi-carrier-based modulation techniques like the 4G mobile communication system. In this paper, we analyzed the conventional system structure of the Zero-tail DFT-s-OFDM and UW (Unique Word) -DFT-s-OFDM system based on DFT-s-OFDM system in these techniques. UW and zero are added and used each system, and CP is removed. the result of quality of systems for simulation, OOB(Out of Band) power of Zero-tail DFT-s-OFDM and UW-DFT-s-OFDM use the less time resource as long as CP length, also both systems are reduced about 11dB than DFT-s-OFDM system. In these result, Zero-tail DFT-s-OFDM and UW-DFT-s-OFDM system are more effective than DFT-s-OFDM system.

• The Journal of the Acoustical Society of Korea
• /
• v.3 no.2
• /
• pp.30-34
• /
• 1984

본 논문에서는 인코히어런트광 매트릭스-벡터곱셈기를 이용하여 입력 데이터를 광학적으로 DFT 할 수 있는 방법을 연구하였다. DFT의 웨이팅함수를 매트릭스로 나타내어 본 논문에서 제시한 2 개의 성분 분할 방법을 이용하여 마스크상에 부호화하고 광매트릭스-벡터곱셈기내에 고정시켜서 입력 데이터와 광학적으로 곱하도록 하였다.

• Proceeding of EDISON Challenge
• /
• 2014.03a
• /
• pp.115-125
• /
• 2014

We investigate dissociation of diatomic molecules and anions using density functional theory (DFT) and density-corrected density functional theory (DC-DFT). We scan the potential energy curve of CH, NH and NO neutral molecule and its anion with both DFT and DC-DFT (in form of Hartree-Fock DFT, HF-DFT) using various functionals. Using CCSD(T) results as reference, we perform the error decomposition scheme recently proposed by Kim et al. The results show while most neutrals are $functio{\acute{n}}al$ error $domi{\bar{n}}ating$ normal calculations, $CH^-$ and $NO^-$ anions are density-driven error dominating abnormal calculations. In case of $NH^-$, traditional DFT goes to a wrong dissociation limit indicating abnormality, but both HF-DFT and CCSD(T) results need further investigation due to the kinks on the curve.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.2
• /
• pp.97-102
• /
• 2008

In this paper, we address the OFDM based on DFT or DCT in Cognitive Radio system. An adaptive OFDM based on DFT or DCT in Cognitive Radio system has the capacity to nullify individual carriers to avoid interference to the licensed users. Therefore, there could be a considerably large number of zero-valued inputs/outputs for the IDFT/DFT or IDCT/DCT on the OFDM transceiver. Hence, the standard methods of DFT and DCT are no longer efficient due to the wasted operations on zero. Based on this observation, we present a transform decomposition on two dimensional(2-D) systolic array for IDFT/DFT and IDCT/DCT, this algorithm can achieve an efficient computation for OFDM in Cognitive Radio system

• Journal of the Korean Chemical Society
• /
• v.49 no.1
• /
• pp.7-15
• /
• 2005

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

• Journal of the Korean Chemical Society
• /
• v.65 no.1
• /
• pp.9-14
• /
• 2021

In this study, the DFT calculation was performed using the B3LYP/6-31G(d,p) basis sets for the reaction process in which phenanthrene decomposes due to the chain reaction of two OH radicals on phenanthrene in the gaseous state of 298 K at 1 atm. As a result of the calculation, even when two OH radicals act on phenanthrene in a chain, the reaction for producing phenanthren-9-ol is predicted to be more advantageous than the reaction for producing phenanthren-1-ol. On the other hand, it was predicted that the OH addition process at room temperature would be advantageous for the priority of the OH addition and H abstraction process.

• Journal of the Institute of Convergence Signal Processing
• /
• v.8 no.2
• /
• pp.106-112
• /
• 2007

This paper proposes a hybrid architecture algorithm for fast computation of DCT and DFT via recursive factorization. Recursive factorization of DCT-II and DFT transform matrix leads to a similar architectural structure so that common architectural base may be used by simply adding a switching device. Linking between two transforms was derived based on matrix recursion formula. Hybrid acrchitectural design for DCT and DFT matrix decomposition were derived using the generation matrix and the trigonometric identities and relations. Data flow diagram for high-speed architecture of Cooley-Tukey type was drawn to accommodate DCT/DFT hybrid architecture. From this data flow diagram computational complexity is comparable to that of the fast DCT algorithms for moderate size of N. Further investigation is needed for multi-mode operation use of FFT architecture in other orthogonal transform computation.

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