• 한국보건간호학회지
• /
• 제13권1호
• /
• pp.88-96
• /
• 1999

This study was conducted in May of 1996 to December of 1996 in order to investigate the status of rubella antibodies in the women of childbearing age. The subjects were 543 fertile women (Ages 21-42 years). ELISA method was used for the detection of rubella antibodies and then questionaire survey was performed to know about the variables of past history of rubella. past rubella immunization. parity and cognition. The results were as follows: 1. The Positive rate of rubella Ig G antibody in total subjects was $65.0\%$. The positive rate of rubella Ig G antibody was $72.2\%$ in 21-25 age group. $71.4\%$ in 26-30 age group. $54.5\%$ in 31-35 age group, $52.6\%$ in 36-42 age group. As age increased, the positive rate of rubella Ig G antibody was decreased. There was statistically significant difference by age group(P=0.00l). In the subjects with a history of rubella immunization, the positive rate of rubella IgG antibody was $81.8\%$, and in those with past history of rubella was $83.3\%$ of positive rate. 2, Cognition rate about rubella immunization showed $50.8\%$ in total subjects. and there was no significant difference between parity and cognition rate of rubella immunization(P=0.85l). observed a low positive rate of rubella IgG antibody as compaired with other studies. Therefore, to prevent congenital rubella infection, rubella immunization was needed for unmarried women.

• 설비공학논문집
• /
• 제17권8호
• /
• pp.780-788
• /
• 2005

Two different types of algorithms were developed and applied to detect the partial faults of a multi-type air conditioning system. Partial faults include the compressor valve leakage, the refrigerant pipe partial blockage, the condenser fouling, and the evaporator fouling. The first algorithm was developed by using mathematical models and parity relations, and the second algorithm was developed by using mathematical models and a RBF neural network. Test results showed that the second algorithm was better than the first algorithm in detecting various partial faults of the system. Therefore, the algorithm developed by using mathematical models and a RBF neural network may be used for the detection of partial faults of an air-conditioning system.

• ETRI Journal
• /
• 제27권6호
• /
• pp.691-696
• /
• 2005

In asynchronous transfer mode (ATM) networks, fixed length cells of 53 bytes are transmitted. A cell may be discarded during transmission due to buffer overflow or a detection of errors. Cell discarding seriously degrades transmission quality. The quality degradation can be reduced by employing efficient forward error control (FEC) to recover discarded cells. In this paper, we present the design and implementation of decoding equipment for FEC in ATM networks based on a single parity check (SPC) product code using very-large-scale integration (VLSI) technology. FEC allows the destination to reconstruct missing data cells by using redundant parity cells that the source adds to each block of data cells. The functionality of the design has been tested using the Model Sim 5.7cXE Simulation Package. The design has been implemented for a $5{\times}5$ matrix of data cells in a Virtex-E XCV 3200E FG1156 device. The simulation and synthesis results show that the decoding function can be completed in 81 clock cycles with an optimum clock of 56.8 MHz. A test bench was written to study the performance of the decoder, and the results are presented.

• 대한전자공학회논문지TC
• /
• 제45권2호
• /
• pp.1-5
• /
• 2008

LDPC 구조는 1개의 개수가 적은 구조의 패리티 체크 행렬을 구성하여도, H행렬의 역행렬을 구하는 과정 중에 가우시안 소거법으로 인하여 H 행렬은 1의 개수가 적은 성질이 없어지고 계산량도 블록 크기 당 $n^2$의 계산량이 요구되어지고 있다. 그러므로 LDPC 패리티 체크 행려인 H는 좀 더 효율적인 부호화에 초점을 두고 개발되고 있다. 본 논문에서는 edge-by-edge 방법으로 체크 노드와 심볼 노드사이를 연결하거나 연결선을 정하는 것으로 큰 girth를 가지는 Tanner 그래프를 구성할 수 있는 PEG 알고리즘을 변형 시킨 M-PEG를 패리티 체크 행렬인 H를 구성하고 좀 더 효율적으로 부호화기를 구성할 수 있도록 dual-diagonal 형태를 지니는 H를 구성한다.

• 한국지능시스템학회논문지
• /
• 제19권2호
• /
• pp.180-184
• /
• 2009

저전력 환경에서의 메모리 집적도가 증가함에 따라 메모리는 soft error에 매우 민감해졌다. 오류 정정 코드는 일반적으로 양산 이후 메모리의 soft error를 수정하기 위해서 사용된다. 본 논문에서는 새로운 저전력 오류 정정 코드의 설계방법을 제안한다. 오류 정정 코드의 전력소비는 parity check 행렬의 선택을 통해 최소화 될 수 있다. 따라서 오류 정정 코드의 설계는 비선형 최적화 문제로 포함되는데 우리는 다양한 유전 연산자를 포함하는 유전자 알고리즘을 이용하여 이 문제를 해결한다. 제안하는 방법을 Hamming code와 Hsiao code에 적용하여 그 효율성을 입증하였다.

• Journal of Electrical Engineering and Technology
• /
• 제7권3호
• /
• pp.411-419
• /
• 2012

This paper proposes a new FDI(Fault Detection and Isolation) method, which is called EPSA(Extended Parity Space Approach). This method is particularly suitable for fault detection and isolation of the system with one faulty sensor or two faulty sensors. In the system with two faulty sensors, the fault detection and isolation probability may be decreased when two faults are occurred between the sensors related to the large fault direction angle. Nonetheless, the previously suggested FDI methods to treat the two-faults problem do not consider the effect of the large fault direction angle. In order to solve this problem, this paper analyzes the effect of the large fault direction angle and proposes how to increase the fault detection and isolation probability. For the increase the detection probability, this paper additionally considers the fault type that is not detected because of the cancellation of the fault biases by the large fault direction angle. Also for the increase the isolation probability, this paper suggests the additional isolation procedure in case of two-faults. EPSA helps that the user can know the exact fault situation. The proposed FDI method is verified through Monte Carlo simulation.

• Journal of Communications and Networks
• /
• 제17권6호
• /
• pp.582-591
• /
• 2015

A massive distributed storage system is the foundation for big data operations. Access latency performance is a key metric in distributed storage systems since it greatly impacts user experience while existing codes mainly focus on improving performance such as storage overhead and repair cost. By generating parity nodes from parity nodes, in this paper we design new XOR-based erasure codes hierarchical tree structure code (HTSC) and high failure tolerant HTSC (FH HTSC) to reduce access latency in distributed storage systems. By comparing with other popular and representative codes, we show that, under the same repair cost, HTSC and FH HTSC codes can reduce access latency while maintaining favorable performance in other metrics. In particular, under the same repair cost, FH HTSC can achieve lower access latency, higher or equal failure tolerance and lower computation cost compared with the representative codes while enjoying similar storage overhead. Accordingly, FH HTSC is a superior choice for applications requiring low access latency and outstanding failure tolerance capability at the same time.

• 한국통신학회논문지
• /
• 제35권4C호
• /
• pp.329-336
• /
• 2010

분산 소스 부호화 시스템은 복호복잡도가 높다는 문제점을 갖는다. 본 논문에서는 신드롬 기반의 분산 소스 부호인 low-density parity check accumulate (LDPCA) 부호의 복호복잡도를 효율적으로 낮추기 위하여 LDPC 부호에 사용되는 각종 정지조건을 LDPCA 복호기에 적용하고 이에 따른 복잡도를 평가하였다. 대표적으로 convergence of mean magnitude (CMM) 정지 조건을 적용하여, 정지 조건을 사용하지 않았을 때보다 압축부호율 손실을 2% 이하로 발생시키며 약 85%의 복호복잡도 감소 효과를 얻을 수 있었다. 더불어 사용되는 부호의 성능을 파악하고 있을 때 초기에 과잉 신드롬을 전송하는 방법과, 채널 정보가 얻기 힘든 경우 기존 정지조건을 부호율 적응적인 LDPCA 부호에 적합하게 수정하는 방법을 제안하였다.

• 대한전자공학회논문지SD
• /
• 제47권2호
• /
• pp.51-59
• /
• 2010

드모르간 및 재대입 논리변환은 unate gate network (UGN)을 보다 일반적인 balanced inversion parity (BIP) network으로 전환하는데 충분하다. 이러한 회로계층에 대해서도 자세히 논의하고 있다. 우리는 드모르간 및 재대입 논리변환이 경로지연고장 테스트집합을 유지한다는 것을 증명하였다. 본 논문의 결과를 이용하여 함수 z를 구현하는 모든 UGN에서 모든 경로지연고장을 검출하는 상위수준 테스트집합은 함수 z의 어떠한 BIP realization에서도 모든 경로지연고장을 검출한다는 것을 보일 수 있다.

• Journal of Communications and Networks
• /
• 제15권2호
• /
• pp.217-221
• /
• 2013

Quantum low-density parity-check (LDPC) codes based on the Calderbank-Shor-Steane construction have low encoding and decoding complexity. The sum-product algorithm(SPA) can be used to decode quantum LDPC codes; however, the decoding performance may be significantly decreased by the many four-cycles required by this type of quantum codes. All four-cycles can be eliminated using the entanglement-assisted formalism with maximally entangled states (ebits). The proposed entanglement-assisted quantum error-correcting code based on Euclidean geometry outperform differently structured quantum codes. However, the large number of ebits required to construct the entanglement-assisted formalism is a substantial obstacle to practical application. In this paper, we propose a novel class of entanglement-assisted quantum LDPC codes constructed using classical Euclidean geometry LDPC codes. Notably, the new codes require one copy of the ebit. Furthermore, we propose a construction scheme for a corresponding zigzag matrix and show that the algebraic structure of the codes could easily be expanded. A large class of quantum codes with various code lengths and code rates can be constructed. Our methods significantly improve the possibility of practical implementation of quantum error-correcting codes. Simulation results show that the entanglement-assisted quantum LDPC codes described in this study perform very well over a depolarizing channel with iterative decoding based on the SPA and that these codes outperform other quantum codes based on Euclidean geometries.