递推快速付立叶变换在系统辨识中的应用
The Application of Recursive Fast Fourier Transformation(RFFT) to System Identification
-
摘要: RFFT（Recursive FastFourier Transformation）是一种基于快速付立叶变换的递推算法．由于输入数据的数目和递推次数可任意选择，因此本算法具有很大的灵活性，适用于时变系统和自适应控制系统的在线辨识．本文介绍了采用RFFT算法的微计算机辨识系统并给出了实验结果．Abstract: RFFT is a recursive algorithm based on Fast Fourier Transformation.Because ofthe arbitrary choice of the section of input sequence and the times of recursion,thismethod is more flexible and useful in time-varying spectrum analysis and on-lineidentification of self-adaptive control system.A microcomputer system with RFFT algorithm for identification is given in this paper.
下载:
