Fast Integer Fourier Transform (FIFT) based on lifting matrices

R. Thamvichai; Tamal Bose; Miloje Radenkovic

Fast Integer Fourier Transform (FIFT) based on lifting matrices

R. Thamvichai
, Tamal Bose
, Miloje Radenkovic

Research output: Contribution to journal › Conference article › peer-review

Abstract

This paper proposes a fast algorithm for computing the approximated DFT, called the Fast Integer Fourier Transform (FIFT). The new transform is based on factorization of the DFT matrix into a product of some specified matrices and lifting matrices. The elements of the lifting matrices are quantized to the nearest binary-number representation. Therefore, the proposed algorithm can be implemented in fixed-point arithmetic using only shifting operations and additions. Any length-2^l DFT sequence for l ≥ 1 can be computed using this algorithm.

Original language	English (US)
Pages (from-to)	IV85-IV88
Journal	Proceedings - IEEE International Symposium on Circuits and Systems
Volume	4
State	Published - 2003
Externally published	Yes
Event	Proceedings of the 2003 IEEE International Symposium on Circuits and Systems - Bangkok, Thailand Duration: May 25 2003 → May 28 2003

ASJC Scopus subject areas

Electrical and Electronic Engineering

Cite this

@article{04db6c9b70d04b94a1acbb35bd775400,

title = "Fast Integer Fourier Transform (FIFT) based on lifting matrices",

abstract = "This paper proposes a fast algorithm for computing the approximated DFT, called the Fast Integer Fourier Transform (FIFT). The new transform is based on factorization of the DFT matrix into a product of some specified matrices and lifting matrices. The elements of the lifting matrices are quantized to the nearest binary-number representation. Therefore, the proposed algorithm can be implemented in fixed-point arithmetic using only shifting operations and additions. Any length-2l DFT sequence for l ≥ 1 can be computed using this algorithm.",

author = "R. Thamvichai and Tamal Bose and Miloje Radenkovic",

year = "2003",

language = "English (US)",

volume = "4",

pages = "IV85--IV88",

journal = "Proceedings - IEEE International Symposium on Circuits and Systems",

issn = "0271-4310",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "Proceedings of the 2003 IEEE International Symposium on Circuits and Systems ; Conference date: 25-05-2003 Through 28-05-2003",

}

TY - JOUR

T1 - Fast Integer Fourier Transform (FIFT) based on lifting matrices

AU - Thamvichai, R.

AU - Bose, Tamal

AU - Radenkovic, Miloje

PY - 2003

Y1 - 2003

N2 - This paper proposes a fast algorithm for computing the approximated DFT, called the Fast Integer Fourier Transform (FIFT). The new transform is based on factorization of the DFT matrix into a product of some specified matrices and lifting matrices. The elements of the lifting matrices are quantized to the nearest binary-number representation. Therefore, the proposed algorithm can be implemented in fixed-point arithmetic using only shifting operations and additions. Any length-2l DFT sequence for l ≥ 1 can be computed using this algorithm.

AB - This paper proposes a fast algorithm for computing the approximated DFT, called the Fast Integer Fourier Transform (FIFT). The new transform is based on factorization of the DFT matrix into a product of some specified matrices and lifting matrices. The elements of the lifting matrices are quantized to the nearest binary-number representation. Therefore, the proposed algorithm can be implemented in fixed-point arithmetic using only shifting operations and additions. Any length-2l DFT sequence for l ≥ 1 can be computed using this algorithm.

UR - https://www.scopus.com/pages/publications/17944394055

UR - https://www.scopus.com/pages/publications/17944394055#tab=citedBy

M3 - Conference article

AN - SCOPUS:17944394055

SN - 0271-4310

VL - 4

SP - IV85-IV88

JO - Proceedings - IEEE International Symposium on Circuits and Systems

JF - Proceedings - IEEE International Symposium on Circuits and Systems

T2 - Proceedings of the 2003 IEEE International Symposium on Circuits and Systems

Y2 - 25 May 2003 through 28 May 2003

ER -

Fast Integer Fourier Transform (FIFT) based on lifting matrices

Abstract

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this