Integer discrete Fourier transform and its extension to integer trigonometric transforms
Resource
Circuits and Systems, 2000. Proceedings. ISCAS 2000 Geneva. The 2000 IEEE International Symposium on
Journal
The IEEE International Symposium on Circuits and Systems, ISCAS 2000 Geneva
Pages
-
Date Issued
2000-05
Date
2000-05
Author(s)
DOI
N/A
Abstract
DFT has good quality of performance and fast algorithms. But when we implement the DFT, we require the floating-point multiplication. In this paper, we introduce the integer Fourier transform (ITFT). ITFT is approximated to the DFT, but all the entries in the transform matrix are integer numbers. So it only requires fixed-point multiplication, and the implementation can be much simplified, especially for VLSI. This new transform will work similarly to the original DFT, for example, the transform results are similar and the shifting-invariant property is also preserved for ITFT. We also introduce the general method to derive the integer transform. By this approach, we can derive many types of integer transforms (such as integer cosine, sine, and Hartley transforms).
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
00857484.pdf
Size
364.56 KB
Format
Adobe PDF
Checksum
(MD5):5c230cb3e0fd958414d1acb6b6a60d64