• Title/Summary/Keyword: fast Fourier transform (FFT)

Search Result 571, Processing Time 0.027 seconds

Design of diffractive pattern elements using two-stage iterative Fourier transform algorithm (2 단계 iterative Fourier transform 알고리즘을 이용한 회절 무늬 소자의 설계에 관한 연구)

  • 정필호;조두진
    • Proceedings of the Optical Society of Korea Conference
    • /
    • 2000.02a
    • /
    • pp.296-297
    • /
    • 2000
  • 프라운호퍼 회절에 의하여 주어진 세기 무늬를 발생시키는 회절광학소자(Diffractive Optical Element, DOE)는 회절무늬소자, 키노폼(kinoform), 컴퓨터 푸리에 홀로그램 (computer-generated Fourier hologram) 등으로 불리우며, 광정보처리, 광연결, 레이저가공에서 중요한 역할을 한다. 이 소자를 설계하는 매우 다양한 방법들이 제안되었는데, iterative Fourier transform 알고리즘(IFTA)과 이를 변형한 알고리즘들이 가장 널리 사용된다. IFTA는 fast Fourier transform(FFT)를 활용하므로 계산시간이 절감되지만 국소 최소점에 고착되는 stagnation문제가 있어 이를 해결하기 위한 많은 변형된 알고리즘들이 제안되었다. 본 연구에서는 최근에 제안한 new Pnoise algorithm with hybrid input-output algorithm(NPA-HIOA)$^{(1)}$ 의 설계 성능을 IFTA, hybrid input-output 알고리즘(HIOA), new Pnoise 알고리즘(NPA)$^{(2)}$ , Nonlinear Least-Square (NLS)$^{(3)}$ 등의 기존의 알고리즘들과 비교하고자 한다. (중략)

  • PDF

Development of Fast and Exact FFT Algorithm for Cross-Correlation PIV (상호상관 PIV기법을 위한 빠르고 정확한 FFT 알고리듬의 개발)

  • Yu, Kwon-Kyu;Kim, Dong-Su;Yoon, Byung-Man
    • Journal of Korea Water Resources Association
    • /
    • v.38 no.10 s.159
    • /
    • pp.851-859
    • /
    • 2005
  • Normalized cross-correlation (correlation coefficient) is a useful measure for pattern matching in PIV (Particle Image Velocimetry) analysis. Because it does not have a corresponding simple expression in frequency domain, several fast but inexact measures have been used. Among them, three measures of correlation for PIV analysis and the normalized cross-correlation were evaluated with a sample calculation. The test revealed that all other proposed correlation measures sometimes show inaccurate results, except the normalized cross-correlation. However, correlation coefficient method has a weakpoint that it requires so long time for calculation. To overcome this shortcoming, a fast and exact method for calculating normalized cross-correlation is suggested. It adopts Fast Fourier Transform (FFT) for calculation of covariance and the successive-summing method for the denominator of correlation coefficient. The new algorithm showed that it is really fast and exact in calculating correlation coefficient.

Fast Image Restoration Using Boundary Artifacts Reduction method (경계왜곡 제거방법을 이용한 고속 영상복원)

  • Yim, Sung-Jun;Kim, Dong-Gyun;Shin, Jeong-Ho;Paik, Joon-Ki
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.44 no.6
    • /
    • pp.63-74
    • /
    • 2007
  • Fast Fourier transform(FFT) is powerful, fast computation framework for convolution in many image restoration application. However, an actually observed image acquired with finite aperture of the acquisition device from the infinite background and it lost data outside the cropped region. Because of these the boundary artifacts are produced. This paper reviewed and summarized the up to date the techniques that have been applied to reduce of the boundary artifacts. Moreover, we propose a new block-based fast image restoration using combined extrapolation and edge-tapering without boundary artifacts with reduced computational loads. We apply edgetapering to the inner blocks because they contain outside information of boundary. And outer blocks use half-convolution extrapolation. For this process it is possible that fast image restoration without boundary artifacts.

A Study of Biosignal Analysis System for Sensibility Evaluation (감성을 평가하기 위한 생체신호 분석 시스템에 관한 연구)

  • Lee, Ji-Hyeoung;Kim, Kyung-Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.12
    • /
    • pp.19-26
    • /
    • 2010
  • In this paper, we studied about the Embedded System of the biosignal measurement and analysis to sensibility evaluation in daily life for non-intrusive. This system is two kinds of measuring biosiganls(Electrocardiogram:ECG, Photoplethysmography:PPG) and analyzed by real-time wireless transmission to notebook PC using bluetooth for consistent and reliability of physiological way to assess continuously changing sensibility. Comparative studied of an autonomic nerve system activity ratio on characteristics frequency band of two kinds of biosignal analyzed frequency way using the Fast Fourier Transform(FFT) and Power Spectrum Density(PSD). Also the key idea of this system is to minimize computing of analysis algorithm for faster and more accurate to assess the sensibility, and the result of the visualization using graph. In this paper, we evaluated the analysis system to assess sensibility that measuring various situation in daily life using a non-intrusive biosignal measurement system, and the accuracy and reliability in comparison with difference of result by development analysis system.

Leakage Detection Method in Water Pipe using Tree-based Boosting Algorithm (트리 기반 부스팅 알고리듬을 이용한 상수도관 누수 탐지 방법)

  • Jae-Heung Lee;Yunsung Oh;Junhyeok Min
    • Journal of Internet of Things and Convergence
    • /
    • v.10 no.2
    • /
    • pp.17-23
    • /
    • 2024
  • Losses in domestic water supply due to leaks are very large, such as fractures and defects in pipelines. Therefore, preventive measures to prevent water leakage are necessary. We propose the development of a leakage detection sensor utilizing vibration sensors and present an optimal leakage detection algorithm leveraging artificial intelligence. Vibrational sound data acquired from water pipelines undergo a preprocessing stage using FFT (Fast Fourier Transform), followed by leakage classification using an optimized tree-based boosting algorithm. Applying this method to approximately 260,000 experimental data points from various real-world scenarios resulted in a 97% accuracy, a 4% improvement over existing SVM(Support Vector Machine) methods. The processing speed also increased approximately 80 times, confirming its suitability for edge device applications.

The orthogonal filter design using improved fast Walsh transform (개선된 고속월쉬변환에 의한 직교필터 설계)

  • Chung, Je-Wook;Cho, Young-Ho;Lee, Han-Seok;Park, Jun-Hoon;Shim, Jae-Sun;Ahn, Doo-Soo
    • Proceedings of the KIEE Conference
    • /
    • 2000.07d
    • /
    • pp.2620-2623
    • /
    • 2000
  • The standard approach consists of using correlation of orthogonal functions in digital filtering, such as well-known FFT(Fast Fourier Transform) and FWT(Fast Walsh Transform). But it needs much calculations, multiplications and additions. The calculation amount is m $log_2m$ in the general case. Therefore, this requires high speed processors to calculate in real time, which can calculate floating point. This study developed improved fast Walsh transform based on dyadic-ordered fast Walsh transform, then regenerated signal flow graph of improved fast Walsh transform, and used it for digital filtering, and then measured fundamental frequency and harmonics for current and voltage signals of power system.

  • PDF

A Study on the variable points IFFT/FFT processor (재구성 가능한 가변 포인트 IFFT/FFT 프로세서 설계에 관한 연구)

  • Choi Won-Chul;Goo Jeon-Hyoung;Lee Hyun;Oh Hyun-Seo
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.41 no.12
    • /
    • pp.61-68
    • /
    • 2004
  • Wireless mobile communication systems request high speed mobility and high speed data transmission capability. In order to meet the requirements, OFDM(Orthogonal Frequency Division Multiplex) is mainly adopted in the physical layer of the wireless systems. In commercial wireless mobile systems, IEEE802.(11a, 16e, etc) series seem to be used as the modulation method. For supporting multiple air-interfaces in a wireless mobile system, different kinds of OFDM based modulation methods should be supported in one modem chip. It requires a variable point IFFT/FFT or reconfigurable IFFT/FFT processor. In this paper, we propose the design method of a reconfigurable IFFT/FFT processor. In addition, it is shown that a reconfigurable IFFT/FFT processor can he implemented by using the proposed method.

New DIT Radix-8 FFT Butterfly Structure (새로운 DIT Radix-8 FFT 나비연산기 구조)

  • Jang, Young-Beom
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.16 no.8
    • /
    • pp.5579-5585
    • /
    • 2015
  • In FFT(Fast Fourier Transform) implementation, DIT(Decimation-In-Time) and DIF (Decimation-In-Frequency) methods are mostly used. Among them, various DIF structures such as Radix-2/4/8 algorithm have been developed. Compared to the DIF, the DIT structures have not been investigated even though they have a big advantage producing a sequential output. In this paper, a butterfly structure for DIT Radix-8 algorithm is proposed. The proposed structure has smaller latency time because of Radix-8 algorithm in addition to the advantage of the sequential output. In case of 4096-point FFT implementation, the proposed structure has only 4 stages which shows the smaller latency time compared to the 12 stages of Radix-2 algorithm. The proposed butterfly can be used in FFT block required the sequential output and smaller latency time.

A SPECTRAL ANALYSIS METHOD FOR SPECTRAL ELEMENT MODELS (스펙트럴 요소 모델을 이용한 스펙트럴 해석법)

  • Cho J.;Yoon D.;Hwang I.;Lee U.
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2005.10a
    • /
    • pp.409-414
    • /
    • 2005
  • In the literatures, the FFT-based SAM has been well applied to the computation of the steady-state responses of discrete dynamic systems. In this paper, a fast fourier transforms (FFT)-based spectral analysis method (SAM) is proposed fur the dynamic analysis of spectral element models subjected to the non-zero initial conditions. However, the FFT-based SAM has not yet been developed for the continuous systems represented by the spectral element model.

  • PDF

Parallel Synthesis Algorithm for Layer-based Computer-generated Holograms Using Sparse-field Localization

  • Park, Jongha;Hahn, Joonku;Kim, Hwi
    • Current Optics and Photonics
    • /
    • v.5 no.6
    • /
    • pp.672-679
    • /
    • 2021
  • We propose a high-speed layer-based algorithm for synthesizing computer-generated holograms (CGHs), featuring sparsity-based image segmentation and computational parallelism. The sparsity-based image segmentation of layer-based three-dimensional scenes leads to considerable improvement in the efficiency of CGH computation. The efficiency enhancement of the proposed algorithm is ascribed to the field localization of the fast Fourier transform (FFT), and the consequent reduction of FFT computational complexity.