• ETRI Journal
• /
• 제35권3호
• /
• pp.439-447
• /
• 2013

To increase device memory yield, many manufacturers use incorporated redundancy to replace faulty cells. In this redundancy technology, the implementation of an effective redundancy analysis (RA) algorithm is essential. Various RA algorithms have been developed to repair faults in memory. However, nearly all of these RA algorithms have low analysis speeds. The more densely compacted the memory is, the more testing and repair time is needed. Even if the analysis speed is very high, the RA algorithm would be useless if it did not have a normalized repair rate of 100%. In addition, when the number of added spares is increased in the memory, then the memory space that must be searched with the RA algorithms can exceed the memory space within the automatic test equipment. A very efficient RA algorithm using simple calculations is proposed in this work so as to minimize both the repair time and memory consumption. In addition, the proposed algorithm generates an optimal solution using a tree-based algorithm in each fault group. Our experiment results show that the proposed RA algorithm is very efficient in terms of speed and repair.

• Journal of Advanced Marine Engineering and Technology
• /
• 제38권8호
• /
• pp.1004-1009
• /
• 2014

The redundancy allocation problem has usually considered only the component redundancy at the lowest-level for the enhancement of system reliability. A system can be functionally decomposed into system, module, and component levels. Modular redundancy can be more effective than component redundancy at the lowest-level because in modular systems, duplicating a module composed of several components can be easier, and requires less time and skill. We consider a multi-level redundancy allocation problem in which all cases of redundancy for system, module, and component levels are considered. A tabu search of memory-based mechanisms that balances intensification with diversification via the short-term and long-term memory is proposed for its solution. To the best of our knowledge, this is the first attempt to use a tabu search for this problem. Our tabu search algorithm is compared with the previous genetic algorithm for the problem on the new composed test problems as well as the benchmark problems from the literature. Computational results show that the proposed method outstandingly outperforms the genetic algorithm for almost all test problems.

• 대한전자공학회논문지SD
• /
• 제39권12호
• /
• pp.1022-1032
• /
• 2002

테스트와 동시에 오류 비트의 수와 위치를 파악하도록 하여 redundancy 프로그래밍이 용이한 다수 비트 출력 DRAM을 위한 BIST 구조가 소개되었다. 일반적으로, DRAM 셀이 n개의 블록으로 구성된 경우에, 단지 n개의 비교기와 한 개의 3가지 상태 엔코더를 사용하여, 무오류 상태, 한 개의 오류가 있을 경우, 오류상태 및 오류비트가 존재하는 블록의 위치, 두개의 블록에 오류가 있을 경우 오류 상태 등 총 n ＋ 2개의 상태를 나타낼 수 있다. 제안된 방법을 통하여, 두개 이상의 블록에 오류가 있을 경우, 오류 비트의 위치와 수를 파악하는 방법으로 용이하게 확장 구현가능하다. 8블록으로 구성된 64MEG DRAM 경우의 성능 비교 결과 단지 0.115%의 칩 면적 증가로, 테스트 및 redundancy 프로그래밍 시간이 1/750로 감소하였다.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2000년도 추계학술대회 논문집
• /
• pp.717-720
• /
• 2000

Event-driven communication protocols such as CAN(Controller Area Network) have inherent packet delays due to the contention process for the use of network medium. These delays are stochastic in nature because most packets arrive at random time instants. The stochastic property of the delay adversely influences the control system's performance in terms of stability, responsiveness and steady-state error. Another problem for safety-critical application such as brake-by-wire systems is the reliability of the communication modules that can fail abruptly. This paper deals with two methods to overcome the above problems : (i) scheduling method that can maintain packet delays under some acceptable level, and (ii) redundancy management of communication modules that prescribes dual-redundancy modules' behavior when one of them fails.

• 한국신뢰성학회:학술대회논문집
• /
• 한국신뢰성학회 2000년도 추계학술대회
• /
• pp.399-404
• /
• 2000

Redundancy allocation problems have been considered at single-level systems and it may be the best policy in some specific situations, but not in general. With regards to reliability, it is most effective to allocate the lowest objects, because parallel-series systems are more reliable than series-parallel systems. However, the smaller and tower in the system an object is, the more time and accuracy are needed for duplicating it, and so, the cost can be decreased by using modular redundancy. Therefore, providing redundancy at high levels like as modules or subsystems, can be more economical than providing redundancy at low levels or duplicating components. In this paper, the problem in which redundancy is allocated at all level in a series system is addressed, a mixed integer nonlinear programming model is presented and genetic algorithm is proposed. An example illustrates the procedure.

• 산업공학
• /
• 제25권2호
• /
• pp.153-162
• /
• 2012

The reliability is defined as a probability that a system will operate properly for a specified period of time under the design operating conditions without failure and it has been considered as one of the major design parameters in the field of industries. Reliability-Redundancy Optimization Problem(RROP) involves selec tion of components with multiple choices and redundancy levels for maximizing system reliability with constraints such as cost, weight, etc. However, in practice both active and cold standby redundancies may be used within a particular system design. Therefore, a redundancy strategy(active, cold standby) for each subsystem in order to maximize system reliability is considered in this study. Due to the nature of RROP, i.e. NP-hard problem, A Parallel Particle Swarm Optimization(PPSO) algorithm is proposed to solve the mathematical programming model and it gives consistently better quality solutions than existing studies for benchmark problems.

• 품질경영학회지
• /
• 제47권4호
• /
• pp.701-711
• /
• 2019

Purpose: The problem of optimizing redundancy allocation in multi-level systems is considered when each item in a multi-level system has alternative items with the same function. The number of redundancy of multi-level system is allocated to maximize the reliability of the system under path set and cost limitation constraints. Methods: Based on cost limitation and path set constraints, a mathematical model is established to maximize system reliability. Particle swarm optimization is employed for redundant allocation and verified by numerical experiments. Results: Comparing the particle swarm optimization method and the memetic algorithm for the 3 and 4 level systems, the particle swarm optimization method showed better performance for solution quality and search time. Particularly, the particle swarm optimization showed much less than the memetic algorithm for variation of results. Conclusion: The proposed particle swarm optimization considerably shortens the time to search for a feasible solution in MRAP with path set constraints. PS optimization is expected to reduce search time and propose the better solution for various problems related to MRAP.

• 한국음향학회지
• /
• 제31권7호
• /
• pp.427-434
• /
• 2012

WSOLA 방식은 음성 신호의 시간축 변환을 위한 고음질의 효율적인 알고리즘으로 알려져 있다. WSOLA의 계산량은 두 신호 파형 사이의 유사도를 평가하는 반복적인 정규상호상관도 계산에 집중되어 있다. 본 논문은 WSOLA 계산량 감축을 위해 고속의 정규상호상관도 계산 방법을 제안하며, 제안된 방법에서는 미리 계산된 합 테이블을 통해 인접한 구간에서의 반복적인 정규상호상관도 계산의 중복성을 제거한다. 정규상호상관도의 분모 부분은 시간축 변환 비율에 관계없이 높은 중복성을 가지는데 반해, 분자 부분은 보다 낮은 중복성을 가지며 중복 정도가 시간축 변환 비율과 최적 이동값에 의해 영향을 받기 때문에 고속 계산을 위해 보다 복잡한 알고리즘이 요구된다. 시뮬레이션 결과, 제안된 방법이 기존의 WSOLA와 완전히 동일한 음질을 유지하면서도 시간축 압축의 경우 약 40%, 그리고 1/2배속 및 1/3배속으로의 시간축 신장의 경우 각각 약 47% 및 52%의 실행시간을 감소시킴을 보인다.

• 정보처리학회논문지A
• /
• 제13A권5호
• /
• pp.421-428
• /
• 2006

본 논문에서는 복잡해져 가는 제어 컴퓨터의 높은 신뢰성 확보를 위해 시간 여분(time redundancy)의 일종인 재실행과 rollback 기법을 TMR 구조에 적절하게 혼용하는 방법을 제안한다 재실행과 rollback 기법은 약간의 추가 시간만으로 재구성(reconfiguration) 없이도 일시적인 결함(fault)에 의해 발생한 TMR 고장(failure)의 회복을 위해 상호 보완적으로 사용될 수 있다. 이를 위해 고장 검출시 가능한 모든 시스템의 고장상태 확률을 추정하였으며, 이를 바탕으로 전체 작업의 평균 실행시간이 최소가 되는 최적의 재실행과 rollback 횟수를 유도하였다. 또한 제안된 방법과 다른 고장회복 기법을 적용했을 때의 평균 실행 시간을 정량적으로 비교하여 그 우수성을 검증하였다.

• 조명전기설비학회논문지
• /
• 제26권7호
• /
• pp.99-109
• /
• 2012

Sub-station, key equipment in electric power infrastructure, are being exposed to increasing risk of hacking. For this, soft redundancy sub-station system needs to be formulated with automatic restoration mechanism. For this it is important to assess the reliability of the applicable range of data that are used in actual system operation, as well as the methods and findings of the tests. At the same time performance of soft redundancy system and total security mechanism, which are aligned for the protection of the sub-station, need to be tested. For testing the above-mentioned, this paper presented a viable formation of a soft redundancy practical VPN system within a panel to protect the latter from hacking or cracking incidences, and conducts a test to check if the considered system actually serves the protection function in the actual operation setting, gathering evidence from the data from the testing of the actual performance of the system as well as of emergency scenario simulation operations. Because tested soft-redundancy & restorative sub-station system is expected to be widely applicable for various cases such as Smart-grid or electricity IT system, where VPN with enhanced level of security is required.