Synthesis of Optimal Ladder Networks.
Abstract
This project treats synthesis procedures for optimal ladder networks. The first part of the project deals with a chain-matrix decomposition technique for realizing two-port LC ladder networks. Two chain-matrix decomposition theorems are proved. These theorems state the necessary and sufficient conditions that must be satisfied by a (2x2) matrix S sub n(s) that is to be decomposed into a product of simple matrices, i.e., S sub n(s) = K sub 1 K sub 2...K sub n. It is found that the zeroes of the adjacent elements of S sub n(s) alternate pairwise along the j(omega) axis in the s-plane. It is also found that if the matrix S sub n(s) is the overall chain matrix of an LC ladder network, then each of the simple matrices K sub i(s) for i = 1,2,...n represents a simple LC ladder section. These decomposition techniques are then applied to the design of filters. Of particular interest are Butterworth, Chebyshev, and Bessel filters with single and double terminations. These filters are designed by the decomposition of chain matrices whose elements are predetermined by the orthogonal polynomials that approximate the ideal filter characteristics.
Document Details
- Document Type
- Technical Report
- Publication Date
- Nov 01, 1978
- Accession Number
- ADA064291
Entities
People
- Tian S. Lim