Computer Aided Design Of Networks Research Articles

Computer-Aided Optimization of Transistor Model Parameters

Coputer-aided adjustment of model parameter values to optimally match measured transistor data is described. The presentation is tutorial for student designers of semiconductor circuits who are not familiar with recent developments in the area of computer-aided network design. An illustrative program for the optimization of a bipolar transistor incremental model is described and demonstrated.

CANDSN: A Computer Aided Network Design and Adjustment System

Program CANDSN was developed at The University of Calgary for designing, adjusting and analyzing horizontal survey networks. The concepts and mathematics that this program is based upon are discussed in this paper. The role of interactive computer graphics as an effective technique for the entry and editing of data and the presentation of results is discussed. Experience with examples from the fields of geodesy, engineering surveying, and cadastral surveying have demonstrated the effectiveness of this program as an educational, research and working tool.

1980 CANDE committee activities

The Computer Aided Network Design (CANDE) subcommittee of the Circuits and Systems Society was involved in a number of activities during 1980. These activities supported the basic charter of providing a forum for supporting the investigation and discussion of topics associated with the use of computer aids in the design, analysis, and verification of electrical circuit design with emphasis on LSI and VLSI circuits.

A Unified Review of Optimization

The main objective of this paper is to give a survey of recent automatic optimization methods which either have found or should find useful application in the area of computer-aided network design. Huang's family of algorithms for unconstrained optimization is reviewed. The Fletcher method and the Charalambous family of algorithms for unconstrained optimization, which abandon the "full linear search," are presented. Special emphasis is devoted to algorithms by Bandler and Charalambous on least pth and minimax optimization which can be readily programmed and used. Due to work by Bandler and Charalambous, it is shown how constrained minimax problems can be solved exactly as unconstrained minimax problems by using a new approach to nonlinear programming. The application of minirnax optimization on the design of lumped-distributed active filters, problems for future investigation, and a select list of references are also included.

Gradients of a performance index arising from network optimisation in the frequency domain

A method is given that calculates the gradients of a performance index arising from computer-aided network design in the frequency domain.

Wave Sensitivities of Networks

A theoretical foundation is presented for the efficient computation of first- and second-order sensitivities of networks with respect to network parameters in terms of wave variables. The concept of the adjoint network is used. First-order sensitivity formulas for a wide variety of elements are presented, including lumped and uniformly distributed elements, active and passive elements, and reciprocal and nonreciprocal elements. Parameters include electrical quantities, geometrical dimensions, and frequency. It is shown how gradients related to wave-based least pth and minimax objective functions can be computed. A comparison with a method which avoids the need for analysis of adjoint networks is made. Applications in the computer-aided design of networks using efficient gradient minimization methods are envisaged.

Theory of generalized least pth approximation

A unified discussion of least p th approximation as it relates to optimal computer-aided design of networks and systems is presented. General objective functions are proposed and their properties discussed. The main result is that a wider variety of design problems and a wider range of specifications than appear to have been considered previously from the least pth point of view should now be tractable.

An Iterative Chebyshev Approximation Method for Network Design

One of the most important problems of computeraided network design is the optimization of network characteristics by iterative calculation. In this paper, the problem of realizing a network whose transmission characteristics approximate a given function in Chebyshev sense is treated as a nonlinear programming problem, and a method of solving this problem by successively solving linear programming problems, which are derived by locally linearizing the original nonlinear programming problem, is proposed. An improvement of the method for reducing the computation time is also considered and is proved to be practical and very effective by many design examples.

Computer-aided network optimization the state-of-the-art

Formal optimization procedures are destined to assume an increasingly useful role in network design. To form a basis for continued development, this paper summarizes the field by 1) presenting an extensive and detailed review of the optimization methods used in computer-aided network design and 2) giving state-of-the-art examples of iterative network design.