A recursive algorithm is presented for the time-domain simulation of lossy transmission lines. It can be used efficiently for the transient analysis of high speed interconnects in high-speed VLSI circuits and multichi...
详细信息
A recursive algorithm is presented for the time-domain simulation of lossy transmission lines. It can be used efficiently for the transient analysis of high speed interconnects in high-speed VLSI circuits and multichip modules (MCMs).
We present a new accurate algorithm (REFUND) for computing the fundamental matrix (or closely related group inverse matrix) of a finite regular Markov chain. This algorithm is developed within the framework of the sta...
详细信息
We present a new accurate algorithm (REFUND) for computing the fundamental matrix (or closely related group inverse matrix) of a finite regular Markov chain. This algorithm is developed within the framework of the state reduction approach exemplified by the GTH (Grassmann, Taksar, Heyman)/S (Sheskin) algorithm for recursively finding invariant measure. The rst (reduction) stage of the GTH/S algorithm is shared by REFUND, as well as by an earlier algorithm FUND developed for the fundamental matrix by Heyman in 1995, and by a modified version of Heyman and O'Leary in 1998. Unlike FUND, REFUND is recursive, being based on an explicit formula relating the group inverse matrix of an initial Markov chain and the group inverse matrix of a Markov chain with one state removed. Operation counts are approximately the same: Theta (7/3n(3)) for REFUND versus Theta (8/3n(3)) for FUND. Numerical tests indicate that REFUND is accurate. The structure of REFUND makes it easily combined with the other algorithms based on the state reduction approach. We also discuss the general properties of this approach, as well as connections to the optimal stopping problem and to tree decompositions of graphs related to Markov chains.
This paper presents a new lower bound for the recursive algorithm for solving parity games which is induced by the constructive proof of memoryless determinacy by Zielonka. We outline a family of games of linear size ...
详细信息
This paper presents a new lower bound for the recursive algorithm for solving parity games which is induced by the constructive proof of memoryless determinacy by Zielonka. We outline a family of games of linear size on which the algorithm requires exponential time.
A recursive algorithm is adopted for the computation of dyadic Green＇s functions in three-dimensional stratified uniaxial anisotropic media with arbitrary number of layers. Three linear equation groups for computing ...
详细信息
A recursive algorithm is adopted for the computation of dyadic Green＇s functions in three-dimensional stratified uniaxial anisotropic media with arbitrary number of layers. Three linear equation groups for computing the coefficients of the Sommerfeld integrals are obtained according to the continuity condition of electric and magnetic fields across the interface between different layers, which are in correspondence with the TM wave produced by a vertical unit electric dipole and the TE or TM wave produced by a horizontal unit electric dipole, respectively. All the linear equation groups can be solved via the recursive algorithm. The dyadic Green＇s functions with source point and field point being in any layer can be conveniently obtained by merely changing the position of the elements within the source term of the linear equation groups. The problem of singularities occurring in the Sommerfeld integrals is efficiently solved by deforming the integration path in the complex plane. The expression of the dyadic Green＇s functions provided by this paper is terse in form and is easy to be programmed, and it does not overflow. Theoretical analysis and numerical examples show the accuracy and effectivity of the algorithm.
A truncated, nonuniform, finite array of strips does not have a closed-form solution. Using translational symmetry, a recursive algorithm that calculates the scattering solution with N log2 N computational complexity ...
详细信息
A truncated, nonuniform, finite array of strips does not have a closed-form solution. Using translational symmetry, a recursive algorithm that calculates the scattering solution with N log2 N computational complexity is described. The current distribution for the H(z) polarization shows small-length-scale oscillations not present in the E(z) polarization.
作者：
周行于乐彭伟彭卫文黄洪钟School of Mechanic
Electronic and Industrial EngineeringUniversity of Electronic Science and Technology of China
Modern satellite systems are generally designed to fulfill multiphase-missions. Component /subsystem redundancies are commonly used to achieve high reliability and long life of modern satellite systems. These characte...
详细信息
Modern satellite systems are generally designed to fulfill multiphase-missions. Component /subsystem redundancies are commonly used to achieve high reliability and long life of modern satellite systems. These characteristics have leaded to a critical issue of reliability analysis of satellites that is how to deal with the reliability analysis with multiphase-missions and propagated failures of redundant components. Traditional methods based on the binary decision diagram( BDD) can hardly cope with these issues efficiently. Accordingly, a recursive algorithm method was introduced to facilitate the reliability analysis of satellites. This method was specified for the analysis of static fault tree and it was implemented by generating combination of component failures and carrying out a backward recursive algorithm. The effectiveness of the proposed method was demonstrated through the reliability analysis of a multiphase satellite system with propagated *** major advantage of the proposed method is that it does not need composition of BDD and its computational process is automated.
Based on the problem how to model linear models with different batches of samples and information, the paper raises the method of depositing the stale, the method of bringing into the fresh and the method of depositin...
详细信息
ISBN:
(纸本)9781424455690
Based on the problem how to model linear models with different batches of samples and information, the paper raises the method of depositing the stale, the method of bringing into the fresh and the method of depositing the stale and bringing into the fresh of Generalized Least Squares Estimator. Furthermore the estimation formula and the corresponding proof are given. This approach provides flexibility and theoretical basis for data analysis, mining and prediction used in the economy, agriculture and forestry widely.
N-version software is used all over the world as one of the approaches that can provide with the high level of reliability and software fault tolerance. The application of redundant module versions of software allows ...
详细信息
ISBN:
(纸本)9783319911861;9783319911854
N-version software is used all over the world as one of the approaches that can provide with the high level of reliability and software fault tolerance. The application of redundant module versions of software allows to obtain a correct result even if there is an error in the separate module versions. However, the program redundancy that can increase software reliability needs extra resources. It results in an optimization problem. There is a necessity for a certain variant of multiversion software realization i.e. such a modules versions set is required that demands less resources and guarantees high level of reliability simultaneously. The exhaustive search of all possible multiversion software realizations is carried out by the recursive algorithm proposed in the article.
Discrete Fourier Transform (DFT) can calculate the phase and amplitude of the AC waveform directly from the sampled data. However, high performance microprocessor is inevitable to implement DFT into real time system, ...
详细信息
Discrete Fourier Transform (DFT) can calculate the phase and amplitude of the AC waveform directly from the sampled data. However, high performance microprocessor is inevitable to implement DFT into real time system, especially when conventional calculation algorithm is applied to high frequency sampling. Applying recursive algorithm to the DFT can drastically reduce the calculation amount. This paper studies about the phase detection error of DFIF when recursive algorithm is applied. The proposed error correction method makes it possible to guarantee the correctness of detected phase, which is equivalent to the conventional DFT calculation algorithm. Also, this paper proposes the reset scheme of numerical error accumulation, which is unavoidable for the recursive algorithm applied DFT. The proposed method can guarantee high accuracy with minimum increment of calculation amount. The qualitative correctness estimated from the theoretical equations is confirmed through quantitative study by digital simulation. (C) 2002 Wiley Periodicals, Inc.
暂无评论