{"title":"频域非线性系统维纳核的快速估计","authors":"M. A. Shcherbakov","doi":"10.1109/HOST.1997.613499","DOIUrl":null,"url":null,"abstract":"A method for identification of discrete nonlinear systems in terms of the Volterra-Wiener series is presented. It is shown that use of a special composite-frequency input signal as an approximation to Gaussian noise provides the computational efficiency of this method especially for high order kernels. Orthogonal functionals and consistent estimates for Wiener kernels in the frequency domain are derived for this class of noise input. The basis of the proposed computational procedure for practical identification is the fast Fourier transform (FFT) algorithm which is used both for generation of actions and for analysis of system reactions.","PeriodicalId":305928,"journal":{"name":"Proceedings of the IEEE Signal Processing Workshop on Higher-Order Statistics","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Fast estimation of Wiener kernels of nonlinear systems in the frequency domain\",\"authors\":\"M. A. Shcherbakov\",\"doi\":\"10.1109/HOST.1997.613499\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A method for identification of discrete nonlinear systems in terms of the Volterra-Wiener series is presented. It is shown that use of a special composite-frequency input signal as an approximation to Gaussian noise provides the computational efficiency of this method especially for high order kernels. Orthogonal functionals and consistent estimates for Wiener kernels in the frequency domain are derived for this class of noise input. The basis of the proposed computational procedure for practical identification is the fast Fourier transform (FFT) algorithm which is used both for generation of actions and for analysis of system reactions.\",\"PeriodicalId\":305928,\"journal\":{\"name\":\"Proceedings of the IEEE Signal Processing Workshop on Higher-Order Statistics\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-07-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the IEEE Signal Processing Workshop on Higher-Order Statistics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HOST.1997.613499\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the IEEE Signal Processing Workshop on Higher-Order Statistics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HOST.1997.613499","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Fast estimation of Wiener kernels of nonlinear systems in the frequency domain
A method for identification of discrete nonlinear systems in terms of the Volterra-Wiener series is presented. It is shown that use of a special composite-frequency input signal as an approximation to Gaussian noise provides the computational efficiency of this method especially for high order kernels. Orthogonal functionals and consistent estimates for Wiener kernels in the frequency domain are derived for this class of noise input. The basis of the proposed computational procedure for practical identification is the fast Fourier transform (FFT) algorithm which is used both for generation of actions and for analysis of system reactions.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
