• 제목/요약/키워드: Fast Fourier transform (FFT)

검색결과 572건 처리시간 0.024초

CORDIC 알고리듬에 기반 한 OFDM 시스템용 8192-Point FFT 프로세서 (A 8192-Point FFT Processor Based on the CORDIC Algorithm for OFDM System)

  • 박상윤;조남익
    • 한국통신학회논문지
    • /
    • 제27권8B호
    • /
    • pp.787-795
    • /
    • 2002
  • 본 논문에서 OFDM (Orthogonal Frequency-Division Multiplexing) 시스템용 2K/4K/8K-point 복소 FFT (Fast Fourier Transform) 프로세서의 구조와 그 구현방법을 제안한다. 제안하는 프로세서의 구조는 긴 길이의 DFT를 짧은 길이의 다차원 DFT로 분할하기 위하여 쿨리-투키 알고리듬에 기반 한다. 전치 메모리, 셔플 메모리, 메모리 합성 방법은 다차원 변환을 위한 메모리의 능률적 조작을 위해 사용한다. Booth 알고리듬과 CORDIC (COordinate Rotation DIgital Computer) 프로세서는 각 차원에서 트위들 팩터 곱셈을 위해 사용한다. 또한, CORDIC 프로세서에는 트위들 팩터를 저장하기 위해 필요한 ROM의 사용을 막기 위해 트위들 팩터 발생 방법을 제안한다. 전체 2K/4K/8K FFT 프로세서는 600,000 게이트를 사용하며, 1.8V, 0.18${\mu}m$ CMOS를 이용해 구현한다. 제안하는 프로세서는 8K-point FFT를 273${\mu}s$마다, 2K-point를 68.26${\mu}s$마다 수행할 수 있으며, SNR은 DVB-T의 OFDM을 위해 충분한 48dB를 넘는다.

A 2D-FFT algorithm on mesh connected multiprocessor systems

  • Kunieda, Hiroaki;Itoh, Kazuhito
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1987년도 한국자동제어학술회의논문집(한일합동학술편); 한국과학기술대학, 충남; 16-17 Oct. 1987
    • /
    • 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.

  • PDF

보강 원통형 몰수체의 음향방사 해석과 FFT에 의한 진동 해석 (Acoustic Radiation Analysis of Stiffened Cylindrical shell and Vibrational Velocity by FFT)

  • 배수룡;이헌곤;홍진숙
    • 한국소음진동공학회:학술대회논문집
    • /
    • 한국소음진동공학회 1993년도 춘계학술대회논문집; 한국과학연구소, 21 May 1993
    • /
    • pp.128-133
    • /
    • 1993
  • 본 연구에서는 보강 원통쉘에 대하여 주위 유체의 영향을 고려하여 진동 및 음향방사를 해석하였다. 원통셀의 운동방정식은 Donnell 이론을 적용하였으 며, Contour 적분을 풀지 않고 FFT 알고리즘(Fast Fourier Transform Algorithm)을 이용하여 원통쉘의 진동을 계산하였다. 현재까지의 방사패턴에 관한 연구는 주로 원주 방향에 집중되어 왔으나, 보강 원통쉘의 방사패턴은 원추파 모형에 가까우므로 극좌표 .theta. 방향에 대한 음향방사 패턴에 관한 연구가 이루어져야 한다. 그러므로, 본 연구에서는 극좌표에 관한 방사패턴 에 관하여 주로 고찰하였다.

  • PDF

안정화된 간섭계와 FFT를 이용한 표면 측정 (Surface profile measurement with FFT method and stabilized interferometer)

  • 류진;김현수;박종락;김진태
    • 한국공작기계학회:학술대회논문집
    • /
    • 한국공작기계학회 2004년도 추계학술대회 논문집
    • /
    • 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.

  • PDF

Walsh변환을 이용한 한국어 숫자음 음성분석에 관한 연구 (A Study on Korean Speech Analysis using Walsh Transform)

  • 김계현;김준현
    • 대한전기학회논문지
    • /
    • 제37권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.

  • PDF

Image Registration Improvement Based-on FFT Techniques with the Affine Transform Estimation

  • Wisetphanichkij, Sompong;Pasomkusolsil, Sanchaiya;Dejhan, Kobchai;Cheevasuvit, Fusak;Mitatha, Somsak;Sra-Ium, Napat;Vorrawat, Vinai;Pienvijarnpong, Chanchai
    • 대한원격탐사학회:학술대회논문집
    • /
    • 대한원격탐사학회 2003년도 Proceedings of ACRS 2003 ISRS
    • /
    • 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.

  • PDF

웨이브렛 변환을 이용한 전자빔 용접 진단 (Electron Beam Welding Diagnosis Using Wavelet Transform)

  • 윤충섭
    • Journal of Welding and Joining
    • /
    • 제21권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.

수평다층구조에 대한 시간영역 전자기장의 계산법 (A Scheme for Computing Time-domain Electromagnetic Fields of a Horizontally Layered Earth)

  • 장한길로;김희준
    • 지구물리와물리탐사
    • /
    • 제16권3호
    • /
    • pp.139-144
    • /
    • 2013
  • 유한길이의 다중 송수신 쌍극자에 의한 수평다층구조의 시간영역 전자기장을 계산하기 위한 컴퓨터 프로그램을 개발하였다. 시간영역 반응은 주파수영역에서 계산된 값에 빠른 역푸리에변환(inverse fast Fourier transform: FFT)을 적용하여 효율적으로 얻을 수 있다. 먼저 대수영역에서 등간격으로 한 decade 당 10개의 주파수영역 반응을 구한 후 FFT를 적용시키기 위해 3차 스플라인 사이채움(cubic spline interpolation)을 실시한다. 이 때 위상의 경우에는 스플라인 사이채움 이전에 위상곡선을 연속적으로 만들어 주는 과정이 추가된다. 스플라인 사이채움된 자료들은 송신전류파형과 곱말기(convolution)를 한 후 FFT를 통해 시간영역 자료로 만들어진다. 이 논문에서는 step-off 파형만 고려하였다. 개발된 시간영역 프로그램은 해석해와 해양 탄화수소 저류층 모델에 대한 반응을 이용하여 검증하였으며, 그 결과는 충분히 정확함을 확인 할 수 있었다.

FFT를 위한 효율적인 Signal Reordering Unit 구현 (Efficient Signal Reordering Unit Implementation for FFT)

  • 양승원;이종열
    • 전기학회논문지
    • /
    • 제58권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.

블럭 FFT를 이용한 실시간 지문 인식 알고리즘 (Automatic Real-time Identification of Fingerprint Images Using Block-FFT)

  • 안도성;김학일
    • 전자공학회논문지B
    • /
    • 제32B권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%.

  • PDF