RANK AND DEGREE REDUCTION IN RECIPROCAL N-PORT NETWORK SYNTHESIS
Abstract
Two methods of reducing the rank of an even part matrix were presented. The first reduces the rank only; the second offers the additional feature of degree reduction. The method with only rank reduction was generalized for any nport network. This allows ultimate synthesis by the methods of Gewertz, Bayard, and Oono thus establishing a general synthesis procedure. Although it does establish a realization technique, difficulty is encountered in the excess components and tedious calculations required. These calculations occur when the immttance must be determined from the even part of the immittance function. The higher the degree of the matrix the more involved these calculaions become. The method incorporating degree reduction lessens both of these difficulties. Significantly fewer components are necessary for the synthesis, and the calculations required are much easier to cary out. In this analysis the even part splits with degree reduction were obtained for the 2and 3-port networks. It is felt that this material forms a foundation upon which an n-port decomposition will be based. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- May 01, 1962
- Accession Number
- AD0287875
Entities
People
- Roy D. Joseph
Organizations
- Case Western Reserve University