Canonic real-valued radix-2n FFT computations

Yingjie Lao; Keshab K Parhi

doi:10.1109/ACSSC.2015.7421166

Canonic real-valued radix-2n FFT computations

Yingjie Lao, Keshab K Parhi

Electrical and Computer Engineering

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

2 Scopus citations

Abstract

Fast Fourier transform (FFT) is an important digital signal processing (DSP) algorithm for analysis of the phase and frequency components of a time-domain signal. Canonic real-valued FFT (RFFT) approach improves the computation performance by completely eliminating arithmetic redundancies. The major advantage of the canonic RFFTs is that these require the least butterfly operations and only involve real datapath when mapped to architectures. In this paper, we study the performances of canonic RFFT computations for different radix factorizations. We compare various radices RFFTs along with their canonic variants from both arithmetic and architectural perspectives. It is shown that decimation-in-frequency (DIF) RFFT structures require less twiddle factor operations than their decimation-in-time (DIT) counterparts. However, we also show that canonic RFFTs may not be desirable when taking the cost of twiddle factor operations as the major consideration.

Original language	English (US)
Title of host publication	Conference Record of the 49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015
Editors	Michael B. Matthews
Publisher	IEEE Computer Society
Pages	441-446
Number of pages	6
ISBN (Electronic)	9781467385763
DOIs	https://doi.org/10.1109/ACSSC.2015.7421166
State	Published - Feb 26 2016
Event	49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015 - Pacific Grove, United States Duration: Nov 8 2015 → Nov 11 2015

Publication series

Name	Conference Record - Asilomar Conference on Signals, Systems and Computers
Volume	2016-February
ISSN (Print)	1058-6393

Other

Other	49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015
Country/Territory	United States
City	Pacific Grove
Period	11/8/15 → 11/11/15

Bibliographical note

Publisher Copyright:
© 2015 IEEE.

Access

10.1109/ACSSC.2015.7421166

OpenUrl availability

Full text

Cite this

Lao, Y., & Parhi, K. K. (2016). Canonic real-valued radix-2n FFT computations. In M. B. Matthews (Ed.), Conference Record of the 49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015 (pp. 441-446). Article 7421166 (Conference Record - Asilomar Conference on Signals, Systems and Computers; Vol. 2016-February). IEEE Computer Society. https://doi.org/10.1109/ACSSC.2015.7421166

Canonic real-valued radix-2n FFT computations. / Lao, Yingjie; Parhi, Keshab K.
Conference Record of the 49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015. ed. / Michael B. Matthews. IEEE Computer Society, 2016. p. 441-446 7421166 (Conference Record - Asilomar Conference on Signals, Systems and Computers; Vol. 2016-February).

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

Lao, Y & Parhi, KK 2016, Canonic real-valued radix-2n FFT computations. in MB Matthews (ed.), Conference Record of the 49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015., 7421166, Conference Record - Asilomar Conference on Signals, Systems and Computers, vol. 2016-February, IEEE Computer Society, pp. 441-446, 49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015, Pacific Grove, United States, 11/8/15. https://doi.org/10.1109/ACSSC.2015.7421166

@inproceedings{e545c9c1258c474eb751ad9e7ea3ca52,

title = "Canonic real-valued radix-2n FFT computations",

abstract = "Fast Fourier transform (FFT) is an important digital signal processing (DSP) algorithm for analysis of the phase and frequency components of a time-domain signal. Canonic real-valued FFT (RFFT) approach improves the computation performance by completely eliminating arithmetic redundancies. The major advantage of the canonic RFFTs is that these require the least butterfly operations and only involve real datapath when mapped to architectures. In this paper, we study the performances of canonic RFFT computations for different radix factorizations. We compare various radices RFFTs along with their canonic variants from both arithmetic and architectural perspectives. It is shown that decimation-in-frequency (DIF) RFFT structures require less twiddle factor operations than their decimation-in-time (DIT) counterparts. However, we also show that canonic RFFTs may not be desirable when taking the cost of twiddle factor operations as the major consideration.",

author = "Yingjie Lao and Parhi, {Keshab K}",

note = "Publisher Copyright: {\textcopyright} 2015 IEEE.; 49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015 ; Conference date: 08-11-2015 Through 11-11-2015",

year = "2016",

month = feb,

day = "26",

doi = "10.1109/ACSSC.2015.7421166",

language = "English (US)",

series = "Conference Record - Asilomar Conference on Signals, Systems and Computers",

publisher = "IEEE Computer Society",

pages = "441--446",

editor = "Matthews, {Michael B.}",

booktitle = "Conference Record of the 49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015",

}

TY - GEN

T1 - Canonic real-valued radix-2n FFT computations

AU - Lao, Yingjie

AU - Parhi, Keshab K

PY - 2016/2/26

Y1 - 2016/2/26

N2 - Fast Fourier transform (FFT) is an important digital signal processing (DSP) algorithm for analysis of the phase and frequency components of a time-domain signal. Canonic real-valued FFT (RFFT) approach improves the computation performance by completely eliminating arithmetic redundancies. The major advantage of the canonic RFFTs is that these require the least butterfly operations and only involve real datapath when mapped to architectures. In this paper, we study the performances of canonic RFFT computations for different radix factorizations. We compare various radices RFFTs along with their canonic variants from both arithmetic and architectural perspectives. It is shown that decimation-in-frequency (DIF) RFFT structures require less twiddle factor operations than their decimation-in-time (DIT) counterparts. However, we also show that canonic RFFTs may not be desirable when taking the cost of twiddle factor operations as the major consideration.

AB - Fast Fourier transform (FFT) is an important digital signal processing (DSP) algorithm for analysis of the phase and frequency components of a time-domain signal. Canonic real-valued FFT (RFFT) approach improves the computation performance by completely eliminating arithmetic redundancies. The major advantage of the canonic RFFTs is that these require the least butterfly operations and only involve real datapath when mapped to architectures. In this paper, we study the performances of canonic RFFT computations for different radix factorizations. We compare various radices RFFTs along with their canonic variants from both arithmetic and architectural perspectives. It is shown that decimation-in-frequency (DIF) RFFT structures require less twiddle factor operations than their decimation-in-time (DIT) counterparts. However, we also show that canonic RFFTs may not be desirable when taking the cost of twiddle factor operations as the major consideration.

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

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

U2 - 10.1109/ACSSC.2015.7421166

DO - 10.1109/ACSSC.2015.7421166

M3 - Conference contribution

AN - SCOPUS:84969903133

T3 - Conference Record - Asilomar Conference on Signals, Systems and Computers

SP - 441

EP - 446

BT - Conference Record of the 49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015

A2 - Matthews, Michael B.

PB - IEEE Computer Society

T2 - 49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015

Y2 - 8 November 2015 through 11 November 2015

ER -

Canonic real-valued radix-2n FFT computations

Abstract

Publication series

Other

Bibliographical note

Access

OpenUrl availability

Other files and links

Fingerprint

Cite this