Research on Parallel Calculation of Fast Fourier Transform Based on Complex Sequence

Author

Lu, Da ; Fan, Hanqing

Author_Institution

Dept. of Comput. Sci., Xiamen Univ., Xiamen, China

fYear

2010

fDate

20-22 Aug. 2010

Firstpage

1

Lastpage

5

Abstract

In this paper, we take Fourier transform (FFT) algorithm for example, which is the most important algorithm in harmonic detection. we propose an OpenMP implementation of a Modified FFT Based on Complex Sequence on shared memory parallel computers. The paper also start from computer architecture, we describe how to turn our program into cache friendly and can take full advantage of processor. Performance results of one-dimensional FFTs on the DELL GX620 and the ADVANTECH MIC-3392 are reported. Experiments prove that use OpenMP to rewrite large amounts of data calculation code, efficient multi-threaded reconstruction. FFT implementations could not be realized so far.

Keywords

application program interfaces; cache storage; fast Fourier transforms; multi-threading; parallel architectures; shared memory systems; ADVANTECH MIC-3392; DELL GX620; OpenMP implementation; cache memory; complex sequence; computer architecture; data calculation code; fast Fourier transform; harmonic detection; multithreaded reconstruction; one-dimensional FFT; parallel calculation; shared memory parallel computer; Discrete Fourier transforms; Fast Fourier transforms; Harmonic analysis; Multicore processing; Power systems; Program processors;

fLanguage

English

Publisher

ieee

Conference_Titel

Internet Technology and Applications, 2010 International Conference on

Conference_Location

Wuhan

Print_ISBN

978-1-4244-5142-5

Electronic_ISBN

978-1-4244-5143-2

Type

conf

DOI

10.1109/ITAPP.2010.5566637

Filename

5566637