Implementation of prime-point DFTs with programable processors

Zhenyu Liu; Hongkai Wang; Qunfang Xie; Yanjun Zhang; Wenbiao Zhou; Dake Liu

doi:10.1109/ICSAI.2012.6223367

Implementation of prime-point DFTs with programable processors

Zhenyu Liu^*, Hongkai Wang, Qunfang Xie, Yanjun Zhang, Wenbiao Zhou, Dake Liu

^*Corresponding author for this work

Beijing Institute of Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Citation (Scopus)

Abstract

Two existing DFT/FFT algorithms and a new prime-point Fast Fourier Transform algorithm are implemented with different serial and parallel processors. The evaluation results show that previous multiplication computational cost criterion is no longer applicable to the current parallel implementation. Total computational cost including add/subtract operation is one of the key factors affecting the speed and efficiency of implementation of parallel architecture.

Original language	English
Title of host publication	2012 International Conference on Systems and Informatics, ICSAI 2012
Pages	1693-1697
Number of pages	5
DOIs	https://doi.org/10.1109/ICSAI.2012.6223367
Publication status	Published - 2012
Event	2012 International Conference on Systems and Informatics, ICSAI 2012 - Yantai, China Duration: 19 May 2012 → 20 May 2012

Publication series

Name	2012 International Conference on Systems and Informatics, ICSAI 2012

Conference

Conference	2012 International Conference on Systems and Informatics, ICSAI 2012
Country/Territory	China
City	Yantai
Period	19/05/12 → 20/05/12

Keywords

DFT
FFT
SIMD
SISD
prime factor FFT

Access to Document

10.1109/ICSAI.2012.6223367

Cite this

@inproceedings{07dc52a8ce2a49f587c48fd32ecbf8d8,

title = "Implementation of prime-point DFTs with programable processors",

abstract = "Two existing DFT/FFT algorithms and a new prime-point Fast Fourier Transform algorithm are implemented with different serial and parallel processors. The evaluation results show that previous multiplication computational cost criterion is no longer applicable to the current parallel implementation. Total computational cost including add/subtract operation is one of the key factors affecting the speed and efficiency of implementation of parallel architecture.",

keywords = "DFT, FFT, SIMD, SISD, prime factor FFT",

author = "Zhenyu Liu and Hongkai Wang and Qunfang Xie and Yanjun Zhang and Wenbiao Zhou and Dake Liu",

year = "2012",

doi = "10.1109/ICSAI.2012.6223367",

language = "English",

isbn = "9781467301992",

series = "2012 International Conference on Systems and Informatics, ICSAI 2012",

pages = "1693--1697",

booktitle = "2012 International Conference on Systems and Informatics, ICSAI 2012",

note = "2012 International Conference on Systems and Informatics, ICSAI 2012 ; Conference date: 19-05-2012 Through 20-05-2012",

}

Liu, Z, Wang, H, Xie, Q, Zhang, Y , Zhou, W & Liu, D 2012, Implementation of prime-point DFTs with programable processors. in 2012 International Conference on Systems and Informatics, ICSAI 2012., 6223367, 2012 International Conference on Systems and Informatics, ICSAI 2012, pp. 1693-1697, 2012 International Conference on Systems and Informatics, ICSAI 2012, Yantai, China, 19/05/12. https://doi.org/10.1109/ICSAI.2012.6223367

Implementation of prime-point DFTs with programable processors. / Liu, Zhenyu; Wang, Hongkai; Xie, Qunfang et al.
2012 International Conference on Systems and Informatics, ICSAI 2012. 2012. p. 1693-1697 6223367 (2012 International Conference on Systems and Informatics, ICSAI 2012).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Implementation of prime-point DFTs with programable processors

AU - Liu, Zhenyu

AU - Wang, Hongkai

AU - Xie, Qunfang

AU - Zhang, Yanjun

AU - Zhou, Wenbiao

AU - Liu, Dake

PY - 2012

Y1 - 2012

N2 - Two existing DFT/FFT algorithms and a new prime-point Fast Fourier Transform algorithm are implemented with different serial and parallel processors. The evaluation results show that previous multiplication computational cost criterion is no longer applicable to the current parallel implementation. Total computational cost including add/subtract operation is one of the key factors affecting the speed and efficiency of implementation of parallel architecture.

AB - Two existing DFT/FFT algorithms and a new prime-point Fast Fourier Transform algorithm are implemented with different serial and parallel processors. The evaluation results show that previous multiplication computational cost criterion is no longer applicable to the current parallel implementation. Total computational cost including add/subtract operation is one of the key factors affecting the speed and efficiency of implementation of parallel architecture.

KW - DFT

KW - FFT

KW - SIMD

KW - SISD

KW - prime factor FFT

UR - http://www.scopus.com/inward/record.url?scp=84864272142&partnerID=8YFLogxK

U2 - 10.1109/ICSAI.2012.6223367

DO - 10.1109/ICSAI.2012.6223367

M3 - Conference contribution

AN - SCOPUS:84864272142

SN - 9781467301992

T3 - 2012 International Conference on Systems and Informatics, ICSAI 2012

SP - 1693

EP - 1697

BT - 2012 International Conference on Systems and Informatics, ICSAI 2012

T2 - 2012 International Conference on Systems and Informatics, ICSAI 2012

Y2 - 19 May 2012 through 20 May 2012

ER -

Implementation of prime-point DFTs with programable processors

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this