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

• ETRI Journal
• /
• v.44 no.3
• /
• pp.379-388
• /
• 2022

This study proposes a novel low-complexity algorithm for computing inverse fast Fourier transform (IFFT)/fast Fourier transform (FFT) operations in binary phase shift keying-modulated orthogonal frequency division multiplexing (OFDM) communication systems without requiring any twiddle factor multiplications. The peak-to-average power ratio (PAPR) reduction capacity of an efficient PAPR reduction technique, that is, H-SLM method, is evaluated using the proposed IFFT algorithm without any complex multiplications, and the impact of oversampling factor for the accurate calculation of PAPR is analyzed. The power spectral density of an OFDM signal generated using the proposed multiplierless IFFT algorithm is also examined. Moreover, the bit-error-rate performance of the H-SLM technique with the proposed IFFT/FFT algorithm is compared with the classical methods. Simulation results show that the proposed IFFT/FFT algorithm used in the H-SLM method requires no complex multiplications, thereby minimizing power consumption as well as the area of IFFT/FFT processors used in OFDM communication systems.

• Proceedings of the KIEE Conference
• /
• 2015.07a
• /
• pp.87-88
• /
• 2015

본 논문에서는 제주풍력단지에 대한 측정 데이터(measured wind power outputs)를 기반으로 Fast Fourier Transform(FFT)을 실시하고, 이를 이용하여 각 풍력발전단지의 주파수 특성에 대해 분석해보고자 한다.

• ETRI Journal
• /
• v.45 no.6
• /
• pp.1035-1045
• /
• 2023

We propose a novel graphics processing unit (GPU) algorithm that can handle a large-scale 3D fast Fourier transform (i.e., 3D-FFT) problem whose data size is larger than the GPU's memory. A 1D FFT-based 3D-FFT computational approach is used to solve the limited device memory issue. Moreover, to reduce the communication overhead between the CPU and GPU, we propose a 3D data-transposition method that converts the target 1D vector into a contiguous memory layout and improves data transfer efficiency. The transposed data are communicated between the host and device memories efficiently through the pinned buffer and multiple streams. We apply our method to various large-scale benchmarks and compare its performance with the state-of-the-art multicore CPU FFT library (i.e., fastest Fourier transform in the West [FFTW]) and a prior GPU-based 3D-FFT algorithm. Our method achieves a higher performance (up to 2.89 times) than FFTW; it yields more performance gaps as the data size increases. The performance of the prior GPU algorithm decreases considerably in massive-scale problems, whereas our method's performance is stable.

• Journal of Communications and Networks
• /
• v.8 no.1
• /
• pp.38-48
• /
• 2006

A synchronous multicarrier (MC) code-division multiple access (CDMA) system using inverse fast Fourier transform (IFFT) and fast Fourier transform (FFT) for the downlink mobile communication system operating in a frequency selective Rayleigh fading channel is analyzed. Both carrier frequency offset and timing offset are considered in the analysis. Bit error rate performance of the system with both equal gain combining and maximum ratio combining are obtained. The performance is compared to that of the conventional system using correlation receiver. It is shown that when subcarrier number is large, the system using IFFT/FFT has nearly the same performance as the conventional one, while when the sub carrier number is small, the system using IFFT/FFT will suffer slightly worse performance in the presence of carrier frequency offset.

• Proceedings of the Korean Society of Tribologists and Lubrication Engineers Conference
• /
• 1999.06a
• /
• pp.73-79
• /
• 1999

Finite element equations by using fast Fourier transformation were formulated for studying temperatures resulting from frictional heating in sliding systems. The equations include the effect of velocity of moving components. The program developed by using FFT-FEM that combines Fourier transform techniques and the finite element method, was applied to the sliding bearing system. Numerical prediction obtained by FFT-FEM was in an excellent agreement of experimental temperature measurements.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.3
• /
• pp.570-576
• /
• 2004

In this paper, we design the IFFT/FFT (Inverse fast Fourier Transform/Fast Fourier Transform) modules for IEEE 802.11a-1999, which is a standard of the High-speed Wireless LAN using the OFDM (Orthogonal Frequency Division Multiplexing). The designed IFFT/FFT is the 64-point FFT to be compatible with IEEE 802.11a and the pipelined architecture which needs neither serial-to-parallel nor parallel-to-serial converter. We compare four types of IFFT/FFT modules for the hardware complexity and operation : R22SDF (Radix-2 Single-path Delay feedback), the R2SDF (Radix-2 Single-path Delay feedback), R2SDF (Radix-4 Single-path Delay Feedback), and R4SDC (Radix-4 Single-path Delay Commutator). In order to minimize the error, we design the IFFT/FFT module to operate with additional decimal parts after butterfly operation. In case of the R22SDF, the IFFT/FFT module has 44,747 gate counts excluding RAMs and the minimized error rate as compared with other types. And we know that the R22SDF has a small hardware structure as compared with other types.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.473-476
• /
• 2003

We suggest 2 dimensional Fast Fourier Transform using Polynomial Transform and integer Fast Fourier Transform. Unlike conventional 2D-FFT using the direct quantization of twiddle factor, the suggested 2D-FFT adopts implemented by the lifting so that the suggested 2D-FFT is power adaptable and reversible. Since the suggested FFT performg integer-to-integer mapping, the transform can be implemented by only bit shifts and auditions without multiplications. In addition. polynomial transform severely reduces the multiplications of 2D-FFT. While preserving the reversibility, complexity of this algorithm is shown to be much lower than that of any other algorithms in terms of the numbers of additions and shifts.

• Tribology and Lubricants
• /
• v.16 no.3
• /
• pp.218-222
• /
• 2000

Finite element equations by using fast Fourier transformation were formulated for studying temperatures resulting from frictional heating in sliding systems. The equations include the effect of velocity of moving components. The program developed by using FFT-FEM that combines Fourier transform techniques and the finite element method, was applied to the sliding bearing system. Numerical prediction obtained by FFT-FEM was in an excellent agreement of experimental temperature measurements.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.4B
• /
• pp.418-422
• /
• 2001

4-점 리버스 자켓 변환 (4-Point Reverse Jacket transform)의 장점 중의 하나는 4-점 fast Fourier transform(FFT)시 야기되는 실수 또는 복소수 곱셈을 행렬분해(matrix decomposition)를 이용, 곱셈인자를 모두 대각행렬에만 집중시킨, 매우 간결하고 효율적인 알고리즘이라는 점이다. 본 논문에서는 이를 N 점 FFT에 적용하는 알고리즘을 제안한다. 이 방법은 기존의 다른 변환형태보다 확장하거나 구조를 파악하기에 매우 용이하다.