Premium
A CAD model of generalized high‐pass filter with transmission zeroes using Chebyshev polynomials for RF application
Author(s) -
Chandra P.,
Biswas A.
Publication year - 2006
Publication title -
international journal of rf and microwave computer‐aided engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.335
H-Index - 39
eISSN - 1099-047X
pISSN - 1096-4290
DOI - 10.1002/mmce.20120
Subject(s) - chebyshev filter , coupling (piping) , matrix (chemical analysis) , recursion (computer science) , mathematics , filter (signal processing) , reflection (computer programming) , microwave , chebyshev polynomials , network synthesis filters , transfer function , algorithm , topology (electrical circuits) , computer science , electronic engineering , mathematical analysis , materials science , engineering , telecommunications , electrical engineering , combinatorics , metallurgy , composite material , computer vision , programming language
A simple recursion technique is introduced for the fast generation of high‐pass transfer‐ and reflection‐function polynomials for a generalized Chebyshev filter. Even‐ or odd‐degree characteristics with symmetrically or asymmetricaly prescribed attenuation poles and group‐delay equalization pairs may be generated using this recursive method, from which a normalized coupling matrix may be synthesized for a singly terminated network, followed by its reduction into folded form, which can then be used to realize high‐pass filter in RF technology. Denormalization of the coupling matrix enables us to obtain an actual coupling matrix, which will have elements representing the coupling coefficients between resonators. This technique can be used in the design of high‐pass filters for high‐frequency applications. © 2005 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2006.