• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.5
• /
• pp.9-20
• /
• 2000

In this paper we compare two frequency domain digital watermarking methods for digital Images, namely DCT(Discrete Cosine Transform) based and DFT(Discrete Fourier Transform) based methods. Unlike DCT coefficients, which always have real values, DFT coefficients normally have complex values Therefore, the DFT coefficients have amplitude and phase components Among them, the phase components are known to carry more Important information for the Images. So, we insert the watermark to the phase of the DFT coefficients only This DFT watermarking method is compared with the conventional DCT based watermarking method for the object-based watermarking problem. Experimental results show that the DFT-phase based method IS more robust to general Image processing attacks including resize, lossy compression(JPEG), blurring and median filtering. On the other hand, the DCT based method is more robust to the malicious attack which inserts different watermarks.

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

• 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 Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.5A
• /
• pp.490-495
• /
• 2010

In this paper, we propose an sequential spectrum sensing algorithm utilizing DFT. The conventional sensing algorithm using FFT contains redundant computation due to the characteristic of FFT which computes all frequency components at one time. The proposed sensing algorithm utilizing DFT computes a frequency component once at a time according to the priority and decides presence of signal. The proposed sensing algorithm can provide similar detection performance to the conventional scheme while computations of the sensing process could be reduced significantly depends on an early detection of signal.

• Journal of the Korean Chemical Society
• /
• v.57 no.1
• /
• pp.20-24
• /
• 2013

The effect of the DFT methods and basis sets on harmine molecule has been investigated. 26 DFT methods with 6 basis sets were used. Two main comparison chosen DFT methods in this work has been investigated. It is concluded that this contribution is very important and cannot be neglected. In the following analysis, changes in energy levels were investigated by two different methods. Considering a specific basis set, changes in energy levels were obtained using different DFT methods. A specific DFT method is chosen and changes in energy levels have been investigated by means of various basis sets. Effect of the choice of basis sets on geometrical parameters on harmine molecule has also been investigated.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.18 no.3 s.118
• /
• pp.248-256
• /
• 2007

In this paper, we propose a selective DFT spreading method to solve a high PAPR problem in uplink OFDMA system. A selective characteristic is added to the DFT spreading, so the DFT spreading method is mixed with SLM method. However, to minimize increment of computational complexity, differently with common SLM method, our proposed method uses only one DFT spreading block. After DFT, several copy branches are generated by multiplying with each different matrix. This matrix is obtained by linear transforming the each phase rotation in front of DFT block. And it has very lower computational complexity than one DFT process. For simulation, we suppose that the 512 point IFFT is used, the number of effective sub-carrier is 300, the number of allowed sub-carrier to each user's is 1/4 and 1/3 and QPSK modulation is used. From the simulation result, when the number of copy branch is 4, our proposed method has more than about 5.2 dB PAPR reduction effect. It is about 1.8 dB better than common DFT spreading method and 0.95 dB better than common SLM which uses 32 copy branches. And also, when the number of copy branch is 2, it is better than SLM using 32 copy branches. From the comparison, the proposed method has 91.79 % lower complexity than SLM using 32 copy branches in similar PAPR reduction performance. So, we can find a very good performance of our proposed method. Also, we can expect the similar performance when all number of sub-carrier is allocated to one user like the OFDM.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.107-110
• /
• 2001

In this paper, we propose a multiplication-free DFT kernel computation technique, whose input sequences are approximated into a ring of Algebraic Integers. This paper also gives computational examples for DFT and IDFT. And we proposes an architecture of the DFT using barrel shifts and adds. When the radix is greater than 4, the proposed method has a high Precision property without scaling errors due to twiddle factor multiplication. A possibility of higher radix system assumes that higher performance can be achievable for reducing the DFT stages in FFT.

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

• Journal of the Korean Chemical Society
• /
• v.48 no.5
• /
• pp.537-541
• /
• 2004

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

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