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

Orthogonal frequency division multiplexing(OFDM) is a multicarrier modulation(MCM) system that enables high-speed communications using multiple carriers and has advantages of power and spectral efficiency. Therefore, this study aims to complement the existing shortcomings and to design an efficient MCM system. The proposed system uses the inverse discrete wavelet transform(IDWT) operation instead of the inverse fast Fourier transform(IFFT) operation. The bit error rate(BER), spectral efficiency, and peak-to-average power ratio(PAPR) performance were compared with the conventional OFDM system through the OFDM system design based on wavelet transform. Our results showed that the conventional OFDM and Wavelet-OFDM exhibited the same BER performance, and that the Wavelet-OFDM using the discrete Meyer wavelet had the same spectral efficiency as the conventional OFDM. In addition, all systems of Wavelet-OFDM based on various wavelets confirm a PAPR performance lower than that of conventional OFDM.

• Journal of the Korean Society for Railway
• /
• v.9 no.1 s.32
• /
• pp.63-68
• /
• 2006

This paper proposes a fast Fourier transform(FFT)-based spectral analysis method(SAM) for the dynamic responses of the linear discrete dynamic models with non-proportional damping. The SAM was developed by using discrete Fourier transform(DFT)-theory. To verify the proposed SAM, a three-DOF system with non-proportional viscous damping is considered as an illustrative example. The present SAM is evaluated by comparing the dynamic responses obtained by SAM with those obtained by Runge-Kutta method.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.05a
• /
• pp.255-258
• /
• 2003

Recently, Digital Watermarking is used to authenticate data and to determine whether the data are distorted or not in medical images which is digitalized. The Fourier Mellin method using the Fourier Transform and the Log-Polar coordinate transform gets an invariant feature for RST distortion in images. But there are several problems in the real materialization. Interpolation of the image value should be considered according to the pixel position and so a watermark loss, original image distortion, numerical approximation is happened. Therefore there should be solved to realization of the Fourier Mellin method. Using the Look up table, there reduce the data loss caused by the conversion between Rectangular and Polar coordinate. After diagnose, medical images are transformed the Polar coordinate and taken the Discrete Fourier transform in the center of ROI region. Maintaining the symmetry in Fourier magnitude coefficient, the gaussian distributed random vectors and binary images are embedded in medical images.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.10
• /
• pp.1617-1623
• /
• 1989

The introduction of the fast Fourier transform(FFT),an efficient computational algorithm for the discrete Fourier transform(DFT) by Cooley and Tukey(1965), has brought to the limelight various other discrete transforms. Some of the analog functions from which these transforms have been derived date back to the early 1920's, for example, Walsh functions (Walsh, 1923) and Hadamard Transform(Enomoto et al, 1965). Fast algorithms developed for the forward transform are equally applicable, exept for minor changes, to the inverse transform. In this paper, we present a simple pipelined Hadamard matrix(HM) which is used to develop a fast algorithm for the Hadamard Processor (HP). The Fast Hadamard Transform(FHT) can be derived using matrix partitioning techniques. The HP system is incorporated through a modular design which permits tailoring to meet a wide range of video data link applications. Emphasis has been placed on a low cost, a low power design suitable for airbone system and video codec.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.63 no.7
• /
• pp.1001-1007
• /
• 2014

This paper proposes a method to reduce operation time using discrete cosine transform and to improve image quality by the DC gain correction. Conventional filtered back projection (FBP) filtering in the frequency domain using Fourier transform, but the filtering process uses complex number operations. To simplify the filtering process, we propose a filtering process using discrete cosine transform. In addition, the image quality of reconstructed images are improved by correcting DC gain of sinograms. To correct the DC gain, we propose to find an optimum DC weight is defined as the ratio of sinogram DC and optimum DC. Experimental results show that the proposed method gets better performance than the conventional method for phantom and clinical CT images.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10b
• /
• pp.1823-1827
• /
• 1991

The problem regarding nonlinear systems has come to occupy an important position. In order to solve a nonlinear problem we have methods of linearization which are developed through linear approximation to adapt linear system theories. In this paper we present a formal linearization of nonlinear systems based on the discrete-Fourier transform (D.F.T.).

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

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.55 no.7
• /
• pp.265-272
• /
• 2006

This paper describes a method of parameter estimation of time series data using discrete Fourier transform(DFT). DFT have been mainly used to precisely and rapidly obtain the frequency of a signal. In a dynamic system, a real part of a mode used to learn damping characteristics is a more important factor than the frequency of the mode. The parameter estimation method of this paper can directly estimate modes and parameters, indicating the characteristics of a dynamic system, on the basis of the Fourier transform of the time series data. Real part of a mode estimates by subtracting a frequency of the Fourier spectrum corresponding to 0.707 of a magnitude of the peak spectrum from a peak frequency, or subtracting a frequency of the power spectrum corresponding to 0.5 of the peak power spectrum from a peak frequency, or comparing the Fourier(power) spectrum ratio. Also, the residue and phase of time signal calculate by simple equation with the real part of the mode and the power spectrum that have been calculated. Accordingly, the proposed algorithm is advantageous in that it can estimate parameters of the system through a single DFT without repeatedly calculating a DFT, thus shortening the time required to estimate the parameters.

• The Journal of the Acoustical Society of Korea
• /
• v.5 no.4
• /
• pp.22-26
• /
• 1986

The following methods have been proposed for implementing R2 multi-frequency receiver digitally: using digital filters, period-counting algorithm, discrete Fourier transform or Goertzel algorithm, and fast Fourier transform.

• Journal of information and communication convergence engineering
• /
• v.8 no.3
• /
• pp.312-316
• /
• 2010

Conformal mapping has been a familiar tool of science and engineering for generations. The methods of numerical mapping are usually classified into those which construct the map from standard domain such as the unit disk onto the 'problem domain', and those which construct the map in the reverse direction. We treat numerical conformal mapping from the unit disk onto the Jordan regions as the problem domain in this paper. The traditional standard methods of this type are based on Theodorsen integral equation. Wegmann's method is well known as a Newton-like efficient one for solving Theodorsen equation. An improved method for convergence by applying low frequency pass filter to the Wegmann's method was proposed. In this paper we propose an effective algorithm for numerical conformal mapping based on the improved method. This algorithm is able to determine the discrete numbers and initial values automatically in accordance with the given region and the required accuracy. This results come from analyzing the shape of given domain as seen in the Fourier Transform.