View : 724 Download: 0

Full metadata record

DC Field Value Language
dc.contributor.advisor이준엽-
dc.contributor.author윤나라-
dc.creator윤나라-
dc.date.accessioned2016-08-25T10:08:51Z-
dc.date.available2016-08-25T10:08:51Z-
dc.date.issued2010-
dc.identifier.otherOAK-000000060296-
dc.identifier.urihttps://dspace.ewha.ac.kr/handle/2015.oak/185821-
dc.identifier.urihttp://dcollection.ewha.ac.kr/jsp/common/DcLoOrgPer.jsp?sItemId=000000060296-
dc.description.abstractThe fast Fourier transform (FFT) is a widely used signal-processing and analytic concept. The FFT is used in a lot of elds such as information technology, biomedical engineering, geophysical analysis, music synthesis, and so on. For this reason, the large number of numerical libraries provide users with FFT package and users can easily compute the mathematical problem with it. In this paper, we compare the computational timing of 5 FFT libraries; the NAG Fortran Library, the NAG Fortran 90 Library, the NAG Fortran SMP Library, the IMSL Library, and the MATFOR Library. We also compare the computational timing as the data sizes are getting bigger in one-, two-, and three-dimensional spaces. The FFT programs using the NAG libraries are compiled with the Intel Fortran, and the programs using the the IMSL or the MATFOR libraries are with the Absoft Fortran. In addition, we use the Intel X5570 CPU of 64bit and 2.93GHz cpu clock with 24GB RAM.;Fast Fourier Transform (FFT) 는 광범위하게 사용되는 신호처리 방식이자 해석학적 개념이다. 정보통신기술, 생물의학공학, 지구물리학, 음악합성 등 많은 분야에서 FFT가 사용되어 진다. 이런 이유로, 많은 numerical library들은 사용자들에게 FFT 패키지를 제공하고, 사용자들은 그것을 이용해서 쉽게 수학적 문제를 계산한다. 이 논문에서, 우리는 다섯 개의 라이브러리(NAG Fortran Library, NAG Fortran 90 Library, NAG Fortran SMP Library, IMSL Library, MATFOR Library)를 이용해 FFT를 계산하고, 걸리는 시간을 비교한다. 또한, 데이터의 사이즈가 커짐에 따라 FFT를 계산하는데 얼마의 시간이 걸리는지를 1차원, 2차원, 3차원에 대해 각각 비교한다. NAG Library들을 이용한 프로그램들은 Intel Fortran을 통해 컴파일되고, IMSL과 MATFOR Library를 이용한 프로그램은 Absoft Fortran을 통해 컴파일된다. 그리고, 64비트, 2.93GHz의 cpu clock을 제공하는 Intel X5570 CPU와 24GB RAM을 사용한다.-
dc.description.tableofcontents1 Introduction 1 1.1 The discrete Fourier transform (DFT) 1 1.2 The fast Fourier transform (FFT) 2 2 Computation of one dimensional FFT 5 2.1 The NAG Libraries 6 2.2 The IMSL Library 8 2.3 The MATFOR Library (MF) 9 2.4 Comparison of computational timing in 1D space 10 3 Computation of two dimensional FFT 14 3.1 The NAG Libraries 15 3.2 The IMSL Library 17 3.3 The MATFOR Library (MF) 18 3.4 Comparison of computational timing in 2D space 19 4 Computation of three dimensional FFT 23 4.1 The NAG Libraries 24 4.2 The IMSL Library 26 4.3 Comparison of computational timing in 3D space 27 5 Rader's FFT algorithm 31 6 Concluding Remarks 33 References 34 국문 초록 36-
dc.formatapplication/pdf-
dc.format.extent781859 bytes-
dc.languageeng-
dc.publisher이화여자대학교 대학원-
dc.titleComparison of FFT Computational Timing Using the NAG, the IMSL, and the MATFOR Libraries-
dc.typeMaster's Thesis-
dc.format.pageiii, 36 p.-
dc.identifier.thesisdegreeMaster-
dc.identifier.major대학원 수학과-
dc.date.awarded2010. 8-
Appears in Collections:
일반대학원 > 수학과 > Theses_Master
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

BROWSE