The Discrete Fourier Transform Using the Complex Approximations of the Ring of Algebraic Integer

복소수의 대수적 정수환 근사화를 이용한 이산 후리에 변환

This paper presents a multiplier free technique for the complex DFT by rotations and additions based on the complex approximation of the ring of algebraic integers. Speeding-up the computation time and reducing the dynamic range growth has been achieved by the elimination of multiplication. Moreover the DFT of no twiddle factor quantization errors is possible. Numerical examples are given to prove the algorithm and the applicable size of the DFT is 16 has been concluded.