• Journal of Korean Public Health Nursing
• /
• v.13 no.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.

• Korean Journal of Air-Conditioning and Refrigeration Engineering
• /
• v.17 no.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
• /
• v.27 no.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.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.2
• /
• pp.1-5
• /
• 2008

Although we can make a sparse matrices for LDPC codes, the encoding complexity per a block increases quadratically by $n^2$. We propose modified PEG algorithm using PEG algorithm having a large girth by establishing edges or connections between symbol and check nodes in an edge-by-edge manner. M-PEG construct parity check matrices. So we propose parity check matrices H form a dual-diagonal matrices that can construct a more efficient decoder using a M-PEG(modified Progressive Edge Growth).

• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.2
• /
• pp.180-184
• /
• 2009

The memory is very sensitive to the soft error because the integration of the memory increases under low power environment. Error correcting codes (ECCs) are commonly used to protect against the soft errors. This paper proposes a new genetic ECC design method which reduces power consumption. Power is minimized using the degrees of freedom in selecting the parity check matrix of the ECCs. Therefore, the genetic algorithm which has the novel genetic operators tailored for this formulation is employed to solve the non-linear power optimization problem. Experiments are performed with Hamming code and Hsiao code to illustrate the performance of the proposed method.

• Journal of Electrical Engineering and Technology
• /
• v.7 no.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
• /
• v.17 no.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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.4C
• /
• pp.329-336
• /
• 2010

Distributed source coding (DSC) system moves computational burden from encoder to decoder, so it takes higher decoding complexity. This paper explores the problem of reducing the decoding complexity of practical Slepian-Wolf coding using low-density parity check accumulate (LDPCA) codes. It is shown that the convergence of mean magnitude (CMM) stopping criteria for LDPC codes help reduce the 85% of decoding complexity under the 2% of compression rate loss, and marginal initial rate request reduces complexity below complexity minimum bound. Moreover, inter-rate stopping criterion, modified for rate-adaptable characteristic, is proposed for LDPCA codes, and it makes decoder perform less iterative decoding than normal stopping criterion does when channel characteristic is unknown.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.47 no.2
• /
• pp.51-59
• /
• 2010

Two logic transformations, De Morgan and re-substitution, are sufficient to convert a unate gate network (UGN) to a more general balanced inversion parity (BIP) network. Circuit classes of interest are discussed in detail. We prove that De Morgan and re-substitution transformations are test-set preserving for path delay faults. Using the results of this paper, we can easily show that a high-level test set for a function z that detects all path delay faults in any UGN realizing z also detects all path delay faults in any BIP realization of z.

• Journal of Communications and Networks
• /
• v.15 no.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.