Fast Integer Fourier Transform (FIFT) based on lifting matrices

R. Thamvichai, Tamal Bose, Miloje Radenkovic

Research output: Contribution to journalConference article

1 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)IV85-IV88
JournalProceedings - IEEE International Symposium on Circuits and Systems
Volume4
StatePublished - Jul 14 2003
Externally publishedYes
EventProceedings of the 2003 IEEE International Symposium on Circuits and Systems - Bangkok, Thailand
Duration: May 25 2003May 28 2003

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Fast Integer Fourier Transform (FIFT) based on lifting matrices'. Together they form a unique fingerprint.

  • Cite this