• Proceedings of the IEEK Conference
• /
• 2002.06a
• /
• 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
• /
• v.17 no.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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.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.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2
• /
• pp.497-506
• /
• 2000

RAID systems have been used as a mass storage system with high parallelism and availability. Especially RAID systems with parity declustering are widely studied as a technique to provide high fault tolerancy and availability by reducing performance degradation in case of disk fuilures. In this paper, a new organization of parity declustering with distributed spare units is proposed. And in normal mode where there are no failures, it is shown that these organization can improve the performance of RAID systems. By simulation methods, it is proved that the performance of RAID system in normal mode is improved by 5 to 15%.

• Bulletin of the Korean Chemical Society
• /
• v.10 no.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.

• Korea Trade Review
• /
• v.47 no.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.

• Journal of Broadcast Engineering
• /
• v.16 no.4
• /
• pp.635-646
• /
• 2011

In distributed video coding, low complexity encoder can be realized by shifting encoder-side complex processes to decoder-side. However, not only motion estimation/compensation processes but also complex LDPC decoding process are imposed to the Wyner-Ziv decoder, therefore decoder-side complexity has been one important issue to improve. LDPC decoding process consists of numerous iterative decoding processes, therefore complexity increases as the number of iteration increases. This iterative LDPC decoding process accounts for more than 60% of whole WZ decoding complexity, therefore it can be said to be a main target for complexity reduction. Previously, HDA (Hard Decision Aided) method is introduced for fast LDPC decoding process. For currently received parity bits, HDA method certainly reduces the complexity of decoding process, however, LDPC decoding process is still performed even with insufficient amount of parity request which cannot lead to successful LDPC decoding. Therefore, we can further reduce complexity by avoiding the decoding process for insufficient parity bits. In this paper, therefore, a parity request estimation method is proposed using bit plane-wise correlation and temporal correlation. Joint usage of HDA method and the proposed method achieves about 72% of complexity reduction in LDPC decoding process, while rate distortion performance is degraded only by -0.0275 dB in BDPSNR.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.12
• /
• pp.156-163
• /
• 2012

Recently, Information Hiding Technology are becoming increasingly demanding in the field of international security, military and medical image This paper proposes data hiding technique utilizing parity checker for gray level image. many researches have been adopted LSB substitution and XOR operation in the field of steganography for the low complexity, high embedding capacity and high image quality. But, LSB substitution methods are not secure through it's naive mechanism even though it achieves high embedding capacity. Proposed method replaces LSB of each pixel with XOR(between the parity check bit of other 7 MSBs and 1 Secret bit) within one pixel. As a result, stego-image(that is, steganogram) doesn't result in high image degradation. Eavesdropper couldn't easily detect the message embedding. This approach is applying the concept of symmetric-key encryption protocol onto steganography. Furthermore, 1bit of symmetric-key is generated by the self-reference of each pixel. Proposed method provide more 25% embedding rate against existing XOR operation-based methods and show the effect of the reversal rate of LSB about 2% improvement.

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

• Journal of Animal Science and Technology
• /
• v.51 no.2
• /
• pp.111-122
• /
• 2009

This study was performed to make it possible to adjust milk production records which are changing with days in milk more accurately as developing new 305-day adjustment factors considering current circumstance and to offer easier application by converting adjustment factors to formulas. Total 4,264,347 records were used in this analysis after eliminating unusual value and data was classified by first parity and over second parity. Herd-year effects were classified with 2,878 and 19,783 classes in first parity and over second parity, respectively and number of subclass of age-calving season-lactation stage effects were 136 (age 2, calving season 4, lactation stage 17). For calculation of least square mean, SAS GLM was used and multiplicative adjustment factors were developed. The result of error analysis, deviations between means of adjusted yields and cumulated yields were the lowest in new adjustment factor which was developed in this study comparing with other adjustment factors which were developed in the past (94', 02') in first parity and in over second parity, results of adjustment factors which were developed in 2002 and this study were similar. For easier application, formulas of 305-day adjustment factors were developed using SAS NLIN.