Broadband matching : theory and implementations / Wai-Kai Chen, University of Illinois, Chicago, USA.

Earlier edition: The theory and design of broadband matching networks / by Wai-kai Chen. 1976.

Includes bibliographical references and index.

Print version record.

Preface to the 3rd Edition; Preface to the 2nd Edition; Preface to the 1st Edition; Chapter 1. Foundations of Network Theory; 1. Basic network postulates; 1.1. Real-time function postulate; 1.2. Time-invariance postulate; 1.3. Linearity postulate; 1.4. Passivity postulate; 1.5. Causality postulate; 1.6. Reciprocity postulate; 2. Matrix characterizations of n-port networks; 2.1. The impedance matrix; 2.2. The admittance matrix; 2.3. The hybrid matrix; 2.4. The indefinite-admittance matrix; 3. Power gains; 4. Hermitian forms; 5. The positive-real matrix

6. Frequency-domain conditions for passivity7. Conclusions; Problems; References; Chapter 2. The Scattering Matrix; 1. A brief review of the transmission-line theory; 2. The scattering parameters of a one-port network; 2.1. Basis-dependent reflection coefficients; 2.2. Basis-independent reflection coefficient; 2.3. The factorization of the para-hermitian part of z(s); 2.4. Alternative representation of the basis-independent reflection coefficient; 2.5. The normalized reflection coefficient and passivity; 3. The scattering matrix of an n-port network; 3.1. Basis-dependent scattering matrices

3.2. Basis-independent scattering matrix3.3. The scattering matrices and the augmented n-port networks; 3.4. Alternative representation of the basis-independent scattering matrix; 3.5. Physical interpretation of the normalized scattering parameters; 3.6. The normalized scattering matrix and passivity; 3.7. The normalized scattering parameters of a lossless two-port network; 4. The bounded-real scattering matrix; 5. Interconnection of multi-port networks; 6. Conclusions; Problems; References; Chapter 3. Approximation and Ladder Realization; 1. The Butterworth response

1.1. Poles of the Butterworth function1.2. Coefficients of the Butterworth polynomials; 1.3. Butterworth networks; 1.4. Butterworth LC ladder networks; 2. The Chebyshev response; 2.1. Chebyshev polynomials; 2.2. Equiripple characteristic; 2.3. Poles of the Chebyshev function; 2.4. Coefficients of the polynomial p(y); 2.5. Chebyshev networks; 2.6. Chebyshev LC ladder networks; 3. Elliptic functions; 3.1. Jacobian elliptic functions; 3.2. Jacobi's imaginary transformations; 3.3. Periods of elliptic functions; 3.3.1. The real periods; 3.3.2. The imaginary periods

"The third edition presents a unified, up-to-date and detailed account of broadband matching theory and its applications to the design of broadband matching networks and amplifiers. A special feature is the addition of results that are of direct practical value. They are design curves, tables and explicit formulas for designing networks having Butterworth, Chebyshev or elliptic, Bessel or maximally flat group-delay response. These results are extremely useful as the design procedures can be reduced to simple arithmetic. Two case studies towards the end of the book are intended to demonstrate the applications to the practical design of modern filter circuits."-- Provided by publisher

eBooks on EBSCOhost EBSCO eBook Subscription Academic Collection - Worldwide