• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.9
• /
• pp.37-48
• /
• 1996

In this paper, for the single s-a-E fault detected in a triangular cellular permutation network (TCPN), we propose a method which can tolerate a fault by reconfiguring the netowrk and analyze the possibilities of the reconfiguration. The network is set up through iterative decomposition of a permutation into the right or left coset. For the s-a-E fault of a cell which is to be transpositioned for an increasing order mapping, we cna reconfigure it merely by switching te decomposition scheme from right coset to left coset or vice versa. Also for a decreasing order mapping, we make a detour around the faulty cell. Reconfiguring with the redundant connectivity of a TCPN, we could realize form 17% to 90% of the permutation for the number of inputs from 4 to 40. REconfiguration of the network by exchanging the first input with the last input and the first output with the last output resulted in more than 99% realization of the permutation. Also with the exchange of all inputs and outputs with neighboring cells, we could have 100% realization of the permutation.

• Proceedings of the KIEE Conference
• /
• 2005.07b
• /
• pp.1371-1373
• /
• 2005

Nowadays, Intelligent Electronic Devices(IED) are widely used in power system. In order to improve the selectivity, sensitivity, and reliability of the power system composed by IEDs, A new fault tolerant IED system based on agent technique is presented in this paper. in the presented system, different with existing IED systems, the redundancies are drawn out from IED devices, and compose a standby backup system. And those redundancies are not specified to a particular type of IEDs. By using the agent technique, redundancies can download agents to modify their functions to fit different types of IEDs. As a conclusion, the reliability of the presented system is estimated in this paper.

• Journal of Advanced Navigation Technology
• /
• v.14 no.2
• /
• pp.233-238
• /
• 2010

In this paper, we applied the forward and backward error recovery techniques to a reduced instruction set computer (risc) processor to develop two fault-tolerant processors, namely, fetch redundant risc (FRR) processor and a redundancy execute risc (RER) processor. To evaluate the fault-tolerance capability of three target processors, we developed the base risc processor, FRR processor, and RER processor in SystemC hardware description language. We performed fault injection experiment using the three SystemC processor models and the SystemC-based simulation fault injection technique. From the experiments, for the 1-bit transient fault, the failure rate of the FRR, RER, and base risc processor were 1%, 2.8%, and 8.9%, respectively. For the 1-bit permanent fault, the failure rate of the FRR, RER, and base risc processor were 4.3%, 6.5%, and 41%, respectively. As a result, for 1-bit fault, we found that the FRR processor is more reliable among three processors.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.6
• /
• pp.735-746
• /
• 1999

We design the robust and inherently fault tolerant decetralized$$H^infty$$ filter for the multisensor state estimation problem when there are insufficient priori informations on the statistical properties of external disturbances. For developing the proposed algorithm, an alternative form of suboptimal$$H^infty$$ filter equations are formulated by applying an alternative form of Kalman filter equations to the indefinite inner product space state model of suboptimal$$H^infty$$ filtering problems. The decentralized$$H^infty$$ filter that consists of local and central fusion filters can be designed effciently using the proposed alternative$$H^infty$$ filiter gain equations. The proposed decentralized$$H^infty$$ filter is robust against un-known external disturbances since it bounds the maximum energy gain from the external disturbances to the estimation errors under the prescribed level$$r^2$$ in both local and central fusion filters and is also fault tolerant due to its inherent redundancy. In addition, the central fusion equations between the global and local data can reduce the unnecessary calculation burden effectively. Computer simulations are made to ceritfy the robustness and fault tolerance of the proposed algorithm.

• Journal of Electrical Engineering and Technology
• /
• v.13 no.6
• /
• pp.2485-2492
• /
• 2018

The rapid development of large-scale integrated circuits has brought great challenges to the circuit testing and diagnosis, and due to the lack of exact fault models, inaccurate analog components tolerance, and some nonlinear factors, the analog circuit fault diagnosis is still regarded as an extremely difficult problem. To cope with the problem that it's difficult to extract fault features effectively from masses of original data of the nonlinear continuous analog circuit output signal, a novel approach of feature extraction and dimension reduction for analog circuit fault diagnosis based on wavelet packet decomposition, local linear embedding algorithm, and clone selection algorithm (WPD-LLE-CSA) is proposed. The proposed method can identify faulty components in complicated analog circuits with a high accuracy above 99%. Compared with the existing feature extraction methods, the proposed method can significantly reduce the quantity of features with less time spent under the premise of maintaining a high level of diagnosing rate, and also the ratio of dimensionality reduction was discussed. Several groups of experiments are conducted to demonstrate the efficiency of the proposed method.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.1_2
• /
• pp.86-94
• /
• 2004

In this paper, we show that $ G(2^m, 4), m{\geq}3$with at most m-2 faulty elements has a fault-free cycle of length 1 for every ${\leq}1{\leq}2^m-f_v$ is the number of faulty vertices. To achieve our purpose, we define a graph G to be k-fault hypohamiltonian-connected if for any set F of faulty elements, G- F has a fault-free path joining every pair of fault-free vertices whose length is shorter than a hamiltonian path by one, and then show that$ G(2^m, 4), m{\geq}3$ is m-3-fault hypohamiltonian-connected.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.37 no.5
• /
• pp.34-45
• /
• 2000

In this paper, a multiagent fault-tolerant supervisory control methodology is proposed for serial production systems under partial observation. To this end, the idea of multiagent control is incorporated with the fault-tolerant supervisory control of discrete event systems. Especially, the concept of mutual fault-tolerance between cascaded processes is established and the unobservable fault identification utilizing the difference information of the controlled results is investigated. Then the synthesis of agent supervisors is formulated based on the proposed concept. A case study of the fault-propagation control of polypropylene prepolymerization and polymerization processes is provided to illustrate the proposed control policy.

• Proceedings of the Korean Nuclear Society Conference
• /
• 2005.05a
• /
• pp.1311-1312
• /
• 2005

• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.05b
• /
• pp.613-617
• /
• 2003

본 연구에서는 텔레메트리 처리장치의 고장 발생 원인과 복구 대책별로 장단점을 분석한 후 신뢰성 증대를 위하여 메시지 접근 방식을 제안하였으며 이를 객체지향적 방법론에 따라 UML 툴을 활용하여 모델링을 하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.10A
• /
• pp.1546-1554
• /
• 1999

In this paper, Dynamic Fault Tree algorithm(DFT algorithm) is presented. This algorithm provides a concise representation of dynamic fault tolerance system including fault recovery techniques with fault detection, mask and switching function. And this algorithm define FDEP, CSP, SEQ, PAG gate which captures the dynamic characteristics of system. It show that this algorithm solved the constraints to satisfy the dynamic characteristics of system which there are in Markov and also this is able to satisfy the dynamic characteristics of system which there are in Markov and also this is able to covered the disadvantage of Fault tree methods. To show the key advantage of this algorithm, a traditional method, that is, Markov and Fault Tree, applies to TMR and Dual-Duplex systems with the dynamic characteristic and a presented method applies to those. He results proved that the DFT algorithm for solving the problems of the system is more effective than the Markov and Fault tree analysis model..