Discrete Fourier transform and H/sub infinity / approximation

Wu N.E.; Gu G.

首页> 外文期刊>IEEE Transactions on Automatic Control >Discrete Fourier transform and H/sub infinity / approximation

【24h】

Discrete Fourier transform and H/sub infinity / approximation

机译：离散傅立叶变换和H / sub无限大/逼近

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

It is shown that uniform rational approximation of nonrational transfer functions can always be obtained by means of the discrete Fourier transform (DFT) as long as such approximants exist. Based on this fact, it is permissible to apply the fast Fourier transform (FFT) algorithm in carrying out rational approximations without being apprehensive of convergence. The DFT is used to obtain traditional approximations for transfer functions of infinite-dimensional systems. Justification is provided for using the DFT in such approximations. It is established that whenever a stable transfer function can be approximated uniformly on the right half-plane by a rational function, its approximants can always be recognized by means of a DFT.

机译：结果表明，只要存在这样的近似值，就可以始终通过离散傅里叶变换（DFT）获得非有理传递函数的一致有理逼近。基于这一事实，可以在不担心收敛的情况下，将快速傅里叶变换（FFT）算法应用于有理逼近。 DFT用于获得无穷维系统传递函数的传统近似值。提供了在这种近似中使用DFT的理由。可以确定的是，只要稳定的传递函数可以通过有理函数在右半平面上均匀地近似，就可以始终通过DFT识别其近似值。

著录项

来源
《IEEE Transactions on Automatic Control》 |1990年第9期|P.1044-1046|共3页
作者
Wu N.E.; Gu G.;
展开▼
作者单位

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类自动化系统;
关键词

相似文献

外文文献
中文文献
专利

1. FAST COMPUTATION OF THE MULTIDIMENSIONAL DISCRETE FOURIER TRANSFORM AND DISCRETE BACKWARD FOURIER TRANSFORM ON SPARSE GRIDS [J] . YING JIANG, YUESHENG XU Mathematics of computation . 2014,第289期

机译：稀疏网格上多维离散傅里叶变换和离散向后傅里叶变换的快速计算
2. Inverse Discrete Fourier Transform-Discrete Fourier Transform Techniques for Generating and Receiving Spectrally Efficient Frequency Division Multiplexing Signals | Science Publications [J] . Sahmed Idarwazeh American journal of engineering and applied sciences . 2012,第4期

机译：离散傅立叶逆变换—离散傅立叶逆变换技术，用于产生和接收频谱有效的频分复用信号|科学出版物
3. Realization of Discrete Fourier Transform and Inverse Discrete Fourier Transform on One Single Multimode Interference Coupler [J] . Junhe Zhou Photonics Technology Letters, IEEE . 2011,第5期

机译：单个多模干涉耦合器上离散傅里叶变换和离散傅里叶逆变换的实现
4. Flexible systolic design with asynchronous communication protocols for discrete Fourier transform (DFT) and inverse discrete Fourier transform (IDFT) [C] . Kamran Reihani, New Mexico State Univ., Las Cruces, Advances in Optical Information Processing VI . 1994

机译：灵活的收缩设计与异步通信协议，用于离散傅里叶变换（DFT）和逆离散傅里叶变换（IDFT）
5. VLSI implementation of multidimensional discrete Fourier transform and discrete cosine transform. [D] . Yu, Sungwook. 2000

机译：VLSI实现了多维离散傅里叶变换和离散余弦变换。
6. A Parallel Framework with Block Matrices of a Discrete Fourier Transform for Vector-Valued Discrete-Time Signals [O] . Pablo Soto-Quiros 2015

机译：矢量值离散时间信号的具有离散傅立叶变换的块矩阵的并行框架
7. Peer Review #3 of "Discrete two dimensional Fourier transform in polar coordinates part II: numerical computation and approximation of the continuous transform (v0.1)" [O] . H Feichtinger 2020

机译：Peer Review“Polar坐标的离散二维傅立叶变换”第3部分：连续变换的数值计算和近似（V0.1）“
8. Comparison of Arithmetic Requirements for the PFA (Prime Factor Algorithm), WFTA (Winograd Fourier Transform Algorithm), SWIFT, MFFT (Mixed Radix Fast Fourier Transform), FFT (Fast Fourier Transform) and DFT (Discrete Fourier Transform) Algorithms. [R] . Hicks, R. C. 1982

机译：pFa（素因子算法），WFTa（Winograd傅立叶变换算法），sWIFT，mFFT（混合基线快速傅里叶变换），FFT（快速傅立叶变换）和DFT（离散傅立叶变换）算法的算术要求的比较。

Discrete Fourier transform and H/sub infinity / approximation

摘要

著录项

相似文献

相关主题

期刊订阅