• The Journal of the Acoustical Society of Korea
• /
• v.15 no.3E
• /
• pp.74-77
• /
• 1996

In this paper we implement the Discrete Rotational Fourier Transform(DRFT) which is a discrete version of the Angular Fourier Transform and its inverse transform. We simplify the computation algorithm in [4], and calculate the complexity of the proposed implementation of the DRFT and the inverse DRFT, in comparison with the complexity of a DFT (Discrete Fourier Transform).

• Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
• /
• 2001.10a
• /
• pp.169-173
• /
• 2001

This study presents the results of decoupling of free decay roll test data by discrete wavelet transform. Free roll decay test was performed to decide the coefficients of damping terms in equation of motion. During the experiment, a slight yaw motion was found while the model was in the free roll decay motion. Discrete wavelet transform was applied to the signal to extract the pure roll motion. The results were compared to those of the Fourier transform. DWT was able to decouple the two signals efficiently while the Fourier transform was not.

• Aerospace Engineering and Technology
• /
• v.9 no.1
• /
• pp.98-105
• /
• 2010

Fast Fourier Transform is the fast implementation of Discrete Fourier Transform, which deletes periodic operation of DFT. According to the definition, radix-2 FFT can be implemented byre cursive call which divides the input signal points into 2 signal points. Because of its time-consuming stack-copy operation, this recursive method is very slow. To overcome this drawback, butterfly operation with signal rearrangement was devised. Based on the ideas of signal rearrangement and butterfly operation, this paper applies the signal rearrangement method to the Radix-3 FFT and checks the validity of this method.

• Journal of Electrical Engineering and Technology
• /
• v.7 no.2
• /
• pp.163-170
• /
• 2012

This paper presents a DFT (Discrete Fourier Transform) based estimation algorithm for the parameters of a low-frequency oscillating signal. The proposed method estimates the parameters, i.e., the frequency, the damping factor, the mode amplitude, and the phase, by fitting a discrete Fourier spectrum with an exponentially damped cosine function. Parameter estimation algorithms that consider the spectrum leakage of the discrete Fourier spectrum are introduced. The multi-domain mode test functions are tested in order to verify the accuracy and efficiency of the proposed method. The results show that the proposed algorithms are highly applicable to the practical computation of low-frequency parameter estimations based on DFTs.

• Journal of Korean Academy of Oral and Maxillofacial Radiology
• /
• v.28 no.2
• /
• pp.339-353
• /
• 1998

The purpose of this study was to investigate whether a radiographic estimate of osseous fractal dimension and power spectrum of 2D discrete Fourier transform is useful in the characterization of structural changes in bone. Ten specimens of bone were decalcified in fresh 50 ml solutions of 0.1 N hydrochloric acid solution at cummulative timed periods of 0 and 90 minutes. and radiographed from 0 degree projection angle controlled by intraoral parelleling device. I performed one-dimensional variance. fractal analysis of bony profiles and 2D discrete Fourier transform. The results of this study indicate that variance and fractal dimension of scan line pixel intensities decreased significantly in decalcified groups but Fourier spectral analysis didn't discriminate well between control and decalcified specimens.

• Proceedings of the KSME Conference
• /
• 2003.11a
• /
• pp.1654-1659
• /
• 2003

This paper introduces a fast Fourier transform (FFT)-based spectral analysis method for the transient responses as well as the steady-state responses of linear discrete systems. The force vibration of a viscously damped three-DOF system is considered as the illustrative numerical example. The proposed spectral analysis method is evaluated by comparing with the exact analytical solutions as well as with the numerical solutions obtained by the Runge-Kutta method.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2001.05a
• /
• pp.237-240
• /
• 2001

In this work, we will present an iris pattern recognition method as a biometrically based technology for personal identification and authentication. For this, we propose a new algorithm for extraction unique feature from images of the iris of the human eye and representing these feature using the discrete fourier transform. From the computational simplicity of the adopted transform, we can obtain more fast and efficient results than previous ones.

• Journal of Communications and Networks
• /
• v.1 no.2
• /
• pp.86-88
• /
• 1999

The Discrete Fourier Transform (DFT) and the Inverse Discrete Fourier Transform (IDFT) are commonly used in signal processing applications, in particular in digital communication sys-tems using the multi-carrier modulation principle. In such systems an IDFT is computed at the transmitter end, and a DFT at the re-ceiver end. This paper examines a technique of computations, for which only negligible differences appear between the DFT and the IDFT calculations while the number of arithmetic operations re-quired is substantially reduced. This offers significant advantages for the design of an IDFT/DFT processor for Discrete Multitone(DMT) systems.

• Journal of KSNVE
• /
• v.7 no.4
• /
• pp.637-644
• /
• 1997

In this paper, a method of finite element analysis is presented for efficient calculation of vibration characteristics of not only simply interconnected structure with cyclic symmetry but also multiply interconnected structure with cyclic symmetry by using discrete Fourier trandform by means of a computer with small memory in a short time. Simply interconnected structure means it is composed of substructures which are adjacent themselves in circumferential direction. First, a mathematical model of multiply interconnected structure with cyclic symmetry is defined. The multiply interconnected structure is partitioned into substructures with the same goemetric configuration and constraint eqauations to be satisfied on connecting boundaries are defined. Nodal displacements and forces are transformed into complex forms through discrete Fourier transform and then finite element analysis is performed for just only a representative substructure. In free vibration analysis, natural frequencies of a whole structure can be obtained through a series of calculation for a substructure along the number of nodal diameter. And in forced vibration analysis, forced response of whole structure can be achieved by using inverse discrete Fourier transform of results which come from analysis for a substructure.

• Journal of Information Processing Systems
• /
• v.12 no.4
• /
• pp.754-764
• /
• 2016

The exhaustive list of sparsification methods for a digital image suffers from achieving an adequate number of zero and near-zero coefficients. The method proposed in this paper, which is known as the Discrete Rajan Transform Sparsification, overcomes this inadequacy. An attempt has been made to compare the simulation results for benchmark images by various popular, existing techniques and analyzing from different aspects. With the help of Discrete Rajan Transform algorithm, both lossless and lossy sparse representations are obtained. We divided an image into $8{\times}8-sized$ blocks and applied the Discrete Rajan Transform algorithm to it to get a more sparsified spectrum. The image was reconstructed from the transformed output of the Discrete Rajan Transform algorithm with an acceptable peak signal-to-noise ratio. The performance of the Discrete Rajan Transform in providing sparsity was compared with the results provided by the Discrete Fourier Transform, Discrete Cosine Transform, and the Discrete Wavelet Transform by means of the Degree of Sparsity. The simulation results proved that the Discrete Rajan Transform provides better sparsification when compared to other methods.