Abstract
Digital ladder filter networks may be realized by applying simple transformations to the flow-graph network representation of continuous domain resistively terminated <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">LC</tex> two ports. It is shown that such methods have the disadvantage that there does not exist a transformation with the three requirements that the entire imaginary <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">s</tex> -plane axis map to the <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">z</tex> -plane unit circle, that the resultant discrete network is stable and finally that the resultant discrete network be computationally realizable due to Its freedom from delay free loops. A synthesis technique is proposed for low sensitivity digital ladders. The conventional transformation that is applied to the <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">LC</tex> filter prototype does lead to a stable structure with the required mapping property; the delay free loops are eliminated by straightforward flow-graph manipulation. The coefficient sensitivity of the magnitude transfer function <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">|H(e^{f{\omega}T}|</tex> is low valued throughout the passband.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
