• Journal of Institute of Control, Robotics and Systems
• /
• v.20 no.1
• /
• pp.37-41
• /
• 2014

FFT (Fast Fourier Transform) has been widely used in various fields such as image processing, voice processing, physics, astronomy, applied mathematics and so forth. Much research has been conducted due to the importance of the FFT and recently new FFT algorithms using a GPU (Graphics Processing Unit) have been developed for the purpose of much faster processing. In this paper, the new optimal FFT algorithm using the Pease FFT algorithm has been proposed reflecting the hardware configuration of a GPGPU (General Purpose computing of GPU). According to the experiments, the proposed algorithm outperformed by between 3% to 43% compared to the CUFFT algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.2A
• /
• pp.164-169
• /
• 2009

This paper presents a fast and accurate ranging algorithm for the WiBro system. The proposed algorithm detects a received ranging code and estimates its propagation delay using the correlation characteristics of the PRBS (Pseudo Random Binary Sequence) and the circular shift property of the discrete Fourier transform operator. The proposed ranging algorithm was applied to array antenna systems to show how it could improve the ranging performance of an array antenna system compared to a conventional base station system, which uses only a single antenna.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.6
• /
• pp.2748-2766
• /
• 2016

Compared with traditional patch-based sparse representation, recent studies have concluded that group-based sparse representation (GSR) can simultaneously enforce the intrinsic local sparsity and nonlocal self-similarity of images within a unified framework. This article investigates an accelerated split Bregman method (SBM) that is based on GSR which exploits image compressive sensing (CS). The computational efficiency of accelerated SBM for the measurement matrix of a partial Fourier matrix can be further improved by the introduction of a fast Fourier transform (FFT) to derive the enhanced algorithm. In addition, we provide convergence analysis for the proposed method. Experimental results demonstrate that accelerated SBM is potentially faster than some existing image CS reconstruction methods.

• Bulletin of the Korean Chemical Society
• /
• v.30 no.11
• /
• pp.2665-2668
• /
• 2009

A new algorithm for determining noise level is proposed for more reliability in interpreting spectral data for complex Fourier transform ion cyclotron resonance (FTICR) mass spectra of petroleum. In the new algorithm, a moving window with a fixed number of data points was adopted, instead of a fixed m/z width. In the analysis of petroleum, it was found that a moving window of 50,000 or more data points was optimal. This optimized automated peak picking performed well even with frequency-dependant noise in the mass spectrum. Additionally, this fast, automated peak picking algorithm was suitable for the analysis of a large set of samples.

• Journal of the Korean Institute of Electrical and Electronic Material Engineers
• /
• v.36 no.5
• /
• pp.520-524
• /
• 2023

An algorithm was developed to detect and block serial arc currents using HPF. The AC series arc problem is that the load current is greater than the fault current and no leakage current occurs. As a solution, an arc detection method utilizing differences in high- frequency amplitudes was developed. HPT was applied to the load current and FFT was applied to eliminate low frequencies. An algorithm has been developed to detect arc waveforms when they exceed a certain value compared to the average of normal waveforms. Using one cycle of data, arc detection is faster and arc accidents are prevented.

• Journal of Communications and Networks
• /
• v.18 no.1
• /
• pp.27-39
• /
• 2016

This paper derives and analyzes a novel block fast Fourier transform (FFT) based joint detection algorithm. The paper compares the performance and complexity of the novel block-FFT based joint detector to that of the Cholesky based joint detector and single user detection algorithms. The novel algorithm can operate at chip rate sampling, as well as higher sampling rates. For the performance/complexity analysis, the time division duplex (TDD) mode of a wideband code division multiplex access (WCDMA) is considered. The results indicate that the performance of the fast FFT based joint detector is comparable to that of the Cholesky based joint detector, and much superior to that of single user detection algorithms. On the other hand, the complexity of the fast FFT based joint detector is significantly lower than that of the Cholesky based joint detector and less than that of the single user detection algorithms. For the Cholesky based joint detector, the approximate Cholesky decomposition is applied. Moreover, the novel method can also be applied to any generic multiple-input-multiple-output (MIMO) system.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2004.05b
• /
• pp.47-53
• /
• 2004

The paper shows that the combination of the hardware, NI PCI 6110E board and the software, Fourier and continuous wavelet transform(CWT) can be used to implement for extracting the important features of the real-time signal. The results confirmed that CWT produces the fast computation enough for the application of the real-time signal processing except the negligible time delay. In denoising case, because of the lack of translation invariance of wavelet basis, traditional wavelet thresholding leads to pseudo-Gibbs phenomena in the vicinity of discontinuities of signal. In this paper, in order to reduce the pseudo-Gibbs phenomena, wavelet coefficients are threshold and reconstruction algorithm is implement through shift-invariant gibbs free denoising algorithm based on wavelet transform footprint. The proposed algorithm can potentially be extended to more general signals like piecewise smooth signals and represents an effective solution to problems like signal denoising.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.13 no.1
• /
• pp.35-41
• /
• 2020

Fast Fourier transform (FFT) processors have been widely used in various application such as communications, image, and biomedical signal processing. Especially, high-performance and low-power FFT processing is indispensable in OFDM-based communication systems. This paper presents a novel radix-26 FFT algorithm with low computational complexity and high hardware efficiency. Applying a 7-dimensional index mapping, the twiddle factor is decomposed and then radix-26 FFT algorithm is derived. The proposed algorithm has a simple twiddle factor sequence and a small number of complex multiplications, which can reduce the memory size for storing the twiddle factor. When the coefficient of twiddle factor is small, complex constant multipliers can be used efficiently instead of complex multipliers. Complex constant multipliers can be designed more efficiently using canonic signed digit (CSD) and common subexpression elimination (CSE) algorithm. An efficient complex constant multiplier design method for the twiddle factor multiplication used in the proposed radix-26 algorithm is proposed applying CSD and CSE algorithm. To evaluate performance of the previous and the proposed methods, 256-point single-path delay feedback (SDF) FFT is designed and synthesized into FPGA. The proposed algorithm uses about 10% less hardware than the previous algorithm.

• Proceedings of the KIEE Conference
• /
• 2004.07d
• /
• pp.2350-2352
• /
• 2004

This paper presents the implementation-tation of the real-time software GPS Receiver based on FFT and FLL assisted PLL tracking algorithm. The FFT(fast fourier transform) based GPS si-gnal acquisition scheme provides a fast TTFF(time to first fix) performance. The tracking based on FLL assisted PLL enables tracking of GPS signal in a high dynamic environment. The designed software GPS receiver uses the indexing method for generating replica carrier to reduce computation load. The performance of the implemented GPS receiver is evaluated using high-dynamic simulated data from a simulator and real static data.

• Wind and Structures
• /
• v.29 no.6
• /
• pp.389-403
• /
• 2019

In this study, two original spectral representations of stationary stochastic fields, say the continuous proper orthogonal decomposition (CPOD) and the frequency-wavenumber spectral representation (FWSR), are derived from the Fourier-Stieltjes integral at first. Meanwhile, the relations between the above two representations are discussed detailedly. However, the most widely used conventional Monte Carlo schemes associated with the two representations still leave two difficulties unsolved, say the high dimension of random variables and the incompleteness of probability with respect to the generated sample functions of the stochastic fields. In view of this, a dimension-reduction model involving merely one elementary random variable with the representative points set owing assigned probabilities is proposed, realizing the refined description of probability characteristics for the stochastic fields by generating just several hundred representative samples with assigned probabilities. In addition, for the purpose of overcoming the defects of simulation efficiency and accuracy in the FWSR, an improved scheme of non-uniform wavenumber intervals is suggested. Finally, the Fast Fourier Transform (FFT) algorithm is adopted to further enhance the simulation efficiency of the horizontal stochastic wind velocity fields. Numerical examplesfully reveal the validity and superiorityof the proposed methods.