IDENTIFICATION OF LINEAR SAMPLED DATA SYSTEMS BY TRANSFORM TECHNIQUES

被引：2

作者：

BUTCHER, WE

COOK, GE

机构：

[1] Dept. of Elec. Engrg., Vanderbilt University, Nashville, Tenn.

来源：

IEEE TRANSACTIONS ON AUTOMATIC CONTROL | 1969年 / AC14卷 / 05期

关键词：

D O I：

10.1109/TAC.1969.1099266

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

A technique for application of the popular fast Fourier transform (FFT) to the system identification problem is outlined. Smoothing is obtained inherently in the transform and additionally by redundancy in the data. An iterative technique is discussed for the case of nonzero initial conditions and to avoid problems due to the circular nature of convolutions cosaputed by the discrete Fourier transform (DFT). Copyright © 1970 by The Institute of Eiectrical and Electronics Engineers, Inc.

引用

页码：582 / +

页数：1

共 7 条

[1] WHAT IS FAST FOURIER TRANSFORM [J].

COCHRAN, WT ;

COOLEY, JW ;

FAVIN, DL ;

HELMS, HD ;

KAENEL, RA ;

LANG, WW ;

MALING, GC ;

NELSON, DE ;

RADER, CM ;

WELCH, PD .

PROCEEDINGS OF THE INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS, 1967, 55 (10) :1664-+

[2] APPLICATION OF FAST FOURIER TRANSFORM TO COMPUTATION OF FOURIER INTEGRALS FOURIER SERIES AND CONVOLUTION INTEGRALS [J].

COOLEY, JW ;

LEWIS, PAW ;

WELCH, PD .

IEEE TRANSACTIONS ON AUDIO AND ELECTROACOUSTICS, 1967, AU15 (02) :79-+

[3] AN ALGORITHM FOR MACHINE CALCULATION OF COMPLEX FOURIER SERIES [J].

COOLEY, JW ;

TUKEY, JW .

MATHEMATICS OF COMPUTATION, 1965, 19 (90) :297-&

[4] FAST FOURIER TRANSFORM METHOD OF COMPUTING DIFFERENCE EQUATIONS AND SIMULATING FILTERS [J].

HELMS, HD .

IEEE TRANSACTIONS ON AUDIO AND ELECTROACOUSTICS, 1967, AU15 (02) :85-+

[5]

LANCZOS C, 1964, SIAM J B, V1, P76

[6]

Lanczos C, 1956, APPLIED ANALYSIS, P331

[7]

Levin M. J., 1960, IRE T CIRCUIT THEORY, V7, P50, DOI DOI 10.1109/TCT.1960.1086622

← 1 →