• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.1
• /
• pp.189-195
• /
• 2008

The OFDMA Physical layer in the WiMAX standard of IEEE 802.16e adopts 114 LDPC codes with various code rates and block sizes as a channel coding scheme to meet varying channel environments and different requirements for transmission performance. In this paper, the performances of the LDPC codes are evaluated according to various code rates and block-lengths throueh simulation studies using min-sum decoding algorithm in AWGN chamois. As the block-length increases and the code rate decreases, the BER performance improves. In the cases with code rates of 2/3 and 3/4, where two different codes ate specified for each code rate, the codes with code rates of 2/3A and 3/4B outperform those of 2/3B and 3/4A, respectively. Through the statistical analyses of the number of decoding iterations the decoding complexity and the word error rates of LDPC codes are estimated. The results can be used to trade-off between the performance and the complexity in designs of LDPC decoders.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.9C
• /
• pp.841-847
• /
• 2009

In this paper we propose a high-performance Hybrid ARQ scheme employing Chase combining based on LDPC (Low-Density Parity-Check) codes. The proposed scheme uses symbol mapping diversity and turbo demodulation to improve decoding performance. We analyze the performance of the proposed scheme by EXIT (EXtrinsic Information Transfer) chart and compare its performance with several symbol mappings.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.87-88
• /
• 2007

In this paper, we propose a design of the layered coding with block turbo codes. The proposed scheme can be used efficiently for multimedia broadcasting and multicasting services by adaptive selection of a modulation and coding scheme at a receiver. This paper demonstrates various design examples of the layered coding using rate compatible block turbo codes.

• Journal of Wellbeing Management and Applied Psychology
• /
• v.6 no.3
• /
• pp.1-11
• /
• 2023

Purpose: This research aims to facilitate a smooth transition from KCD-8 to ICD-11 through the study of ICD-11. Research design, data and methodology: Skilled Health Information Managers (HIMs) in Korea performed manual mapping and conducted a study of the code structure of ICD-11 chapters 11 and 12. Results: When comparing the granularity between ICD-11 and KCD-8, 58.1% of ICD-11 codes showed higher granularity, and 38.6% had similar granularity. The granularity of the circulatory system was higher than that of the respiratory system. When comparing the KCD-8 codes mapped by ICD-11 with the total 924 KCD-8 codes, it was found that about 50% of KCD-8 codes were not mapped to ICD-11. This means that 50% of diseases in the KCD-8 do not have individual codes as they did in ICD-11. Conclusions: ICD-11 demonstrated high granularity, indicating its effectiveness in describing cutting-edge medical technology in modern society. However, we also observed that some diseases were removed from KCD-8, while others were added to ICD-11. To ensure smooth statistics transition from KCD8 to ICD-11, especially for leading domestic diseases, integrated management, including the preparation of KCD-9 reflecting ICD-11 and ICD-11 training, will be necessary through the analysis of new codes and the removal of codes.

• International conference on construction engineering and project management
• /
• 2009.05a
• /
• pp.316-322
• /
• 2009

The more repetitive, complex and objective the work, the more effective automation is. Code checking is an example of this. Checking building codes through a thick set of drawings is error-prone and time-consuming. In order to overcome this problem, several organizations have initiated efforts to automate building-code checking. Initiated study mainly focused on checking codes for invalidation, required size and crash, and then area of checkable codes have been expanding. But, it has not been considered for codes regarding anti-disaster/egress, which is also issued these days. This study is about how to automatically check codes for anti-disaster and egress based on Korea building codes. The codes can be categorized as five sections: egress way, material/capability, principals of evacuation, evacuation stairway and fire protection partition. To check automatically, there are problems, such as expression of codes for egress and limitation of extractable information from the BIM model. This paper shows what problems exist and assignments to be resolved. Also, current developing processes are presented, and suggestions are made about the direction for the work that remains.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.11 no.3
• /
• pp.45-51
• /
• 2015

In this paper, we discuss the belief propagation decoding algorithm for polar codes. The performance of Polar codes for shorter lengths is not satisfactory. Motivated by this, we propose a novel technique to improve its performance at short lengths. We showed that the probability of messages passed along the factor graph of polar codes, can be increased by multiplying the current message of nodes with their previous message. This is like a feedback path in which the present signal is updated by multiplying with its previous signal. Thus the experimental results show that performance of belief propagation polar decoder can be improved using this proposed technique. Simulation results in binary-input additive white Gaussian noise channel (BI-AWGNC) show that the proposed belief propagation polar decoder can provide significant gain of 2 dB over the original belief propagation polar decoder with code rate 0.5 and code length 128 at the bit error rate (BER) of $10^{-4}$.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.4C
• /
• pp.426-433
• /
• 2006

In this paper, we propose an incremental redundancy(IR)-hybrid ARQ(HARQ) scheme which uses double binary turbo codes for error correction. We also propose a methodology for basic analysis of the throughput which is a performance index of HARQ. The proposed double binary turbo IR-HARQ scheme provides higher throughput than binary IR-HARQ, which uses binary turbo codes for error correction, at all $E_s/N_0$. An extra coding gain is also attained by using the proposed HARQ scheme over the coding gain achieved by turbo codes only.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.4C
• /
• pp.324-330
• /
• 2006

The next generation mobile communication systems require error correcting schemes that can be adaptable to various code rates and lengths with negligible performance degradation. Serial concatenated convolutional codes can be a good candidate satisfying these requirements. In this paper, we propose new rate-compatible punctured serial concatenated convolutional code (RCPSCCC) which performs better than the RCPSCCC proposed by Chandran and Valenti in the sense of the rate compatibility. These codes are evaluated and analyzed by using computer simulation and SNR evolution technique. As their application, Type-II hybrid automatic repeat request (HARQ) schemes using both RCPSCCCs are constructed and new RCPSCCC is shown to have better throughput.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.10C
• /
• pp.937-945
• /
• 2009

In this paper, we investigate into the existence and various properties of absorbing sets in regular LDPC codes with variable node degree three. Also, we figure out the critical number of some absorbing sets that are believed to be the major cause of error floor in (3,5) Tanner LDPC codes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.1C
• /
• pp.1-8
• /
• 2005

In this paper, we present a novel LDPC code construction called as semi-algebra low density parity check(LDPC) codes which is one kind of deterministic LDPC code based on dual-diagonal sub-matrix. The constructing method results in a class of high rate LDPC codes. Codes in this class have a large girth and good minimum distances. Furthermore, they can be implemented by simple parallel array architecture using cyclic shift register and perform well with the iterative decoding.