By Topic

A unifying approach to electrical network analysis based on a complete model

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
G. Acciani ; Dept. of Electron. & Electr., Bari Univ., Italy ; G. Cafaro ; B. Dilecce ; F. Vacca

The problem of defining and building a model of an electrical network is considered. The whole electrical network, called the active network, is considered to be a pair of interacting but autonomous structures: the nonenergized or `dead' network, which is associated with passive, zero-state elements and the excitation, which represents external input and/or initial conditions. Axiomatic definitions are given for both the dead network and the excitation and, starting from these definitions, the topological structures of both the excitation and the dead network are drawn and discussed. A general topological reference frame is described, and a procedure is given for obtaining it on the basis of the graphs associated with the active network as well as with the dead network. Starting from this topological reference frame, a network model is set up, which is said to be complete (not reduced) as it consists of as many equations as there are passive elements in the active network. Finally, it is shown how a complete model contains, as special cases, all the models usually employed in the so-called traditional methods of network analysis (nodal, cut-set, mesh, and loop)

Published in:

IEEE Transactions on Education  (Volume:32 ,  Issue: 3 )