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 language||English (US)|
|Journal||Proceedings - IEEE International Symposium on Circuits and Systems|
|State||Published - 2003|
|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