Showing papers on "Network topology published in 1975"
TL;DR: The mathematical background required for a general-purpose computer analysis and design program that is not limited to any single filter topology is derived, as well as some of its various programming considerations.
Abstract: Several recent publications have called attention to a substantial number of new digital filter topologies to be added to designers' "catalogs." Because of this growing list of available structures, it is worthwhile to code a general-purpose computer analysis and design program that is not limited to any single filter topology. We derive here the mathematical background required for such a program, as well as some of its various programming considerations. For tutorial purposes, a number of numerically based analysis techniques are unified under a common notation and approach. New results include the application of symbolic analysis techniques to digital filters. Digital filter design optimization with symbolic second-derivative information is also discussed. An optimization example is given.
15 citations
TL;DR: Several results in the theory of finite topologies are state by introducing the idea of generating topologies and it is possible to derive existence theorems and get numerical results in an easy manner.
11 citations
TL;DR: In this article, the authors show that the occurrence of topologically random channel networks in the presence of strong environmental controls does not necessarily indicate that network topology is insensitive to such controls.
Abstract: The occurrence of topologically random channel networks in the presence of strong environmental controls does not necessarily indicate that network topology is insensitive to such controls. In areas where environmental controls have a preferred orientation, certain topologically distinct channel networks may be promoted where networks of a given magnitude flow in one direction and inhibited where they flow in another; but these biases in network topology may compensate for one another so effectively that they do not give rise to identifiable systematic deviations from topological randomness. This theme is illustrated by analyses of magnitude-4 channel networks from three areas in southeastern Australia. Goodness-of-fit tests indicate that the exhaustive samples of networks from these areas could have been drawn from topologically random populations. However, similar tests applied to subsamples selected according to network flow direction reveal biases in network topology in two of the areas. These biases, which are apparently due to microclimatic controls, signify that, although the networks in each area may belong to a topologically random population, they are not composed of randomly merging stream channels.
9 citations
19 May 1975
TL;DR: This paper presents a meta-modelling architecture suitable for dynamic allocation of communication resources so that they may be flexibly shared among a number of autonomous processors in a packet-switching network.
Abstract: One of the striking developments in computing and communication technology during the past decade is reflected in the evolution of packet-switching computer networks. Packet-switching communication techniques allow dynamic allocation of a set of communication resources (circuits) so that they may be flexibly shared among a number of autonomous processors. Implementation of such packet-switching networks has required many design decisions, such as the choice of network topology, routing strategies, and the establishment of conventions, or protocols, for information interchange between network resources.
8 citations
TL;DR: In this article, the outer measure derived from the Haar measure on a group of continuous points in abelian networks is defined as follows: if the subsets of a point x of G T t continuous can eventually intersect each x -neighbourhood of 0.
Abstract: (A) The f i r s t resul t i s as follows. Suppose G i s d iv is ib le , abelian, and has no points (except 0 ) whose nth-multiple i s 0 , for some integer n not less than 2 . I cal l a point x of G T t continuous if the subsets {y : my = x] , for posi t ive integers m , eventually intersect each x -neighbourhood of 0 . Then le t [G, Tp) be a local ly compact and O-compact group, and denote by U)? the outer measure derived from the Haar measure u on that group. Also suppose that the ra t io of the T2-measure of {rtx : x 6 A) to the T -measure of A , for any Tp-Borel-measurable set A (the ra t io i s the same for any such A with f in i t e measure), does not exceed 1 . Then for each T Bor el-measurable set A with nonvoid T in t e r io r , VU(/1) 2 (Op(l/ ) , W being the subgroup of a l l x -continuous points in G .
2 citations
TL;DR: In this article, the number of natural frequencies of a passive RLC network with a reactive gyrator is derived in terms of the degrees of the polynomials in the gyration impedance and the alteration in the network topology.
Abstract: Using a particular expansion of the network determinant, a simple formula is derived giving the total number of natural frequencies of a passive RLC network containing a reactive gyrator. The order of complexity is expressed in terms of the degrees of the polynomials in the gyration impedance and the alteration in the network topology due to gyrator embedding. Quantitative conditions for the order of complexity of the active network exceeding that of the network without the gyrator are obtained. Formulas are also derived for the number of zero and non-zero natural frequencies.
2 citations