Twiddle factor transformation for pipelined FFT processing

In Cheol Park; Won Hee Son; Ji Hoon Kim

doi:10.1109/ICCD.2007.4601872

Twiddle factor transformation for pipelined FFT processing

In Cheol Park, Won Hee Son, Ji Hoon Kim

Electronic and Electrical Engineering

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

2 Scopus citations

Abstract

This paper presents a novel transformation technique that can derive various fast Fourier transform (FFT) in a unified paradigm. The proposed algorithm is to find a common twiddle factor at the input side of a butterfly and migrate it to the output side. Starting from the radix-2 FFT algorithm, the proposed common factor migration technique can generate most of previous FFT algorithms without using mathematical manipulation. In addition, we propose new FFT algorithms derived by applying the proposed twiddle factor moving technique, which reduce the number of twiddle factors significantly compared with the previous algorithms being widely used for pipelined FFT processing.

Original language	English
Title of host publication	2007 IEEE International Conference on Computer Design, ICCD 2007
Pages	1-6
Number of pages	6
DOIs	https://doi.org/10.1109/ICCD.2007.4601872
State	Published - 2007
Event	2007 IEEE International Conference on Computer Design, ICCD 2007 - Lake Tahoe, CA, United States Duration: 7 Oct 2007 → 10 Oct 2007

Publication series

Name	2007 IEEE International Conference on Computer Design, ICCD 2007

Conference

Conference	2007 IEEE International Conference on Computer Design, ICCD 2007
Country/Territory	United States
City	Lake Tahoe, CA
Period	7/10/07 → 10/10/07

Access to Document

10.1109/ICCD.2007.4601872

Cite this

@inproceedings{f5770e9302da4c5498619f0f6e27f138,

title = "Twiddle factor transformation for pipelined FFT processing",

abstract = "This paper presents a novel transformation technique that can derive various fast Fourier transform (FFT) in a unified paradigm. The proposed algorithm is to find a common twiddle factor at the input side of a butterfly and migrate it to the output side. Starting from the radix-2 FFT algorithm, the proposed common factor migration technique can generate most of previous FFT algorithms without using mathematical manipulation. In addition, we propose new FFT algorithms derived by applying the proposed twiddle factor moving technique, which reduce the number of twiddle factors significantly compared with the previous algorithms being widely used for pipelined FFT processing.",

author = "Park, {In Cheol} and Son, {Won Hee} and Kim, {Ji Hoon}",

year = "2007",

doi = "10.1109/ICCD.2007.4601872",

language = "English",

isbn = "1424412587",

series = "2007 IEEE International Conference on Computer Design, ICCD 2007",

pages = "1--6",

booktitle = "2007 IEEE International Conference on Computer Design, ICCD 2007",

note = "null ; Conference date: 07-10-2007 Through 10-10-2007",

}

Park, IC, Son, WH & Kim, JH 2007, Twiddle factor transformation for pipelined FFT processing. in 2007 IEEE International Conference on Computer Design, ICCD 2007., 4601872, 2007 IEEE International Conference on Computer Design, ICCD 2007, pp. 1-6, 2007 IEEE International Conference on Computer Design, ICCD 2007, Lake Tahoe, CA, United States, 7/10/07. https://doi.org/10.1109/ICCD.2007.4601872

TY - GEN

T1 - Twiddle factor transformation for pipelined FFT processing

AU - Park, In Cheol

AU - Son, Won Hee

AU - Kim, Ji Hoon

PY - 2007

Y1 - 2007

N2 - This paper presents a novel transformation technique that can derive various fast Fourier transform (FFT) in a unified paradigm. The proposed algorithm is to find a common twiddle factor at the input side of a butterfly and migrate it to the output side. Starting from the radix-2 FFT algorithm, the proposed common factor migration technique can generate most of previous FFT algorithms without using mathematical manipulation. In addition, we propose new FFT algorithms derived by applying the proposed twiddle factor moving technique, which reduce the number of twiddle factors significantly compared with the previous algorithms being widely used for pipelined FFT processing.

AB - This paper presents a novel transformation technique that can derive various fast Fourier transform (FFT) in a unified paradigm. The proposed algorithm is to find a common twiddle factor at the input side of a butterfly and migrate it to the output side. Starting from the radix-2 FFT algorithm, the proposed common factor migration technique can generate most of previous FFT algorithms without using mathematical manipulation. In addition, we propose new FFT algorithms derived by applying the proposed twiddle factor moving technique, which reduce the number of twiddle factors significantly compared with the previous algorithms being widely used for pipelined FFT processing.

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

U2 - 10.1109/ICCD.2007.4601872

DO - 10.1109/ICCD.2007.4601872

M3 - Conference contribution

AN - SCOPUS:52949114553

SN - 1424412587

SN - 9781424412587

T3 - 2007 IEEE International Conference on Computer Design, ICCD 2007

SP - 1

EP - 6

BT - 2007 IEEE International Conference on Computer Design, ICCD 2007

Y2 - 7 October 2007 through 10 October 2007

ER -

Twiddle factor transformation for pipelined FFT processing

Abstract

Publication series

Conference

Access to Document

Fingerprint

Cite this