• Title/Summary/Keyword: FFT method

Search Result 687, Processing Time 0.025 seconds

Application of Approximate FFT Method for Target Detection in Distributed Sensor Network (분산센서망 수중표적 탐지를 위한 근사 FFT 기법의 적용 연구)

  • Choi, Byung-Woong;Ryu, Chang-Soo;Kwon, Bum-Soo;Hong, Sun-Mog;Lee, Kyun-Kyung
    • The Journal of the Acoustical Society of Korea
    • /
    • v.27 no.3
    • /
    • pp.149-153
    • /
    • 2008
  • General underwater target detection methods adopt short-time FFT for estimate target doppler. This paper proposes the efficient target detection method, instead of conventional FFT, using approximate FFT for distributed sensor network target detection, which requires lighter computations. In the proposed method, we decrease computational rate of FFT by the quantization of received signal. For validation of the proposed method, experiment result which is applied to FFT based active sonar detector and real oceanic data is presented.

Design Method of Variable Point Prime Factor FFT For DRM Receiver (DRM 수신기의 효율적인 수신을 위한 가변 프라임펙터 FFT 설계)

  • Kim, Hyun-Sik;Lee, Youn-Sung;Seo, Jeong-Wook;Baik, Jong-Ho
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2008.08a
    • /
    • pp.257-261
    • /
    • 2008
  • The Digital Radio Mondiale (DRM) system is a digital broadcasting standard designed for use in the LF, MF and HF bands of the broadcasting bands below 30 MHz. The system provides both superior audio quality and improved user services / operability compared with existing AM transmissions. In this paper, we propose a variable point Prime Factor FFT design method for Digital Radio Mondiale (DRM) system. Proposed method processes a various size IFFT/FFT of Robustness Mode on DRM standard efficiently by composing Radix-Prime Factor FFT Processing Unit of form similar to Radix-4 by insertion of a variable Prime Factor Twiddle Factor and Garbage data. So, we improved limitation that cannot process 112/176/256/288 FFT of each mode of DRM system with a existent Radix Processor and increase memory size and memory access time for IFFT/FFT processing by software processing in case of implementation with a existent high speed DSP.

  • PDF

Frequency-Time Analysis(Partition-FFT) for Tracking Detection (트래킹 검출을 위한 주파수-시간 분석(분할-FFT))

  • Jee S. W.;Lee S. H.;Kim Ch. N.;Lee C. H.;Lee K. S.
    • The Transactions of the Korean Institute of Electrical Engineers C
    • /
    • v.53 no.10
    • /
    • pp.530-538
    • /
    • 2004
  • A electromagnetic waves are used for sensing in insulation diagnosis at electric machine or equipment. When it a method, waves are transformed into the FFT(Fast Fourier Transform); a kind of the process for data transformation. In a general way, a scientist use frequncy band 30[㎒]~l[㎓] to applied field. If we are measured high frequency band, we will need to a high capacity hardware. Also a antenna has a fault on atmospheric phenomena, outside environment and the like. In this paper We proposed new method for detecting electric equipment faulty state using only electric voltage which is generally measured in the electric and electronic field. It is called the Partition-FFT The analytic method is this first divide measured voltage waves into equal parts, second each deal with give effect to the FFT, finally each results deal with a graphic method and gather graphic. We are compare Partition-FFT with discharge form by tracking tester. As the result it demonstrated that the Partition-FFT is applicable.

A Study on Electromagnetic Scattering Analysis of Penetrable Objects Using Block Matrix Preconditioner(BMP) and IE-FFT (Block Matrix Preconditioner와 IE-FFT를 이용한 침투 가능한 구조물의 전자기 산란해석에 관한 연구)

  • Kang, Ju-Hwan
    • Journal of IKEEE
    • /
    • v.23 no.2
    • /
    • pp.614-621
    • /
    • 2019
  • In this paper, we presents the integral equation-fast Fourier transform(IE-FFT) and block matrix preconditioner (BMP) to solve electromagnetic scattering problems of penetrable structures composed of dielectric or magnetic materials. IE-FFT can significantly improve the amount of calculation to solve the matrix equation constructed from the moment method(MoM). Moreover, the iterative method in conjunction with BMP can be significantly reduce the number of iterations required to solve the matrix equations which are constructed from electrically large structures. Numerical results show that IE-FFT and block matrix preconditioner can solve electromagnetic scattering problems for penetrable objects quickly and accurately.

FFT based Monitoring System for Combustion Vibration Data Processing of Gas Turbine (가스터빈 연소진동 데이터 처리를 위한 FFT 기반의 모니터링 시스템)

  • Lee, Sang-Hyeok;Kang, Feel-Soon
    • 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.

Numerical Evaluation of The Rayleigh Integral Using the FFT Method for Transient Sound Radiation (FFT 방법을 이용한 음압복사에 대한 Rayleigh Integral 의 수치해석적 연구)

  • Jeon, Jae-Jin
    • 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.

  • PDF

Study of Radix-3 FFT (Radix-3 FFT에 관한 고찰)

  • Jung, Hae-Seung
    • 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.

PAPR reduction of OFDM systems using H-SLM method with a multiplierless IFFT/FFT technique

  • Sivadas, Namitha A.
    • 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.

Large-scale 3D fast Fourier transform computation on a GPU

  • Jaehong Lee;Duksu Kim
    • 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.

An IE-FFT Algorithm to Analyze PEC Objects for MFIE Formulation

  • Seo, Seung Mo
    • Journal of electromagnetic engineering and science
    • /
    • v.19 no.1
    • /
    • pp.6-12
    • /
    • 2019
  • An IE-FFT algorithm is implemented and applied to the electromagnetic (EM) solution of perfect electric conducting (PEC) scattering problems. The solution of the method of moments (MoM), based on the magnetic field integral equation (MFIE), is obtained for PEC objects with closed surfaces. The IE-FFT algorithm uses a uniform Cartesian grid to apply a global fast Fourier transform (FFT), which leads to significantly reduce memory requirement and speed up CPU with an iterative solver. The IE-FFT algorithm utilizes two discretizations, one for the unknown induced surface current on the planar triangular patches of 3D arbitrary geometries and the other on a uniform Cartesian grid for interpolating the free-space Green's function. The uniform interpolation of the Green's functions allows for a global FFT for far-field interaction terms, and the near-field interaction terms should be adequately corrected. A 3D block-Toeplitz structure for the Lagrangian interpolation of the Green's function is proposed. The MFIE formulation with the IE-FFT algorithm, without the help of a preconditioner, is converged in certain iterations with a generalized minimal residual (GMRES) method. The complexity of the IE-FFT is found to be approximately $O(N^{1.5})$and $O(N^{1.5}logN)$ for memory requirements and CPU time, respectively.