Showing papers on "Topology (electrical circuits) published in 1974"

Signal flow graphs-Computer-aided system analysis and sensitivity calculations

Abstract: Concepts which promise to extend many fundamental results of network theory to general systems are introduced. The basis for these extensions is the introduction of two matrices, the summing matrix S and the branching matrix B, which completely describe the topology of a signal flow graph. This leads to a formulation of system equations in terms of submatrices of the S- and B-matrices suitable for digital-computer programming. Consequently, many computer-aided circuit analysis and design programs can now be employed for the computer-aided analysis and design of systems representable by signal flow graphs. This formulation also leads to a straightforward algorithm for obtaining the system gain, an alternate to using Mason's gain formula. Furthermore, the power of this formulation, and its strong relation to network theory, is demonstrated by the derivation of a theorem similar to Tellegen's theorem in network theory. The theorem depends only on the topological properties of the summing and branching matrices and not on the functional relationships between the branch

Current-controlled (S-type) negative resistance circuit

Abstract: This paper describes a negative resistance circuit, which is different from the existing circuits with regard to its topology. Within the operating constraints, the circuit behaves as a one-port current-controlled negative resistance of adjustable magnitude over a wide range. It is possible to fabricate this circuit as an integrated module. A bistable multivibrator is also developed using this circuit.

Computer recognition of divergences in Feynman diagrams

Abstract: Symbolic and Algebraic Manipulations techniques are applied to a problem of quantum electrodynamics: to find the divergences inclosed in a Feynman graph. These divergences are connected to the topology of the graph. No calculations are performed.

The synthesis of biquadratic passive RC impedances with equal-valued capacitors

Abstract: The purpose of this paper is to present a method for synthesizing a class of second-order RC driving-point impedances with minimum total capacitance using equal-valued capacitors. This method has practical applications for the design of the passive portions of integrated circuits, in which cost minimization is a main objective. A network topology satisfying the requirements of equal and minimum total capacitance is developed, and specific element values in this topology are derived to match the desired impedance. Certain realizability conditions for this synthesis are derived.

FAM 16.3: An Integrated Analog Correlator using Charge-Coupled Devices

Abstract: AN ANALOG CORRELATOR performs the convolution of two arbitrary analog input functions, and therefore has the potential of replacing complex digital signal processing systems, at a great saving of hardware and cost. In this paper, the design of a monolithic analog correlator employing charge-coupled devices will be described. A 20-stage experimental correlator was built and evaluated. Based on tests of that device, a more sophisticated device is being implemented. The two designs will be presented, along with a comparison of performances. The basic device organization1 is depicted in Figure 1. A tapped CCD delay line provides parallel outputs for each input signal. Corresponding outputs of the two delay lines form the inputs to an array of four quadrant analog multipliers, whose outputs are summed to complete the function. Multiplication is accomplished using MOSFETs as voltage controlled resistors. The multiplier topology shown in Figure 5 overcomes the inherent nonlinearity of FETs used as rrsistors, as is shown by the following argument: The drain current of Q3 =

Translation of a circuit matrix into the incidence matrix of a network

Abstract: A 2-stage pseudo-Boolean programming scheme is constructed to find all the networks, the circuits of which are determined by a given circuit matrix. An illuminating example is given.

Algebraic analysis of sequential circuits

Abstract: An algebraic technique is described that transforms the excitation equations derived from the topology of a sequential circuit into a formal operational model, e.g. a state-transition table, required for analysis. An algebraic form of such a model is suggested. The analysis applies for asynchronous and synchronous networks.