论文部分内容阅读
RFFT(Recursive Fast Fourier Transformation)是一种基于快速付立叶变换的递推算法。由于输入数据的数目和递推次数可任意选择,因此本算法具有很大的灵活性,适用于时变系统和自适应控制系统的在线辨识。本文介绍了采用 RFFT 算法的微计算机辨识系统并给出了实验结果。
RFFT (Recursive Fast Fourier Transformation) is a recursive algorithm based on fast Fourier transform. Due to the number of input data and the number of recursion can be arbitrarily selected, so the algorithm has great flexibility, suitable for online identification of time-varying systems and adaptive control systems. This paper introduces the micro-computer identification system using RFFT algorithm and gives the experimental results.