JKJae-Won Kim

Jae-Won Kim

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Jae-Won Kim has a total of 27 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Decoding of LDPC Codes Using Singularity of SNR Mismatch Over AWGN Channel

    by Hong-Jae Jeong, Jae-Won Kim

    In this paper, we propose a new decoding algorithm that guarantees superior decoding performances for low-density parity-check (LDPC) codes without knowledge of channel parameters. Although obtaining correct channel parameters is very difficult in low-latency and energy-efficient communication systems, most studies on LDPC codes assume perfect knowledge of channel parameters. While receivers can obtain correct channel parameters by utilizing numerous pilot signals, increased overhead makes them infeasible in practical systems. In addition, using incorrect channel parameters for decoding usually degrades decoding performances. These challenges highlight the need for a new decoder that performs reliably without correct channel parameters. Meanwhile, the previous studies on repeat-accumulate (RA) codes and LDPC codes have observed that the signal-to-noise ratio (SNR) mismatch sometimes enhances decoding performances when the maximum number of decoding iterations is small. Inspired by these observations, we investigate singularity of the SNR mismatch in LDPC codes from numerous frame error rate (FER) simulations. By utilizing this singularity, we propose a new decoding algorithm for the energy-efficient communication system, where correct channel parameters are not available at receivers. The proposed decoder shows a performance gain of 0.25 dB at FER = 10−6 compared to the conventional belief propagation (BP) algorithm.

  • Open Access

    Modified CC-PEG Algorithm for Protograph-Based QC-LDPC Codes Over Non-Uniform Channel

    by Hyeon-Bhin Lee, Jae-Won Kim

    In this paper, we propose the modified cycle-concentrating progressive-edge-growth (CC-PEG) algorithm for lifting protograph-based quasi-cyclic low-density parity-check (QC-LDPC) codes over the non-uniform additive white Gaussian noise (AWGN) channel. By introducing various selection criteria for shift values based on the non-uniform channel characteristics, we improve the decoding performances of lifted LDPC codes. From numerous simulation results, we demonstrate that each selection criterion is effective for the performance improvement and the modified CC-PEG algorithm outperforms the conventional lifting methods over the non-uniform AWGN channel. Furthermore, we analyze these simulation results based on some metrics such as the girth, number of cycles, and approximate cycle extrinsic message degree (ACE).


  • Design of DNA Storage Coding Scheme With LDPC Codes and Interleaving

    by Jae-Won Kim, Jaeho Jeong, Hee-Youl Kwak, Jong-Seon No

    In this paper, we propose a new coding scheme for DNA storage using low-density parity-check (LDPC) codes and interleaving techniques. While conventional coding schemes generally employ error correcting codes in both inter and intra-oligo directions, we show that inter-oligo LDPC codes, optimized by differential evolution, are sufficient in ensuring the reliability of DNA storage due to the powerful soft decoding of LDPC codes . In addition, we apply interleaving techniques for handling non-uniform error characteristics of DNA storage to enhance the decoding performance. Consequently, the proposed coding scheme reduces the required number of oligo reads for perfect recovery by 26.25% ~ 38.5% compared to existing state-of-the-art coding schemes. Moreover, we develop an analytical DNA channel model in terms of non-uniform binary symmetric channels. This mathematical model allows us to demonstrate the superiority of the proposed coding scheme while isolating the experimental variation, as well as confirm the independent effects of LDPC codes and interleaving techniques.


  • PD-GLDPC Codes With Degree-1 Variable Nodes and Multi-Types of Component Codes

    by Jae-Won Kim, Jaewha Kim, Hee-Youl Kwak, Jong-Seon No

    In this letter, we propose a new design method for protograph-based partially doped generalized low-density parity-check (PD-GLDPC) codes over the binary erasure channel (BEC). By extending the block-error threshold condition proposed by A. K. Pradhan et al . for conventional GLDPC codes, we optimize medium to high-rate PD-GLDPC codes with degree-1 variable nodes and multi-types of component codes (MCC). It is shown that the optimized PD-GLDPC codes outperform the conventional LDPC and GLDPC codes at the frame error rate 10 -4 over the BEC while having comparable decoding complexity.


  • Iterative Soft Decoding Algorithm for DNA Storage Using Quality Score and Redecoding

    by Jaeho Jeong, Hosung Park, Hee-Youl Kwak, Jong-Seon No, Hahyeon Jeon, Jeong Wook Lee, Jae-Won Kim

    Ever since deoxyribonucleic acid (DNA) was considered as a next-generation data-storage medium, lots of research efforts have been made to correct errors occurred during the synthesis, storage, and sequencing processes using error correcting codes (ECCs). Previous works on recovering the data from the sequenced DNA pool with errors have utilized hard decoding algorithms based on a majority decision rule. To improve the correction capability of ECCs and robustness of the DNA storage system, we propose a new iterative soft decoding algorithm, where soft information is obtained from FASTQ files and channel statistics. In particular, we propose a new formula for log-likelihood ratio (LLR) calculation using quality scores (Q-scores) and a redecoding method which may be suitable for the error correction and detection in the DNA sequencing area. Based on the widely adopted encoding scheme of the fountain code structure proposed by Erlich et al ., we use three different sets of sequenced data to show consistency for the performance evaluation. The proposed soft decoding algorithm gives 2.3%~7.0% improvement of the reading number reduction compared to the state-of-the-art decoding method and it is shown that it can deal with erroneous sequenced oligo reads with insertion and deletion errors.


  • Open Access

    The Cycle-Concentrating PEG Algorithm for Protograph Generalized LDPC Codes

    by Dae-Young Yun, Jae-Won Kim, Hee-Youl Kwak, Jong-Seon No

    In this paper, we propose the cycle-concentrating progressive edge growth (CC-PEG) algorithm for lifting protograph generalized low-density parity-check (GLDPC) codes. In GLDPC codes, undoped variable nodes (VNs) that are not connected to generalized constraint (GC) nodes are more vulnerable to channel errors than doped VNs protected by GC nodes.We observe that among GLDPC codes sharing the same protograph structure, codes with fewer local cycles at undoped VNs have better decoding performances. Inspired by this observation, the CC-PEG algorithm is proposed to concentrate local cycles at doped VNs and avoid local cycles at vulnerable undoped VNs during the lifting process. Specifically, the CC-PEG algorithm first collects edges that result in the maximum undoped girth , defined as the length of the shortest cycle containing undoped VNs. Following this, the CC-PEG algorithm selects the edge with the lowest concentrated cycle metric . Consequently, the lifted codes exhibit asymmetric cycle distributions concentrated around robust doped VNs. Simulation results for various protographs show that the CC-PEG algorithm achieves a performance gain of up to 20 times lower frame error rate compared to conventional lifting algorithms.


  • Open Access

    Generative Adversarial Networks for DNA Storage Channel Simulator

    by Sanghoon Kang, Yunfei Gao, Jaeho Jeong, Seong-Joon Park, Jae-Won Kim, Jong-Seon No, Hahyeon Jeon, Jeong Wook Lee, Sung Hwan Kim, Hosung Park, et al.

    DNA data storage systems have rapidly developed with novel error-correcting techniques, random access algorithms, and query systems. However, designing an algorithm for DNA storage systems is challenging, mainly due to the unpredictable nature of errors and the extremely high price of experiments. Thus, a simulator is of interest that can imitate the error statistics of a DNA storage system and replace the experiments in developing processes. We introduce novel generative adversarial networks that learn DNA storage channel statistics. Our simulator takes oligos (DNA sequences to write) as an input and generates a FASTQ file that includes output DNA reads and quality scores as if the oligos are synthesized and sequenced. We trained the proposed simulator with data from a single experiment consisting of 14,400 input oligo strands and 12,108,573 output reads. The error statistics between the input and the output of the trained generator match the actual error statistics, including the error rate at each position, the number of errors for each nucleotide, and high-order statistics. The code is available at https://github.com/gyfbianhuanyun/DNA_storage_simulator_GAN.