6. Summary
We have proposed a generalized Y-Δ transformation for linear network model reduction. The proposed algorithms can handle linear resistors, capacitors, self and mutual K elements and independent sources. The algorithm integrated common-factor-cancelation operations that were not seen in the literature. Admittance in reduced circuits has the guaranteed simplest form, without redundant common factors.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2005 Springer Science + Business Media, Inc.
About this chapter
Cite this chapter
(2005). Generalized Y-Δ Transformation — Advance Topics. In: Symbolic Analysis and Reduction of VLSI Circuits. Springer, Boston, MA. https://doi.org/10.1007/0-387-23905-7_5
Download citation
DOI: https://doi.org/10.1007/0-387-23905-7_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-23904-0
Online ISBN: 978-0-387-23905-7
eBook Packages: EngineeringEngineering (R0)