IRE Transactions on Circuit Theory · 1960 · 39 citations · 3 references
EngineeringElectrical EngineeringCircuit TheoryDifferential EquationsFinite Element AnalysisMicrowave Network AnalysisNorton Equivalent CircuitsEquivalent Series InductanceInductance CalculationLadder SystemsReactance Theory
A Japanese paper published by H. Takahasi in 1951 gives formulas for element values of ladder networks with Tchebycheff characteristics. For a resistance-terminated low-pass ladder with a series inductance as the first reactance, these formulas are given by <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">L_1= \frac{R_{1} s_{1}}{(k-k^{-1}) - (h - h^{-1})}</tex> <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">K_{r,r+1}=\frac{s_{2r-1}s_{2r+1}}{b_r} (r = 1, 2, \cdots , n-1 )</tex> where <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">R_1</tex> , is the input resistance and <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">K_{r,r+1}= L_{r} C_{r+1}</tex> if <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">r</tex> is odd; <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">C_{r}L_{r+1}</tex> if <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">r</tex> is even. <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">b_r = \xi^{2} - c{2r}\xi \eta + \eta^{2} + s_{2r}^2</tex> <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">s_r = 2 \sin \frac{\pi r}{2n}</tex> <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">c_r = 2 \cos \frac{\pi r}{2n}</tex> <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">\xi = k - k^{-1}</tex> <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">\eta = h - h^{-1}</tex> The positive constants <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">k</tex> and <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">h</tex> are related to the zeros and poles of the squared magnitude of the reflection coefficient <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">|\rho (j \omega )|^{2}</tex> ; more specifically, the poles are <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">\alpha_{2m+1}= k \epsilon^{2m+1} + k^{-1} \epsilon^{-(2m+1)}</tex> for <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">m = 0, 1, 2, \cdots , 2n - 1</tex> and <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">\epsilon = e^{\frac{j \pi}{2n}}</tex> , and the zeros are <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">\beta_{2m+1}= h \epsilon^{2m+1} + h^{-1} \epsilon^{-(2m+1)}</tex> for <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">m = 0, 1,2, \cdots , 2n -1</tex> . The final reactance can also be related to the output resistance RP so that the elements can be determined by starting from either the first or last element: <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">L_n = \frac{R_{2} s_{1}}{(k-k^{-1})+(h-h^{-1})}</tex> if <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</tex> is odd <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">C_n = \frac{ s_{1}}{R_{2}[(k-k^{-1})+(h-h^{-1})]}</tex> if <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</tex> is even The formulas for the Butterworth characteristic are derived from those for the Tehebycheff characteristic by a limiting process. A proof is also furnished by Takahasi. These results, which have been previously unknown to most network theorists, anticipate the work of many authors in the field. In the present paper Takahasi's results are given and his concise proof is expanded so that its potential application to presently unsolved problems may be more easily investigated.
3