时延网络的奥布列什科夫逼近
OBRESCHKOFF APPROXIMATION FOR RETARDATION NETWORK
-
摘要: 本文用奥布列什科夫公式来逼近时延网络,给出了解析式以及与贝塞尔逼近间的关系,并对其逼近性质和频域、时域特性作了分析,表明时延网络用奥布列什科夫逼近比用贝塞尔逼近具有更好的逼近效果。最后用实例说明。
-
关键词:
Abstract: The Obreschkoff approximation for a retardation network is carried out. Some analytic formulas of the Obreschkoff approximation and the relationship between these formulas and those of the Bessel approximation are also given. The characteristic, the frequency response and the time response of the Obreschkoff approximation are ana-lyzed. The results obtained show that the Obreschkoff approximation is more accurate than the Bessel approximation for a retardation network. In the end, a typical example is given to varify the above conclusion. -
А.Н.Хованский著,叶乃膺译,连分式及其推广在近似分析问题上的应用,科学出版社,1962.[2]A. H. Marshak, D. E. Johnson and J. R. Johnson, IEEE Trans. on CAS, CAS-21(1974), 797.[3]D. E. Johnson, J. R. Johnson and A. Eskandar, ibid, CAS-22 (1975), 645.[4]D. E. Johnson著,颜绍书等译,滤波器理论导论,人民邮电出版社,1981.[5]周承联,综合法滤波器的理论与计算,人民邮电出版社,1979. -
计量
- 文章访问数: 1554
- HTML全文浏览量: 89
- PDF下载量: 332
- 被引次数: 0
下载:
