Proceedings of the IEEK Conference (대한전자공학회:학술대회논문집)
- 2003.11a
- /
- Pages.473-476
- /
- 2003
Two dimensional FFT by Polynomial Transform
Polynomial 변환을 이용한 고속 2 차원 FFT
Abstract
We suggest 2 dimensional Fast Fourier Transform using Polynomial Transform and integer Fast Fourier Transform. Unlike conventional 2D-FFT using the direct quantization of twiddle factor, the suggested 2D-FFT adopts implemented by the lifting so that the suggested 2D-FFT is power adaptable and reversible. Since the suggested FFT performg integer-to-integer mapping, the transform can be implemented by only bit shifts and auditions without multiplications. In addition. polynomial transform severely reduces the multiplications of 2D-FFT. While preserving the reversibility, complexity of this algorithm is shown to be much lower than that of any other algorithms in terms of the numbers of additions and shifts.
Keywords