### 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 - Jul 14 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

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

## Cite this

Thamvichai, R., Bose, T., & Radenkovic, M. (2003). Fast Integer Fourier Transform (FIFT) based on lifting matrices.

*Proceedings - IEEE International Symposium on Circuits and Systems*,*4*, IV85-IV88.