• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.8B
• /
• pp.787-795
• /
• 2002

This paper presents the architecture and the implementation of a 2K/4K/8K-point complex Fast Fourier Transform(FFT) processor for Orthogonal Frequency-Division Multiplexing (OFDM) system. The architecture is based on the Cooley-Tukey algorithm for decomposing the long DFT into short length multi-dimensional DFTs. The transposition memory, shuffle memory, and memory mergence method are used for the efficient manipulation of data for multi-dimensional transforms. Booth algorithm and the COordinate Rotation DIgital Computer(CORDIC) processor are employed for the twiddle factor multiplications in each dimension. Also, for the CORDIC processor, a new twiddle factor generation method is proposed to obviate the ROM required for storing the twiddle factors. The overall 2K/4K/8K-FFT processor requires 600,000 gates, and it is implemented in 1.8 V, 0.18 ${\mu}m$ CMOS. The processor can perform 8K-point FFT in every 273 ${\mu}s$, 2K-point every 68.26 ${\mu}s$ at 30MHz, and the SNR is over 48dB, which are enough performances for the OFDM in DVB-T.

• 제어로봇시스템학회:학술대회논문집
• /
• 1987.10a
• /
• pp.851-856
• /
• 1987

A direct computation algorithm of two dimensional fast Fourier transform (2D-FFT) is considered here for implementation in mesh connected multiprocessor array of both a 2D-toroidal and a rectangular type. Results are derived for a hardware algorithm including data allocation and interprocessor communications. A performance comparison is carried out between the proposed direct 2D-FFT computation and the conventional one to show that a new algorithm gives higher speedup under a reasonable assumption on the speeds of operations.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 1993.04a
• /
• pp.128-133
• /
• 1993

본 연구에서는 보강 원통쉘에 대하여 주위 유체의 영향을 고려하여 진동 및 음향방사를 해석하였다. 원통셀의 운동방정식은 Donnell 이론을 적용하였으 며, Contour 적분을 풀지 않고 FFT 알고리즘(Fast Fourier Transform Algorithm)을 이용하여 원통쉘의 진동을 계산하였다. 현재까지의 방사패턴에 관한 연구는 주로 원주 방향에 집중되어 왔으나, 보강 원통쉘의 방사패턴은 원추파 모형에 가까우므로 극좌표 .theta. 방향에 대한 음향방사 패턴에 관한 연구가 이루어져야 한다. 그러므로, 본 연구에서는 극좌표에 관한 방사패턴 에 관하여 주로 고찰하였다.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 2004.10a
• /
• pp.269-273
• /
• 2004

The moduled interferometer with waveplates, polarizing beam splitter, etc. for four phase shifted interference patterns was stabilized with the and Fast Fourier Transform (FFT) method was used to investigate the surface profile measurement from the interferenece pattern from Twyman-Green interferometer using a mathcad.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.37 no.4
• /
• pp.251-256
• /
• 1988

This work describes a speech analysis of Korean number ('1'-'10') which are spoken by several speakers using Fast Walsh Transform(FWHT) method. FWHT includes only addition and subtraction operations, therefore faster and needs less memory than FFT(Fast Fourier Transfifrm) or LPC(Linear Predictive Coding) analysis method. We have investigated that FWHT method can find speaker independent feature(which represents same cue about some word independent of different speakers) The results of this experiment, the 70% of same words(korean number '2')which spoken by several speakers have had slmilar patterns.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.260-262
• /
• 2003

New Image registration techniques are developed for determining geometric distortions between two images of the same scene. First, the properties of the Fourier transform of a two dimensional function under the affine transformation are given. As a result, techniques for the estimation of the coefficients of the distortion model using the spectral frequency information are developed. Image registration can be achieved by applying the fast Fourier transform (FFT) technique for cross correlation of misregistered imagery to determine spatial distances. The correlation results may be rather broad, making detection of the peak difficult, what can be suppressed by enhancing cross-correlation technique. Yield greatly improves the delectability and high precision of image misregistration.

• Journal of Welding and Joining
• /
• v.21 no.6
• /
• pp.33-39
• /
• 2003

Wavelet transform analysis results show a spectrum energy distribution of CWT along scale factors distinguish the partial, full and over penetration in a electron beam welding by analyzing the curve of spectrum energy at small scale, middle and large scale range, respectively. Two types of signals collected by Ion collector and x-ray sensors and analyzed. The acquired signals from sensors are very complicated since these signals are very closely related the dynamics of keyhole which interact the very high density energy with materials during welding. The results show the wavelet transform is more effective to diagnosis than Fourier Transform, further for the general welding defects which are not a periodic based, but a transient, non-stationary and time-varying phenomena.

• Geophysics and Geophysical Exploration
• /
• v.16 no.3
• /
• pp.139-144
• /
• 2013

A computer program has been developed to estimate time-domain electromagnetic (EM) responses for a onedimensional model with multiple source and receiver dipoles that are finite in length. The time-domain solution can be obtained by applying an inverse fast Fourier transform (FFT) to frequency-domain fields for efficiency. Frequency-domain responses are first obtained for 10 logarithmically equidistant frequencies per decade, and then cubic spline interpolated to get the FFT input. In the case of phases, the phase curve must be made to be continuous prior to the spline interpolation. The spline interpolated data are convolved with a source current waveform prior to FFT. In this paper, only a step-off waveform is considered. This time-domain code is verified with an analytic solution and EM responses for a marine hydrocarbon reservoir model. Through these comparisons, we can confirm that the accuracy of the developed program is fairly high.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.6
• /
• pp.1241-1245
• /
• 2009

As FFT(Fast Fourier Transform) processor is used in OFDM(Orthogonal Frequency Division Multiplesing) system. According to increase requirement about mobility and broadband, Research about low power and low area FFT processor is needed. So research concern in reduction of memory size and complex multiplier is in progress. Increasing points of FFT increase memory area of FFT processor. Specially, SRU(Signal Reordering Unit) has the most memory in FFT processor. In this paper, we propose a reduced method of memory size of SRU in FFT processor. SRU of 64, 1024 point FFT processor performed implementation by VerilogHDL coding and it verified by simulation. We select the APEX20KE family EP20k1000EPC672-3 device of Altera Corps. SRU implementation is performed by synthesis of Quartus Tool. The bits of data size decide by 24bits that is 12bits from real, imaginary number respectively. It is shown that, the proposed SRU of 64point and 1024point achieve more than 28%, 24% area reduction respectively.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.6
• /
• pp.909-921
• /
• 1995

The objective of this paper is to develop an algorithm for a real-time automatic fingerprint recognition system. The algorithm employs the Fast Fourier Transform (FFT) in determining the directions of ridges in fingerprint images, and utilizes statistical information in recognizing the fingerprints. The information used in fingerprint recognition is based on the dircetions along ridge curves and characteristic points such as core points and delta points. In order to find ridge directions, the algorithm applies the FFT to a small block of the size 8x8 pixels, and decides the directions by interpreting the resulted Fourier spectrum. By using the FFT, the algorithm does not require conventional preprocessing procedures such as smoothing, binarization, thinning, and restorationl. Finally, in matching two fingerprint images, the algorithm searches and compares two kinds of feature blocks, one as the blocks where the dircetions cannot be defined from the Fourier spectrum, and the other as the blocks where the changes of directions become abrupt. The proposed algorithm has been implemented on a SunSparc-2 workstation under the Open Window environment. In the experiment, the proposed algorithm has been applied to a set of fingerprint images obtained by a prism system. The result has shown that while the rate of Type II error - Incorrect recognition of two different fingerprints as the identical fingerprints - is held at 0.0%, the rate of Type I error - Incorrect recognition of two identical fingerprints as the different ones - is 2.2%.