• 대한전기학회논문지
• /
• 제43권7호
• /
• pp.1169-1177
• /
• 1994

The function estimation characteristics of neural networks can be used sensor signal estimation of the nuclear power plants. In case of applying the neural network to the signal estimation of redundant sensors, it is an important problem that the redundant sensor signals used as the input signals of neural network should be validated. In this paper, we simplify the conventional parity space method in order to input the validated signal to the neural network and lso propose the sensor signal validation method, which estimates the reliable sensor output combining the neural network with the simplified parity space method. The acceptability of the proposed process variable estimation method is demonstrated by using the simulation data in safety injection accident of the nuclear power plant.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 하계종합학술대회 논문집(1)
• /
• pp.323-326
• /
• 2002

In this paper, we study the improved bounds on the performance of low-density parity-check (LDPC) codes over binary-input additive white Gaussian noise (AWGN) channels with belief propagation (BP) decoding in log domain. We define an extended Gallager ensemble based on a new method of constructing parity check matrix and make use of this way to improve upper bound of LDPC codes. At the same time, many simulation results are presented in this paper. These results indicate the extended Gallager ensembles based on Hamming codes have typical minimum distance ratio, which is very close to the asymptotic Gilbert Varshamov bound and the superior performance which is better than the original Gallager ensembles.

• Journal of Communications and Networks
• /
• 제17권2호
• /
• pp.157-161
• /
• 2015

A new block low-density parity-check (Block-LDPC) code based on quadratic permutation polynomials (QPPs) is proposed. The parity-check matrix of the Block-LDPC code is composed of a group of permutation submatrices that correspond to QPPs. The scheme provides a large range of implementable LDPC codes. Indeed, the most popular quasi-cyclic LDPC (QC-LDPC) codes are just a subset of this scheme. Simulation results indicate that the proposed scheme can offer similar error performance and implementation complexity as the popular QC-LDPC codes.

• 한국통신학회논문지
• /
• 제37A권12호
• /
• pp.1043-1053
• /
• 2012

In distributed video coding (DVC) systems, the complexity of encoders is greatly reduced by removing the motion estimation operations in encoders, since the correlation between frames is utilized in decoders. The transmission of parity bits is requested through the feedback channel, until the related errors are corrected to decode the Wyner-Ziv frames. The requirement to use the feedback channel limits the application of DVC systems. In this paper, we propose an efficient method to remove the feedback channel in DVC systems. First, a simple side information generation method is proposed to calculate the amount of parity bits in the encoder, and it is shown that the proposed method yields good performance with low complexity. Then, by calibrating the theoretical entropy with three parameters, we can calculate the amount of parity bits in the encoder and remove the feedback channel. Moreover, an adaptive method to determine quantization parameters for key frames is proposed. Extensive computer simulations show that the proposed method yields better performance than conventional methods.

• 한국정보처리학회논문지
• /
• 제7권2호
• /
• pp.497-506
• /
• 2000

RAID는 고 병렬성과 고 가용성을 목표로 하는 대용량 저장 매체를 구축하는 방법이다. 패리티 디클러스터링을 이용한 RAID는 특히 고장이 발생한 경우에도 성능의 저하를 최소화하여 고 결함 허용도 및 가용성을 높일 수 있는 저장 장치를 구축할 수 있는 기법으로 널리 연구되어 왔다. 본 논문에서는 이러한 패리티 디클러스터링을 사용한 RAID에 스페어 유닛을 분산시킨 새로운 구성을 제안하고, 특히 이러한 분산 스페어링이 고장이 없는 정상 상태에서도 성능 개선에 유용함을 보인다. 본 논문에서 제안된 방법의 유효성은 시뮬레이션 방식으로 입증하였으며, 전반적으로 정상상태의 성능을 5-15% 정도 높일 수 있음을 알 수 있다.

• Bulletin of the Korean Chemical Society
• /
• 제10권3호
• /
• pp.298-302
• /
• 1989

The strengths of two-photon transitions from the ground state to excited vibronic states in benzene are calculated by using the CNDO/2-U wave functions. The role of vibronic coupling in two-photon absorption process is discussed. The $A_{1{\bar{g}}}-A_{2g}^+$ two-photon transitions, which are forbidden by the identity-forbidden selection rule in single frequency two-photon absorption, are too weak to be experimentally observed even when two photons of different energies are used. It is because the transitions are forbidden also by the pseudo-parity selection rule which are applicable for alternant hydrocarbons such as benzene. It is also shown that the vibronic coupling is not very effective in altering the pseudo-parity property of the electronic state. The strength of the vibronically induced two-photon absorption is strongly affected by the presence of an electronic state from which two-photon absorption can borrow the intensity. It is pointed out that the pseudo-parity selection rule may be violated in such cases.

• 무역학회지
• /
• 제47권1호
• /
• pp.181-198
• /
• 2022

This paper investigates the arbitrage effect by the covered interest parity (CIP) deviation, as well as other push or pull factor effect on capital inflows and ouflows in the Korean bond market, by utilizing OLS, TSLS, IRF and VDC in EC model. The sample period covers February 2002 to December 2020. It is found that, the swap basis reflecting the CIP deviations have the significant effects on both debt investment inflows and debt investment outflows. Also, it is found that, the Korean risk factors have decreasing effects on foreigner's investment in the Korean bonds, while the global risk factors have decreasing effects on Korean resident's investment in the foreign bonds.

• 방송공학회논문지
• /
• 제16권4호
• /
• pp.635-646
• /
• 2011

분산 비디오 압축 기술은 부호화기의 복잡한 과정을 복호화기로 이동시킴으로써 저복잡도 부호화기를 가능하게 한다. 하지만 WZ 복호화기는 움직임 예측/보상 과정뿐만 아니라 채널 복호 과정까지 수행하기 때문에 복호화 과정의 높은 복잡도가 문제점으로 지적되고 있다. LDPC 부호의 복호화는 상당히 반복적인 과정으로 수행되기 때문에 그 수행 횟수만큼 복잡도가 늘어나는데, 실제로 이러한 반복적인 복호 과정은 전체 WZ 복호화 복잡도의 60% 이상을 차지하고 있기 때문에 복잡도 절감의 주요 대상이다. 따라서 이러한 복잡도 절감을 위해 과거에 HDA(Hard Decision Aided) 방법을 적용하는 방법이 제안되었다. HDA 방법은 해당 패리티에 대한 복호 과정의 복잡도를 상당량 줄여주지만, 채널 복호가 성공하기에 부족한 패리티량에 대해서도 여전히 복호 과정을 수행하는 문제점을 가지고 있다. 따라서 이러한 소모적인 과정을 줄임으로써 추가적인 복잡도 절감 효과를 얻을 수 있다. 이에 본 논문에서는 비트 플레인 간의 상관도와 시간적 상관도에 기반하여 최소 연산으로 패리티 요구량을 예측하는 방법을 제안한다. 제안 방법과 HDA 방법을 함께 적용할 경우 채널 복호 과정에서는 평균 72% 정도의 고속 복호가 가능하며, 저하되는 율 왜곡 성능은 -0.0275 dB (BDPSNR) 정도로상당히 낮다.

• 전자공학회논문지
• /
• 제49권12호
• /
• pp.156-163
• /
• 2012

최근 들어 정보은닉기술에 대한 필요성이 많이 증가되고 있으며 국제치안, 군사 그리고 의료영상 등의 분야에서 그 예를 많이 볼 수 있다. 본 논문에서는 한 픽셀의 다수 MSB(MSBs: Most Significant Bits)의 Parity Bit를 이용하여 gray영상에 대해 정보를 은닉하는 방법을 제안한다. 스테가노그라피(Steganography) 분야에서 많은 연구들이 LSB 대체(Substitution), XOR연산을 채용하여 연구되어왔으며 궁극적인 목적은 낮은 복잡도와 높은 은닉용량, 동시에 화질의 저하를 최소화하는 것이다. 하지만 LSB 대체 방법은 높은 은닉용량을 가짐에도 불구하고 너무나 간단한 작업으로 인해 안전하지 못하다. 또한 XOR연산을 이용한 방법들은 픽셀 수 대비 약 75%의 은닉률을 달성하였다. 제안된 방법에서 각 픽셀의 LSB(Least Significant Bit)는 비밀메시지 1비트와 해당 픽셀의 7 MSBs의 Parity Bit와 XOR 연산된다. 제안한 방법은 대칭키 프로토콜의 개념을 스테가노그라피에 적용한 것이며 대칭키를 자기참조에 의해 생성하도록 하였다. 제시한 방법은 기존의 XOR방법들에 비해 은닉률이 25% 높으며 원본 대비 픽셀의 LSB 반전률이 약 6%정도 개선되는 효과를 보였다.

• Journal of Communications and Networks
• /
• 제10권1호
• /
• pp.5-9
• /
• 2008

Researchers have investigated many upper bound techniques applicable to error probabilities on the maximum likelihood (ML) decoding performance of turbo-like codes and low density parity check (LDPC) codes in recent years for a long codeword block size. This is because it is trivial for a short codeword block size. Previous research efforts, such as the simple bound technique [20] recently proposed, developed upper bounds for LDPC codes and turbo-like codes using ensemble codes or the uniformly interleaved assumption. This assumption bounds the performance averaged over all ensemble codes or all interleavers. Another previous research effort [21] obtained the upper bound of turbo-like code with a particular interleaver using a truncated union bound which requires information of the minimum Hamming distance and the number of codewords with the minimum Hamming distance. However, it gives the reliable bound only in the region of the error floor where the minimum Hamming distance is dominant, i.e., in the region of high signal-to-noise ratios. Therefore, currently an upper bound on ML decoding performance for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix cannot be calculated because of heavy complexity so that only average bounds for ensemble codes can be obtained using a uniform interleaver assumption. In this paper, we propose a new bound technique on ML decoding performance for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix using ML estimated weight distributions and we also show that the practical iterative decoding performance is approximately suboptimal in ML sense because the simulation performance of iterative decoding is worse than the proposed upper bound and no wonder, even worse than ML decoding performance. In order to show this point, we compare the simulation results with the proposed upper bound and previous bounds. The proposed bound technique is based on the simple bound with an approximate weight distribution including several exact smallest distance terms, not with the ensemble distribution or the uniform interleaver assumption. This technique also shows a tighter upper bound than any other previous bound techniques for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix.