Search

Discrete hard fault is always tested in existing node selection methods for analog circuit diagnosis. Actually, analog component parameter changes continuously and output node voltages distribute in a continuous voltage interval. In this paper, an novel test node selection method is proposed for continuous parameter shifting (CPS) fault. Firstly, CPS faults are sampled by parameter scan simulation in a single test frequency. Collected node voltages are seen as a data set in a statistical distribution. Secondly, ambiguous faults are identified according to the independent distributions of all CPS faults. The independence of CPS fault sample is deduced by Kruskal-Wallis non-parametric testing. Then, new fault dictionaries are generated for each test node according to ambiguous interval. The proposed fault dictionary represents the mutual independence of each pair of CPS faults. Finally, as fault dictionaries are considered as connected graphs, the optimal test nodes are selected based on an improved depth first search (DFS) algorithm. The effectiveness of method is verified by testing linear and nonlinear circuits. [ABSTRACT FROM AUTHOR]

In this paper, we propose a new robust congestion- control strategy for a differentiated-services (DiffServ) network. A sliding-mode-based variable structure control technique is utilized to design a congestion controller on the basis of a fluid flow model. The performance of our proposed scheme is then demonstrated on a DiffServ network. Our proposed algorithm is developed for an interconnected network as a hop-by-hop distributed-control approach. A formal analysis of the controlled network is conducted, where it is shown that the error dynamics of the overall time-delay-dependent system is ℒ∞ stable. Numerical simulations are provided to demonstrate the capabilities of our proposed methodology. [ABSTRACT FROM AUTHOR]

In this paper, based on the application of the sum-product (SP) algorithm to factor graphs (FGs) representing the joint a posteriori probability (APP) of the transmitted symbols, we propose new iterative soft-input soft-output (SISO) detection schemes for intersymbol interference (ISI) channels. We have verified by computer simulations that the SP algorithm converges to a good approximation of the exact marginal APPs of the transmitted symbols if the FG has girth at least 6. For ISI channels whose corresponding FG has girth 4, the application of a stretching technique allows us to obtain an equivalent girth-6 graph. For sparse 151 channels, the proposed algorithms have advantages in terms of complexity over optimal detection schemes based on the Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm. They also allow a parallel implementation of the receiver and the possibility of a more efficient complexity reduction. The application to joint detection and decoding of low-density parity-check (LDPC) codes is also considered and results are shown for some partial-response magnetic channels. Also in these cases, we show that the proposed algorithms have a limited performance loss with respect to that can be obtained when the optimal "serial" BCJR algorithm is used for detection. Therefore, for their parallel implementation, they represent a favorable alternative to the modified "parallel" BCJR algorithm proposed in the literature for the application to magnetic channels. [ABSTRACT FROM AUTHOR]

Abstract: In this article, we present an algorithm to find the first K shortest unique-arc walks in a traffic-light network. Each node of the present network is associated with a repeated sequence of different windows to model operations of traffic signals and intersection movements. Unlike conventional simple or looping paths, we refer to the paths in this paper as unique-arc walks because they may include repeated nodes but will exclude repeated arcs. Using the heap structure, we develop an algorithm to find the first K shortest unique-arc walks in time O(Kr|V|3|A|), where |V| is the number of nodes, |A| is the number of arcs, and r represents the number of different windows associated with a node. [Copyright &y& Elsevier]

This paper presents a new approach to separate colored stationary signals mixed by convolutive channels. A cost function is proposed by employing linear constraint to the demixing vectors. The linear constraint is shown to be sufficient for avoiding trivial solution. The minimization of the cost function is performed using the Lagrangian method. Simulation results demonstrate the performance of the algorithm. [Copyright &y& Elsevier]

There are increasing demands for image interpolation in various fields such as virtual reality, computer animation, and video transmission. The critical-point filters (CPF) we have proposed previously enable completely automatic matching of two images. In our previous method, however, it has taken a long time to compute the optimal parameter values by iterative searches. This paper proposes an improved algorithm called the enhanced critical-point filters (ECPF) where the parameters are stably computed using together the inverse mapping from the destination to the source. It takes only a second to match images whose size is 64 × 64. The algorithm is also improved in its precision by directly handling color images while the previous algorithm has taken only the intensity value into account. We apply ECPF to keyframe interpolation of video sequences. We also apply ECPF to interpolating two different views of an object to generate any intermediate views. In this case, there are many constraints that can be used to determine the mapping between the images. We propose a method to use such constraints to improve the accuracy of the mappings. As the results, image-based pseudo-3D models are easily created from a set of views without any special devices. [ABSTRACT FROM AUTHOR]

We consider in this paper the possibility of using a low-density parity-check (LDPC) code as the complete error control system in a magnetic recording channel. We compare the performance of selected LDPC codes with two Reed-Solomon (RS) code schemes on an extended partial-response class 4 (EPR4) channel, with particular emphasis on their performance in noise bursts (induced by media defects or thermal asperities). We quantify the performance of LDPC codes in noise bursts via a maximum-burst-length parameter, and we present a simple algorithm for computing this parameter. We find some very promising initial results: the LDPC codes are very robust against large noise bursts (128 bits long or more), and are superior to the RS schemes examined in the measurable error rate region. The extent to which they are superior depends on the particular LDPC scheme involved, and the results provide motivation for further investigation in this area. [ABSTRACT FROM AUTHOR]