Armen H. Zemanian

dblp:53/3046 · DBLP profile ↗
← Back
9ranked-venue papers
7as first author
0since 2021 · last 2000
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 6 · 5 first-authorComputer networks · 1Human-computer interaction and ubiquitous computing · 1 · 1 first-authorTheory of computation · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Electronic design automation · 100%
Theoretical computer science
1 paper
Information theory · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Electronic design automation › physical design › parasitic extraction
interconnect capacitance extraction
0.021999
Exterior templates for capacitance computations [interconnections] · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1999
Three-dimensional capacitance computations for VLSI/ULSI interconnections · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1989
Electronic design automation › physical design
parasitic extraction
0.021999
Exterior templates for capacitance computations [interconnections] · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1999
Three-dimensional capacitance computations for VLSI/ULSI interconnections · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1989
Electronic design automation
physical design
0.021999
Exterior templates for capacitance computations [interconnections] · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1999
Three-dimensional capacitance computations for VLSI/ULSI interconnections · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1989
Information theory › probability theory › stochastic processes
autocorrelation function
0.011955
A note on the bounds on autocorrelation functions (Corresp.) · IRE Trans. Inf. Theory 1955

Methods — techniques the papers use, named apart from their topics

infinite grid theory · 0.0exterior template · 0.0successive over-relaxation · 0.0parallel processing · 0.0domain contraction · 0.0fourier cosine transform analogy · 0.0
YearPublicationVenuePosition
2000 Maximum principles for node voltages and branch currents in transfinite resistive networks
abstract
The classical maximum um principle for finite linear resistive networks asserts that every node voltage in a sourceless subnetwork is no greater (resp. no less) than the maximum (resp. minimum) node voltage at the boundary nodes of the subnetwork. A related result is that the absolute value of every branch current in the sourceless subnetwork is no greater than the sum of the absolute values of all the currents in all branch cuts within the subnetwork at the boundary nodes. These principles are extended to transfinite networks. Their proofs are far more complicated than those for the classical case. This is a consequence of the difficulty that Kirchhoff's laws are not always satisfied in transfinite networks. (Tellegen's equation is used instead.).
Armen H. Zemanian
ISCAS1
1999 Exterior templates for capacitance computations [interconnections]
abstract
The computation of the capacitance coefficients for alternative interconnect configurations requiring repeated calculations as the configurations are changed can be substantially accelerated by using an "exterior template", that is, a set of "template capacitors" connected to the surface of the smallest rectangular region encompassing the planned interconnects. These template capacitors represent the effect of the medium for the fringing field outside the rectangle, and they eliminate the need to sample the fringing field every time a new calculation is made. The template capacitors can be determined by using the theory of infinite grids to eliminate almost entirely the medium-truncation error. All this works for both two-dimensional and three-dimensional (3-D) configurations, and it is especially advantageous in the 3-D case.
Armen H. Zemanian, Victor A. Chang
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1
1995 Contributions of Corner Singularities of the Capacitance of Interconnections Wires
abstract
A significant problem in the computation of capacitance coefficients for microwave transmission and VLSI interconnection transmission systems is caused by the singularities in the electric field at the corners and edges of conductors. For two-dimensional models, a solution is given by the so called "Duncan Correction", which is based on polar expansion of the field. No such exact expansion exists in the three-dimensional case. Recent research has led to some appropriate asymptotic expressions for those singularities, and these are used to derive algorithms for correcting conventional capacitance computation. This correction accounts for the singularities at the corners of the conductors. Finally we present a few examples to illustrate the three-dimensional capacitance correction procedure and computational accuracy.
Armen H. Zemanian
ISCAS2
1994 Strange Behavior in Inifinite and Transfinite Networks
abstract
This paper gathers together and explains physically a variety of queer and paradoxical phenomena exhibited by infinite and transfinite networks.>
Armen H. Zemanian
ISCAS1
1993 Kirchhoff's laws for nonlinear transfinite networks
Armen H. Zemanian
ISCAS1
1989 Three-dimensional capacitance computations for VLSI/ULSI interconnections
abstract
Three-dimensional simulations of metallization wires of VLSI/ULSI interconnections that are plagued with unreasonably large memory requirements and execution times are discussed. A strategy is presented for overcoming these problems. A principal feature is the use of a domain contraction technique, which accounts for the fringing electric field throughout the infinite domain above and below the levels where the wires appear and provides a major reduction in the number of nodal points for a finite-difference computation. Moreover, an iterative method (successive over-relaxation) is used to alleviate memory requirements, a nonuniformly distributed nodal array is used to reduce the number of nodal points still further, and parallel processing is used to reduce execution time. It is argued that rounded edges and corners for the simulation of the wires are the only appropriate configurations at current levels of miniaturization. This avoids the problem of electric-field singularities at sharp edges and corners and results in significantly reduced capacitance coefficients.>
Armen H. Zemanian, Reginald P. Tewarson, Chi Ping Ju, Juif Frank Jen
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1
1983 A dynamic marketing network with monopsonistic acquisition and perfectly competitive disposition
abstract
The marketing networks of third-world countries are large systems having many markets and many agents. The dynamic behavior of one form is modeled in this paper by examining the actions of the traders. Recursive analysis yields time series in all prices and commodity flows. The network has a unique equilibrium state. Under certain conditions on supply and demand elasticities, that equilibrium state is locally asymptotically stable.
Armen H. Zemanian
IEEE Trans. Syst. Man Cybern.1
1982 A matroid related to finitely chainlike, countably infinite networks
abstract
Abstract The determination of the currents and voltages in a countably infinite electrical network containing infinite energy requires not only the imposition of Kirchoff's laws and Ohm's laws but also the arbitrary assignment of the current‐voltage pairs in certain sets of branches, called joints. For finitely chainlike, countably infinite networks the maximal joint sets satisfy the base axioms of a matroid.
Alan C. Tucker, Armen H. Zemanian
Networks2
1955 A note on the bounds on autocorrelation functions (Corresp.)
abstract
Recently, bounds were shown to exist on the transient response of networks whose system functions were appropriately restricted. Since the impulse response and real part, of the system function are Fourier cosine transforms of each other and the autocorrelation function and power spectrum for stationary processes are similarly related, many of these results may be applied directly to the autocorrelation. This analogy depends on the fact that. the power spectrum is a nonnegative function. The results will be stated without proof, since these proofs appear elsewhere. It is merely a matter of substituting the appropriate variables for those appearing previously in the papers on transient response.
Armen H. Zemanian
IRE Trans. Inf. Theory1