Muutke küpsiste eelistusi

Network Analysis and Circuits [Kõva köide]

  • Formaat: Hardback, 780 pages, kõrgus x laius: 229x178 mm, Contains 1 Hardback and 1 CD-ROM
  • Sari: Engineering
  • Ilmumisaeg: 16-May-2008
  • Kirjastus: Infinity Science Press
  • ISBN-10: 1934015199
  • ISBN-13: 9781934015193
Teised raamatud teemal:
  • Kõva köide
  • Hind: 96,39 €*
  • * saadame teile pakkumise kasutatud raamatule, mille hind võib erineda kodulehel olevast hinnast
  • See raamat on trükist otsas, kuid me saadame teile pakkumise kasutatud raamatule.
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Lisa soovinimekirja
Network Analysis and CircuitsSuurem pilt
  • Formaat: Hardback, 780 pages, kõrgus x laius: 229x178 mm, Contains 1 Hardback and 1 CD-ROM
  • Sari: Engineering
  • Ilmumisaeg: 16-May-2008
  • Kirjastus: Infinity Science Press
  • ISBN-10: 1934015199
  • ISBN-13: 9781934015193
Teised raamatud teemal:
Püsilink: https://www.kriso.ee/db/9781934015193.html
Märksõnad:
This textbook on electronic circuit analysis has been designed for both engineering students and practitioners in the field, and includes hundreds of practical mathematical problems commonly addressed in these environments. Arshad (Ajay Kumar Garg Engineering College) emphasizes a self-study format in covering such topics as graph theory, network theorems, wave form synthesis, filters and Laplace transforms. A CD-ROM is included to improve problem-solving skills on a visual plane. Annotation ©2008 Book News, Inc., Portland, OR (booknews.com)
Introduction
1(38)
What is a Network?
1(3)
Systems
4(2)
Electrical Energy Sources
6(1)
Dependent Source or Controlled Source
6(2)
Kirchhoff's Voltage Law (KVL)
8(1)
Kirchhoff's Current Law (KCL)
9(1)
Mesh Analysis
10(3)
Nodal Analysis
13(1)
Passive Elements
14(5)
Current Division Formula
19(2)
Voltage Division Formula for Two Resistors
21(2)
Power and RMS Values
23(16)
Kirchhoff's Laws and Their Applications
39(34)
Introduction
39(3)
Branch Current Method
42(31)
Graph Theory
73(264)
Introduction
73(1)
Rules for Drawing a Graph
73(1)
Some Useful Definitions
74(5)
Complete Incidence Matrix (Ac)
79(2)
Drawing a Graph from an Incidence Matrix
81(1)
Drawing a Graph from a Reduced Incidence Matrix
82(1)
Kirchoff's Current Law (KCL)
82(1)
Fundamental Loops (Tie-Sets) of a Graph
83(3)
Cut-Set
86(5)
Fundamental Cut-Sets or F-Cut-Sets
91(3)
Nodal Analysis Based on Graph Theory
94(1)
Loop Analysis Based on Graph Theory
95(242)
The Laplace Transform
337
Introduction
137(1)
Laplace Transform of Some Commonly Used Functions
137(4)
Basic Laplace Transform Theorem
141(2)
Laplace Transform of Some Other Functions
143(2)
Initial Value Theorem
145(1)
Final Value Theorem
145(1)
Inverse Laplace Transformation
145(28)
Basic Signals and Waveform Synthesis
173(44)
Introduction
173(1)
Step Function
173(6)
Ramp Function
179(3)
Parabolic Function
182(1)
Impulse Function or Dirac Delta Function
183(2)
Exponential Function
185(1)
Sinusoidal Signal
186(1)
Relation Between Parabolic, Ramp, Unit Step, and Impulse Functions
187(1)
Synthesis of General Waveforms
187(30)
Circuit Analysis by the Classical Method
217(38)
Introduction
217(2)
Linear Differential Equations
219(2)
Determination of the Complementary Function (C.F.)
221(2)
Determination of the Particular Integral (P.I.)
223(2)
Initial Conditions in Circuits
225(2)
Transient Response of Series RL Circuit Having D.C. Excitation
227(3)
Transient Response of Series RC Circuit Having D.C. Excitation
230(3)
Transient Response of Series RLC Circuit Having D.C. Excitation
233(22)
Applications of the Laplace Transform
255(42)
Introduction
255(1)
Solution of Linear Differential Equations
255(2)
Transformed Circuit Components Representation
257(40)
Network Theorems
297(102)
Introduction to Network Theorems
297(1)
Millman's Theorem
297(7)
Superposition Theorem
304(9)
Thevenin's Theorem
313(5)
Norton's Theorem
318(12)
Millman's Theorem Revisited
330(2)
Maximum Power Transfer Theorem
332(5)
Δ-Y and Y-Δ Conversions
337(6)
Compensation Theorem
343(6)
Tellegen's Theorem
349(6)
Reciprocity Theorem
355(44)
Network Functions; Poles and Zeros
399(60)
Introduction
399(1)
Network Functions for a One-Port Network
400(1)
Network Functions for a Two-Port Network
401(8)
Network Functions as a Quotient of Polynomials in S
409(1)
Poles and Zeros of Network Functions
410(3)
Significance of Poles and Zeros in Network Functions
413(1)
Restrictions on Locations of Poles and Zeros in Driving-Point Functions
414(9)
Restrictions on Locations of Poles and Zeros for Transfer Functions
423(7)
Time-Domain Response from Pole and Zero Plots
430(8)
Routh Criterion
438(21)
Two-Port Networks
459(108)
Introduction
459(1)
Open Circuit Impedance or [ Z] Parameters
460(3)
Short Circuit Admittance or [ Y] Parameters
463(3)
ABCD or Transmission Parameters
466(4)
Hybrid or h-Parameters
470(2)
Inverse Hybrid (or G) Parameters
472(4)
Inter-Relationship of Parameters
476(13)
Condition for Reciprocity
489(3)
Condition for Symmetry
492(4)
Interconnections of Two-Port Networks
496(12)
Lattice Networks
508(4)
Image Parameters
512(55)
Network Synthesis
567(68)
Introduction
567(1)
Analysis and Design
567(1)
Elements of the Realizability Theory
568(1)
Hurwitz Polynomial
568(2)
Procedure for Obtaining the Continued Fraction Expansion
570(7)
Positive Real Functions
577(4)
Synthesis of One-Port Networks with Two Elements (R, L, C)
581(14)
LC Immittance Function or LC Network Synthesis
595(2)
RC Impedance or RL Admittance Function
597(2)
RL Impedance or RC Admittance Function
599(36)
Resonance and Selectivity
635(36)
Introduction
635(1)
Series Resonance
635(5)
Phasor Diagram of Series RLC Circuit
640(3)
Reactance and Impedance Curves of a Series RLC Circuit
643(1)
Vibration of Current and Voltages with Frequency in a Series RLC Circuit
644(3)
Selectivity and Bandwidth
647(2)
Quality Factor or Q-Factor
649(3)
Series Resonance and Selectivity of Series RLC Circuit with Frequency Variable
652(5)
Selectivity or Series RLC Circuit with a Capacitance Variable
657(2)
Selectivity of Series RLC Circuit with an L Variable
659(2)
Parallel Resonance
661(2)
Impedance of Parallel-Tuned Circuit
663(4)
Selectivity and Bandwidth of a Parallel-Tuned Circuit
667(4)
Filters
671(56)
Introduction
671(1)
Parameters of a Filter
671(1)
Decibel and Neper
672(1)
Propagation Constant
673(2)
Classification of Filters
675(2)
Basic Filter Networks
677(5)
Cut-Off Frequencies
682(2)
Constant-K Filters
684(19)
m-Derived Filters
703(11)
m-Derived Band-Pass Filter
714(13)
Fourier Analysis
727(48)
Introduction
727(1)
Periodic Functions
727(1)
Even and Odd Functions
728(3)
Fourier Series
731(1)
Alternative Forms of Fourier Series
732(1)
Useful Integrals in Fourier Series
733(1)
Evaluation of Fourier Series Constants
734(3)
Fourier Series Constants for Period (0+0.2π)
737(1)
Limits of Integration per Time Period
737(1)
Fourier Constants in Terms of Even and Odd Functions
738(1)
Waveform Symmetries
738(8)
Use of Fourier Series
746(29)
Appendix A. Selected Answers to Exercises 775(2)
Appendix B. About the CD-ROM 777(2)
Index 779