摘要:

AbstractCombinatorial necessary and sufficient conditions for the unique solvability of linear networks containingn‐ports are well known for the ‘general’ case. They are onlynecessaryif relations amongn‐port parameters are also taken into consideration.In the present paper combinatorialsufficientconditions are presented for linear networks containingRLCelements and memoryless 2‐ports. The somewhat surprising result is proved that whether a 2‐port can cause certain types of singularities can be predicted before the interconnection.A concept, similar to the normal tree (which intersects ideal transformers by one, gyrators by two or no edges) is introduced for arbitrary 2‐ports. Its existence implies unique solvability.Relations to previous results and algorithmical aspects are a

ISSN:0098-9886    

DOI:10.1002/cta.4490080203

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1980

数据来源: WILEY

摘要:

AbstractIn the context of solution to the sparse systems of equations arising in computer‐aided analysis and design of electrical networks using the Gaussian elimination (GE) process it is well‐known that ana priorireordering for equations and unknowns is almost mandatory. In this paper we present a new approach fora prioriordering for the equations and unknowns using the theory of output sets. Our approach yields an ordered output set as the pivot sequence for an associated GE process. Our algorithm is simple and is more general than the existing ones and leads to ans‐minimal GE process. An example is presented for illustrating the algorithm and the computational complexity of the new method has been analysed. Additional work needed in the area is indi

ISSN:0098-9886    

DOI:10.1002/cta.4490080204

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1980

数据来源: WILEY

摘要:

AbstractA synthesis method is presented for the class of low‐pass prototype filters having an equiripple passband response with a single transmission zero at infinity and the remainder at a finite real frequency. To synthesize the network, the even mode or the odd mode is obtained directly using the alternating pole technique and little accuracy is lost for networks up to degree 19. Tables of element values for commonly used specifications are included. Finally, the practical advantages of this prototype when used to design certain classes of filters are discusse

ISSN:0098-9886    

DOI:10.1002/cta.4490080205

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1980

数据来源: WILEY

摘要:

AbstractA major component in the process of design is synthesis, the determination of the parameters of the parts of a network given desiderata for the behaviour of the network as a whole. Traditional automated synthesis techniques are either restricted to small, precisely defined classes of circuit functions for which exact mathematical methods exist or they depend upon numerical optimization methods in which it is difficult to determine the basis for any of the answers generated and their relations to the design desiderata and constraints. We are developing a symbolic computer‐aided design tool, SYN, which can be of assistance to an engineer in the synthesis of a large class of circuits. The symbolic methods produce solutions which are clear and insightful. The dependence of each parameter on the individual design desiderata and circuit constraints can be easily trace

ISSN:0098-9886    

DOI:10.1002/cta.4490080206

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1980

数据来源: WILEY

摘要:

AbstractAn analytic synthesis technique is developed for symmetrical dual mode in‐line prototype networks up to and including degree 12 networks. Due to the symmetrical realization, the even mode coupling matrix completely defines the network and one particular form representing the double cross‐coupled array, may be obtained directly from the transfer function. Commencing with this matrix, rotational transformation are used to transform the even mode matrix into the form required for a dual mode in line structure. Analytical solutions are obtained for degrees up to and including 12 and the necessary realizability conditions are determined for each case. Explicit formulas for the angles of rotation are given and for degrees up to and including 10, a complete set of explicit formulas are provided for the final coupling matrix. To assist in the design of the in‐line structure, tables of element values for filters having 20 dB and 26 dB return loss and possessing the minimum number of transmission zeros at infinity are tabu

ISSN:0098-9886    

DOI:10.1002/cta.4490080207

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1980

数据来源: WILEY

摘要:

AbstractA very quick and simple algorithm for the overall evaluation of the sensitivity performance of a digital filter is introduced.To this end, it is shown that the sensitivity of the system function with respect to a given coefficient comes out equal to the output of a special digital network with unitary input. Having defined, then, an ‘overall sensitivity index’ as the sum of the various network sensitivities, it is shown that such an index can still be considered as the output of a digital network with unitary input. This network is composed of two subnetworks, identical to the original circuit, connected by a special set of branc

ISSN:0098-9886    

DOI:10.1002/cta.4490080208

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1980

数据来源: WILEY

摘要:

AbstractThe purpose of this paper is to provide a general approach for the problems of analysis and synthesis of probabilistic communication networks. The flows in the branches of a network may be interdependent random variables having any arbitrary distribution.A simple technique, based on the theory of best linear prediction, enables Monte Carlo simulation of such a network. The simulation results suggest that the distribution of the maximum flow (that can be established in the network) can be approximated by a normal distribution despite the inapplicability of the central limit theorem. The results of Monte Carlo simulation are consistent with those obtained through an alternative analytical procedure.The synthesis problem considered in this paper is that of finding the branch capacities of a network so that a given demand for flow (specified in terms of its mean and variance), between a pair of vertices of interest, is satisfied. A direct search method (to find out the optimal branch capacity vector) enables simultaneous consideration of the first two moments of the maximum flow as against the existing ones which consider only the first moment.

ISSN:0098-9886    

DOI:10.1002/cta.4490080209

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1980

数据来源: WILEY

ISSN:0098-9886    

DOI:10.1002/cta.4490080210

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1980

数据来源: WILEY

ISSN:0098-9886    

DOI:10.1002/cta.4490080211

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1980

数据来源: WILEY

ISSN:0098-9886    

DOI:10.1002/cta.4490080212

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1980

数据来源: WILEY