• Applied Microscopy
• /
• 제44권4호
• /
• pp.138-143
• /
• 2014

Transmission electron microscope (TEM) is an excellent tool for studying the structure and properties of nanostructured materials. As the development of $C_s$-corrected TEM, the direct analysis of atomic structures of nanostructured materials can be performed in the high-resolution transmission electron microscopy (HRTEM). Especially, fast Fourier transform (FFT) technique in image processing is very useful way to determine the crystal structure of HRTEM images in reciprocal space. To apply FFT technique in HRTEM analysis in more reasonable and friendly manner, we made a new circular region of interest (C-ROI) FFT script and tested it for several HRTEM analysis. Consequentially, it was proved that the new FFT application shows more quantitative and clearer results than conventional FFT script by removing the streaky artifacts in FFT pattern images. Finally, it is expected that the new FFT script gives great advantages for quantitative interpretation of HRTEM images of many nanostructured materials.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 추계종합학술대회 논문집
• /
• pp.343-346
• /
• 1998

In this paper a radiation problem for a finite microstrip antenna structure is analyzed. For the analysis of finite structures we utilize the equivalent volume current. Intergral equation for the unknown equivalent volume current induced on a finite microstrip structure is derived and solved by the use of conjugate gradient-fast fourier. transform (CG-FFT) method. Some numerical examples are radiation patterns derived by the equivalent volume current solved by the conjugate gradient-fast fourier transform.

• Korean Journal of Mathematics
• /
• 제19권3호
• /
• pp.243-253
• /
• 2011

We would like to propose a Cooley-Tukey modied algorithm in fast Fourier transform(FFT). Of course, this is a kind of Cooley-Tukey twiddle factor algorithm and we focused on the choice of integers. The proposed algorithm is better than existing ones in speeding up the calculation of the FFT.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2003년도 추계학술대회
• /
• pp.1654-1659
• /
• 2003

This paper introduces a fast Fourier transform (FFT)-based spectral analysis method for the transient responses as well as the steady-state responses of linear discrete systems. The force vibration of a viscously damped three-DOF system is considered as the illustrative numerical example. The proposed spectral analysis method is evaluated by comparing with the exact analytical solutions as well as with the numerical solutions obtained by the Runge-Kutta method.

• 한국소성가공학회:학술대회논문집
• /
• 한국소성가공학회 1997년도 추계학술대회논문집
• /
• pp.138-141
• /
• 1997

CFM(Cast Forge Method) is widely used in manufacturing industry to produce aluminium parts with good mechanical properties and low production cost. CFM is the process which produces a final products by forging from the initial billet by casting. The study on this paper covers the automatic design method which finds a pertinent shape for initial billet using Fast Fourier Transform, low-pass frequency filtering and FEM simulation of the nonisothermal forging process by DEFORM. These works will give us an information to enhance the low strength of a aluminium casting.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2005년도 한국컴퓨터종합학술대회 논문집 Vol.32 No.1 (B)
• /
• pp.808-810
• /
• 2005

분 논문에서는 워터마크가 삽입된 영상의 비가시성과 강인성을 보장하기 위하여 주파수 영역 기반인 FFT(Fast Fourier Transform)을 이용하였다. 그리고 영상에 삽입된 워터마크를 정확하게 추출하기 위하여 워터마크에 삽입하는 키 사이의 직교성을 유지할 수 있는 그람-슈미트 정규직교화를 이용하였다. 실험을 통해 살펴본 결과 영상의 특징에 관계없이 랜덤계열에 민감한 워터마크를 추출할 수 있는 정확성 및 신뢰성을 가짐을 알 수 있었다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 신호처리소사이어티 추계학술대회 논문집
• /
• 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.

• Journal of Electrical Engineering and Technology
• /
• 제13권1호
• /
• pp.298-306
• /
• 2018

This paper presents a harmonic analysis of the modular multilevel converter (MMC) using a double Fourier series (DFS) algorithm. First, the application of DFS for harmonic calculation in the MMC is made by considering the effect of arm inductor. The analytical results are then confirmed by comparing with the simulation results of using the fast Fourier transform (FFT) algorithm. Finally, distribution of harmonics and total harmonic distortion (THD) in the MMC will be analyzed in three cases: harmonics versus number of levels of MMC, harmonics versus total switching frequency and harmonics versus modulation index. The simulation results are performed in the PSCAD/EMTDC simulation program in order to verify the analytical results obtained by Matlab programming.

• 한국음향학회지
• /
• 제5권4호
• /
• pp.22-26
• /
• 1986

The following methods have been proposed for implementing R2 multi-frequency receiver digitally: using digital filters, period-counting algorithm, discrete Fourier transform or Goertzel algorithm, and fast Fourier transform.

• 한국광학회:학술대회논문집
• /
• 한국광학회 2000년도 제11회 정기총회 및 00년 동계학술발표회 논문집
• /
• 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)}$ 등의 기존의 알고리즘들과 비교하고자 한다. (중략)