Computing the DFT in a Ring of Algebraic Integers

대수적 정수 환에 의한 이산 푸릴에 변환의 계산

In this paper, we propose a multiplication-free DFT kernel computation technique, whose input sequences are approximated into a ring of Algebraic Integers. This paper also gives computational examples for DFT and IDFT. And we proposes an architecture of the DFT using barrel shifts and adds. When the radix is greater than 4, the proposed method has a high Precision property without scaling errors due to twiddle factor multiplication. A possibility of higher radix system assumes that higher performance can be achievable for reducing the DFT stages in FFT.