PRINCIPLES OF DESIGNING DISTRIBUTED NETWORKS
Abstract
The synthesis of distributed networks is described with prescribed characteristics along with the method of approximation of their characteristics. The networks consist only of cascade and parallel connections of distributed elements of equal lengths. In such networks with elements of equal lengths, similar treatment as in lumped networks would be possible with lambda = j tan(Pi f/2 f sub o) as a variable. But here some special features are encountered with, which are very different from those in lumped networks; i. e., lambda = !1 will be transmission zeros. As for network configuration, use of close-coupled coils and series elements should be avoided. In spite of such restrictions on construction, an important conclusion was obtained, that a transmission function is always realizable which has transmission zeros only on the imaginary axis and at !1 on the complex lambda- plane. The proof is presented, accompanied by the manners of construction, approximation of a characteristic with functions having poles at lambda = !1, especially procedures to obtain Tchebycheff characteristics and several design examples. Some citation is also made on the construction of 2-terminal distributed networks.
Document Details
- Document Type
- Technical Report
- Publication Date
- Oct 10, 1962
- Accession Number
- AD0296219
Entities
People
- Akio Matsumoto
- Nobuichi Ikeno
Organizations
- New York University Tandon School of Engineering