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

• The KIPS Transactions:PartA
• /
• v.12A no.3 s.93
• /
• pp.215-222
• /
• 2005

The efficient utilization of cache memories is a key factor in achieving high performance for computing large signal transforms. Nonunit stride access in computation of large DFTs causes cache conflict misses, thereby resulting in poor cache performance. It leads to a severe degradation in overall performance. In this paper, we propose a dynamic data layout approach considering the memory hierarchy system. In our approach, data reorganization is performed between computation stages to reduce the number of cache misses. Also, we develop an efficient search algorithm to determine the optimal tree with the minimum execution time among possible factorization trees considering the size of DFTs and the data access stride. Our approach is applied to compute the fast Fourier Transform (FFT). Experiments were performed on Pentium 4, $Athlon^{TM}$ 64, Alpha 21264, UtraSPARC III. Experiment results show that our FFT achieve performance improvement of up to 3.37 times better than the previous FFT packages.

• The Journal of the Acoustical Society of Korea
• /
• v.7 no.4
• /
• pp.22-30
• /
• 1988

In this paper, the sound radiation from a clamped circular plate in an infinite baffle is calculated by using the FFT technique. The radiated sound fields are obtained by two-dimensional fast Fourier transform method is the spatial domain instead of a direct numerical evaluation of Rayleigh integral for economy of the computation time. The computation time is consumed at least by 1/200 times of the direct numerical evaluation on the Rayleigh integral in acoustic fields. The FFT method can be applicable to any shaped geometry as well as circular plate. The FFT solution could be very powerful in predicting the near and far fields of complex structures.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.31 no.2D
• /
• pp.323-334
• /
• 2011

In this study, we performed the residual geoid modeling using the FFT and LSC methods in context of application of R-R (Remove and Restore) technique as a general technique for gravimetric geoid model in order to propose the effective way of geoid determination in Korea. For this, a number of data compiled for residual geoid modeling by the multi-band spherical FFT method with Stoke's formula and LSC method as known as statistical method. The geometric geoidal heights obtained from 503 GPS/Levelling data were used for inducing the various elements and proper computation process which should be considered for improving the accuracy of residual geoid modeling. Finally, we statistically compared the results of residual geoid heights between FFT and LSC methods and reviewed then the proper way of residual geoid modeling to the region of Korea. As the results of comparison, LSC method is not suitable for residual geoid modeling in Korea due to the noise and lack of gravity observations and the effects of local characteristics, while FFT method by applying Stokes' integral with proper cap size and modified kernel which provides the better accuracy of residual geoid heights up to 10 cm more than those of LSC method.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06c
• /
• pp.28-30
• /
• 2006

XML 문서의 유사성을 비교하는 연구는 XML 문서의 저장 및 검색에 유용하기 때문에 많은 연구가 진행되었다. XML 문서의 유사성 연구는 크게 edit-distance를 이용하는 방법, 문서의 그래프 모델을 이용하는 방법, 문서의 매트릭스 모델을 이용하는 방법 등이 있다. 최근에는 문서를 encoding 하고 푸리에 변환을 이용하는 방법이 보고되었다. 본 논문에서는 XML 문서를 함수로 변환하고 FFT를 적용하여 문서의 구조적 유사성을 비교하는 새로운 방법을 제안한다. 제안하는 방법은 JAXP로 구현하였으며 XML 문서의 구조를 분석하여 함수로 변환하였다. 그리고 함수에 FFT를 적용하여 XML 문서의 구조적 유사성을 비교하였다. FFT 비교 결과는 XML 문서의 함수 변환이 적합한 것임을 보여주었으며 비교 결과는 예상된 결과를 보여주었다.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.20 no.8
• /
• pp.30-35
• /
• 2006

Voltage is generally and exactly measured in the electric and electronic field. So, we studied method for detecting electric equipment faulty state using only electric voltage. It is called the Partition-FFT. Tracking is simulated by method and tester proceed on IEC 60112. We analyze voltage waveforms by tracking tester with Partition-FFT. As the result tracking process is clearly distinguished by 6 steps. Tracking is one of the major reason of electric accidents. The Partition-FFT is using a digital oscilloscope and a computer software. If Partition-FFT analysis is applied to the electricity facilities, We can prevent from happenning electric accidents cause of tacking breakdown with low prices and easy measurment. Most of all, Partition-FFT is system that make a visual tacking process. So, everyone is able to detect to possibility of electric accidents.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.12
• /
• pp.2327-2334
• /
• 2007

This paper presents a method for improvement of communication speed and reduction of data storage space in gas turbine monitoring system to acquire, save, and display combustion vibration data. The proposed method implements FFT from sampled raw data. The FFT result data are encoded to be transferred to monitoring PC for storage. By this way, it can reduce data storage space. To display the received data, it needs inverse FFT to reconstruct original signal. To verify the validity and efficiency of the proposed scheme, computer-aided simulation are carried out. It includes the analyzed results the relationship between FFT's order and Gibb's Phenomenon. Finally, high-performance of the proposed method is proved by combustion experiment results using a prototype gas turbine.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.40 no.12
• /
• pp.87-94
• /
• 2003

In this paper, we propose an IFFT/FFT design method to minimize quantization error in IEEE 802.11a WLAN. In the proposed algorithm, the twiddle coefficient of IFFT/FFT processor is manipulated by the statistics distribution of the input data at each stage. We applies this algorithm to radix-2/$^2$ SDF architecture. Both IFFT and FFT processor shares the circuit blocks cause to the symmetric architecture. The maximum quantization error with the 10 bits length of the input and output data is 0.0021 in IFFT and FFT that has a self-loop structure with the proposed method. As a result, the proposed architecture saves 3bits for the data to keep the same resolution compared with the conventional method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7A
• /
• pp.1005-1015
• /
• 1999

This paper is concerned with an improvement on IFFT (inverse fast Fourier transform) and FFT based baseband digital implementation algorithm for BPSK (binary phase shift keying)-modulated MC-CDMA (multicarrier-code division multiple access) systems, that is functionally equivalent to the conventional implementation algorithm, while reducing computational complexity and bandwidth requirement. We also derive an equalizer structure for the proposed implementation algorithm. The proposed algorithm is based on a variant of FFT algorithm that utilizes a N/2-point FFT/IFFT for simultaneous transformation and reconstruction of two N/2-point real signals. The computer simulations under additive white Gaussian noise channels and frequency selective fading channels using equal gain combiner and maximal ratio combiner diversities, demonstrate the performance of the proposed algorithm.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1994.06c
• /
• pp.61-64
• /
• 1994

디지털 신호를 처리하기 위해 특별히 제작된 ADSP-2105는 빠른 Fied-point 연산과 Harvard-architecture로 구조화됐기 때문에 빠른 수행연산을 할 수 가 있다. 본 논문은 이 DSP 프로세서를 이용해 음성신호의 실시간 FFT 분석에 관한 방법을 소개한다. 실시간 FFT 분석기로서의 DSP 보드는 크게 음성신호를 받는 입력부분과 FFT를 계산하는 FFT 부분으로 나뉘어지는데, 입력부분은 AD1849로 8KHz로 데이터를 샘플링해 받게 되었고, FFT 부분은 실제로 DSP가 FFT를 수행하는 부분으로 되어있다. 실시간 처리를 구현하기 위해 입력 부분은 두 개의 뱅크로 만들어 한 뱅크에서 음성신호를 받아들이는 동안에 다른 뱅크에서는 FFT를 계산하도록 되어있어서 DSP 보드는 항시 음성신호를 샘플링 할 수 있는 상태를 유지할 수 있다. 그리고 FFT 처리부는 빠른 처리로 음성신호를 샘츨링할 뱅크가 채워지기 전에 실행되게 프로그램되어 있어 실제적으로 모든 음성데이타를 FFT 하게 되어있다.