z-logo
Premium
Error correction for phase detection by recursive algorithm real time DFT
Author(s) -
Funaki Tsuyoshi,
Matsuura Kenji,
Tanaka Shunsuke
Publication year - 2002
Publication title -
electrical engineering in japan
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.136
H-Index - 28
eISSN - 1520-6416
pISSN - 0424-7760
DOI - 10.1002/eej.10036
Subject(s) - correctness , algorithm , computer science , discrete fourier transform (general) , reset (finance) , error detection and correction , phase (matter) , waveform , microprocessor , fourier transform , mathematics , fourier analysis , mathematical analysis , radar , chemistry , telecommunications , organic chemistry , fractional fourier transform , financial economics , economics , computer hardware
Discrete Fourier Transform (DFT) can calculate the phase and amplitude of the AC waveform directly from the sampled data. However, high performance microprocessor is inevitable to implement DFT into real time system, especially when conventional calculation algorithm is applied to high frequency sampling. Applying recursive algorithm to the DFT can drastically reduce the calculation amount. This paper studies about the phase detection error of DFT when recursive algorithm is applied. The proposed error correction method makes it possible to guarantee the correctness of detected phase, which is equivalent to the conventional DFT calculation algorithm. Also, this paper proposes the reset scheme of numerical error accumulation, which is unavoidable for the recursive algorithm applied DFT. The proposed method can guarantee high accuracy with minimum increment of calculation amount. The qualitative correctness estimated from the theoretical equations is confirmed through quantitative study by digital simulation. © 2002 Wiley Periodicals, Inc. Electr Eng Jpn, 141(1): 8–17, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/eej.10036

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here