9,921 research outputs found
On the Generation of Large Passive Macromodels for Complex Interconnect Structures
This paper addresses some issues related to the passivity of interconnect macromodels computed from measured or simulated port responses. The generation of such macromodels is usually performed via suitable least squares fitting algorithms. When the number of ports and the dynamic order of the macromodel is large, the inclusion of passivity constraints in the fitting process is cumbersome and results in excessive computational and storage requirements. Therefore, we consider in this work a post-processing approach for passivity enforcement, aimed at the detection and compensation of passivity violations without compromising the model accuracy. Two complementary issues are addressed. First, we consider the enforcement of asymptotic passivity at high frequencies based on the perturbation of the direct coupling term in the transfer matrix. We show how potential problems may arise when off-band poles are present in the model. Second, the enforcement of uniform passivity throughout the entire frequency axis is performed via an iterative perturbation scheme on the purely imaginary eigenvalues of associated Hamiltonian matrices. A special formulation of this spectral perturbation using possibly large but sparse matrices allows the passivity compensation to be performed at a cost which scales only linearly with the order of the system. This formulation involves a restarted Arnoldi iteration combined with a complex frequency hopping algorithm for the selective computation of the imaginary eigenvalues to be perturbed. Some examples of interconnect models are used to illustrate the performance of the proposed technique
Hypercube matrix computation task
A major objective of the Hypercube Matrix Computation effort at the Jet Propulsion Laboratory (JPL) is to investigate the applicability of a parallel computing architecture to the solution of large-scale electromagnetic scattering problems. Three scattering analysis codes are being implemented and assessed on a JPL/California Institute of Technology (Caltech) Mark 3 Hypercube. The codes, which utilize different underlying algorithms, give a means of evaluating the general applicability of this parallel architecture. The three analysis codes being implemented are a frequency domain method of moments code, a time domain finite difference code, and a frequency domain finite elements code. These analysis capabilities are being integrated into an electromagnetics interactive analysis workstation which can serve as a design tool for the construction of antennas and other radiating or scattering structures. The first two years of work on the Hypercube Matrix Computation effort is summarized. It includes both new developments and results as well as work previously reported in the Hypercube Matrix Computation Task: Final Report for 1986 to 1987 (JPL Publication 87-18)
A Coupled Hybridizable Discontinuous Galerkin and Boundary Integral Method for Analyzing Electromagnetic Scattering
A coupled hybridizable discontinuous Galerkin (HDG) and boundary integral
(BI) method is proposed to efficiently analyze electromagnetic scattering from
inhomogeneous/composite objects. The coupling between the HDG and the BI
equations is realized using the numerical flux operating on the equivalent
current and the global unknown of the HDG. This approach yields sparse coupling
matrices upon discretization. Inclusion of the BI equation ensures that the
only error in enforcing the radiation conditions is the discretization.
However, the discretization of this equation yields a dense matrix, which
prohibits the use of a direct matrix solver on the overall coupled system as
often done with traditional HDG schemes. To overcome this bottleneck, a
"hybrid" method is developed. This method uses an iterative scheme to solve the
overall coupled system but within the matrix-vector multiplication subroutine
of the iterations, the inverse of the HDG matrix is efficiently accounted for
using a sparse direct matrix solver. The same subroutine also uses the
multilevel fast multipole algorithm to accelerate the multiplication of the
guess vector with the dense BI matrix. The numerical results demonstrate the
accuracy, the efficiency, and the applicability of the proposed HDG-BI solver
ADVANCED IMPLEMENTATIONS OF THE ITERATIVE MULTI REGION TECHNIQUE
The integration of the finite-difference time-domain (FDTD) method into the iterative multi-region (IMR) technique, an iterative approach used to solve large-scale electromagnetic scattering and radiation problems, is presented in this dissertation. The idea of the IMR technique is to divide a large problem domain into smaller subregions, solve each subregion separately, and combine the solutions of subregions after introducing the effect of interaction to obtain solutions at multiple frequencies for the large domain. Solution of the subregions using the frequency domain solvers has been the preferred approach as such solutions using time domain solvers require computationally expensive bookkeeping of time signals between subregions. In this contribution we present an algorithm that makes it feasible to use the FDTD method, a time domain numerical technique, in the IMR technique to obtain solutions at a pre-specified number of frequencies in a single simulation. As a result, a considerable reduction in memory storage requirements and computation time is achieved.
A hybrid method integrated into the IMR technique is also presented in this work. This hybrid method combines the desirable features of the method of moments (MoM) and the FDTD method to solve large-scale radiation problems more efficiently. The idea of this hybrid method based on the IMR technique is to divide an original problem domain into unconnected subregions and use the more appropriate method in each domain.
The most prominent feature of this proposed method is to obtain solutions at multiple frequencies in a single IMR simulation by constructing time-limited waveforms. The performance of the proposed method is investigated numerically using different configurations composed of two, three, and four objects
- …