• Nuclear Engineering and Technology
• /
• 제53권9호
• /
• pp.2775-2787
• /
• 2021

At present, most of the widely used system codes for nuclear safety analysis are one-dimensional, which cannot effectively simulate the flow field of the reactor core or other structures. This is true even for the system codes containing three-dimensional modules with limited three-dimensional simulation function such as RELAP-3D. In contrast, the computational fluid dynamics (CFD) codes excel at providing a detailed three-dimensional flow field of the reactor core or other components; however, the computational domain is relatively small and results in the very high computing resource consuming. Therefore, the development of coupling codes, which can make comprehensive use of the advantages of system and CFD codes, has become a research focus. In this paper, a review focus on the researches of coupled CFD and thermal-hydraulic system codes was carried out, which summarized the method of coupling, the data transfer processing between CFD and system codes, and the verification and validation (V&V) of coupled codes. Furthermore, a series of problems associated with the coupling procedure have been identified, which provide the general direction for the development and V&V efforts of coupled codes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권9호
• /
• pp.3458-3481
• /
• 2021

Existing methods for blind identification of linear block codes without a candidate set are mainly built on the Gauss elimination process. However, the fault tolerance will fall short when the intercepted bit error rate (BER) is too high. To address this issue, we apply the reverse algebra approach and propose a novel "two-step-screening" algorithm by solving the linear error equations on the binary Galois field, or GF(2). In the first step, a recursive matrix partition is implemented to solve the system linear error equations where the coefficient matrix is constructed by the full codewords which come from the intercepted noisy bitstream. This process is repeated to derive all those possible parity-checks. In the second step, a check matrix constructed by the intercepted codewords is applied to find the correct parity-checks out of all possible parity-checks solutions. This novel "two-step-screening" algorithm can be used in different codes like Hamming codes, BCH codes, LDPC codes, and quasi-cyclic LDPC codes. The simulation results have shown that it can highly improve the fault tolerance ability compared to the existing Gauss elimination process-based algorithms.

• 방송공학회논문지
• /
• 제8권4호
• /
• pp.437-451
• /
• 2003

With the rapid growth of internet technologies and wide availability of multimedia computing facilities, the enforcement of multimedia copyright protection becomes an important issue. Digital watermarking is viewed as an effective way to deter content users from illegal distributions. In recent years, digital watermarking has been intensively studied to achieve this goal. However, when the watermarked media is transmitted over the channels modeled as the additive white Gaussian noise (AWGN) channel, the watermark information is often interfered by the channel noise and produces a large number of errors. So many error-correcting codes have been applied in the digital watermarking system to protect the embedded message from the disturbance of the noise, such as BCH codes, Reef-Solomon (RS) codes and Turbo codes. Recently, low-density parity-check (LDPC) codes were demonstrated as good error correcting codes achieving near Shannon limit performance and outperforming turbo codes nth low decoding complexity. In this paper, in order to mitigate the channel conditions and improve the quality of watermark, we proposed the application of LDPC codes on implementing a fairly robust digital image watermarking system. The implemented watermarking system operates in the spectrum domain where a subset of the discrete wavelet transform (DWT) coefficients is modified by the watermark without using original image during watermark extraction. The quality of watermark is evaluated by taking Into account the trade-off between the chip-rate and the rate of LDPC codes. Many simulation results are presented in this paper, these results indicate that the quality of the watermark is improved greatly and the proposed system based on LDPC codes is very robust to attacks.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 추계종합학술대회 논문집(1)
• /
• pp.165-168
• /
• 2000

The bit error rate(BER)of the data passed through Wideband-Code Division Multiple Access (W-CDMA) system with turbo-codes structure is presented. The performance of turbo-codes under W-CDMA system is estimated for various users and iteration numbers of decoding. The channel model is Additive White Gaussian Noise(AWGN) and Rayleigh fading channel. When iteration number increases, bit error probability of turbo-codes decreases. and when the number of users increase, bit error probability of turbo-codes increases.

• 한국통신학회논문지
• /
• 제41권5호
• /
• pp.504-511
• /
• 2016

본 논문은 외부 부호로 DVB-S2 시스템에서 표준으로 제안된 LDPC 부호와 내부 부호로는 시공간 격자 부호를 사용하는 터보등화 방식의 MIMO 시스템을 제안한다. 시공간 격자 부호와 LDPC 복호기를 연접시킨 계층적 시공간 부호기는 duo-binary 터보 복호기와 연접시킨 터보 등화 방식과는 달리 LDPC 복호기의 내부에서만 반복 복호를 시행하여 성능이 저하되는 문제점을 가지고 있다. 이를 해결하기 위해 시공간 격자 부호화 방식을 BCJR 복호기를 적용하여 LDPC 복호기가 전체 반복을 통하여 성능을 향상시키는 방안을 제시하고 시뮬레이션 하였다. 시뮬레이션 결과 본 논문에서 제시하는 효율적인 연접 방식을 이용하면 기존 연판정 기반의 LDPC와 시공간 격자 부호를 연접하는 방식에 비하여 약 0.6 dB의 성능이 향상되었다.

• 웰빙융합연구
• /
• 제6권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.

• Journal of Preventive Medicine and Public Health
• /
• 제33권4호
• /
• pp.393-401
• /
• 2000

Objectives : To evaluate the impacts of the DRG payment system on the behavior of medical insurance claimants. Specifically, we evaluated the case-mix index, the numbers of diagnosis and procedure codes utilized, and the corresponding rate of diagnosis codes before, during and after implementation of the DRG payment system. Methods : In order to evaluate the case-mix index, the number of diagnosis and procedure codes utilized, we used medical insurance claim data from all medical facilities that participated in the DRG-based Prospective Payment Demonstration Program. This medical insurance claim data consisted of both pre-demonstration program data (fee-for-service, from November, 1998 to January, 1999) and post-demonstration program data (DRG-based Prospective Payment, from February, 1999 to April, 1999). And in order to evaluate the corresponding rate of diagnosis codes utilized, we reviewed 820 medical records from 20 medical institutes that were selected by random sampling methods. Results : The case-mix index rate decreased after the DRG-based Prospective Payment Demonstration Program was introduced. The average numbers of different claim diagnosis codes used decreased (new DRGs from 2.22 to 1.24, and previous DRGs from 1.69 to 1.21), as did the average number of claim procedure codes used (new DRGs from 3.02 to 2.16, and previous DRGs from 2.97 to 2.43). With respect to the time of participation in the program, the change in number of claim procedure codes was significant, but the change in number of claim diagnosis codes was not. The corresponding rate of claim diagnosis codes increased (from 57.5% to 82.6%), as did the exclusion rate of claim diagnosis codes (from 16.5% to 25.1%). Conclusions : After the implementation of the DRG payment system, the corresponding rate of insurance claim codes and the corresponding exclusion rate of claim diagnosis codes both increased, because the inducement system for entering the codes for claim review was changed.

• 한국항해항만학회지
• /
• 제36권10호
• /
• pp.845-849
• /
• 2012

차세대 무선통신에서는 다양한 서비스, 높은 신뢰도와 함께 빠른 전송속도를 요구한다. 이러한 요구를 만족시키기 위해서 시공간 격자부호와 터보 부호기를 결합시키는 계층적 시공간 부호기를 사용하였다. 계층적 시공간 부호기에서는 내부 부호와 외부 부호의 두 부호를 연속적으로 연접 시키는 방식이다. 내부 부호로는 DVB-RCS NG 시스템에서 표준으로 제안된 터보 Pi 부호를 사용하고, 외부 부호로는 Blum에 의해 제안된 시공간 격자 부호를 사용한다. 또한 효율적으로 두 부호기를 연접시키기 위하여 인터리버 기법을 사용한다. 그리고 기존의 복호 방법은 시공간 격자 부호와 터보 복호기 내부에서만 반복 복호를 하지만, 본 논문에서는 BCJR 복호기와 함께 전체 반복을 통하여 성능을 향상시키는 방안을 제시하고 시뮬레이션 하였다. 시뮬레이션 결과 본 논문에서 제시하는 효율적인 연접 방식을 이용하면 일반적인 연접 방식에 비하여 약 1.3~1.5dB의 성능이 향상되었다.

• 디지털산업정보학회논문지
• /
• 제8권1호
• /
• pp.147-155
• /
• 2012

Fountain codes ensure reliability and robustness for time varying channels in wireless communication. In this paper, the concatenated fountain codes for AWGN and slow fading channels are investigated. Wireless system model, which includes the concatenated fountain code and modulation, is proposed. Maximum achievable rate is used for analyzing the performance of the system model for AWGN and fading channels. Belief Propagation (BP) algorithm is used for exploiting the soft information received at the decoder. Simulation results show that, concatenated fountain codes performs significantly better than that of a conventional Fountain codes with large packet lengths for higher Signal to Noise Ratio (SNR) in slow fading channels.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -2
• /
• pp.1109-1112
• /
• 2002

A non-coherent synchronous all-optical code-division multiple-access (CDMA) network is proposed. In this network, symmetric codes derived from prime sequence codes are used. We present the construction of symmetric codes and show that the pseudo-orthogonality of the new codes is the same as that of the original prime-sequence codes while the cardinality of the new codes is larger than that of the prime sequence codes and the modified prime codes in the same field GF(p). Therefore, an optical CDMA LAN using symmetric codes can have a larger number of potential subscribers. The new codes allow designing fully programmable serial all-optical transmitter and receiver suitable for low-loss, high-capacity, optical CDMA LANs. It is also shown that compared to systems using modified prime codes the proposed system can achieve better BER performance for low received chip optical power.