• ETRI Journal
• /
• v.38 no.5
• /
• pp.896-902
• /
• 2016

Luby transform (LT) codes were the first practical rateless erasure codes proposed in the literature. The performances of these codes, which are iteratively decoded using belief propagation algorithms, depend on the degree distribution used to generate the coded symbols. The existence of degree-one coded symbols is essential for the starting and continuation of the decoding process. The absence of a degree-one coded symbol at any instant of an iterative decoding operation results in decoding failure. To alleviate this problem, we proposed a method used in the absence of a degree-one code symbol to overcome a stuck decoding operation and its continuation. The simulation results show that the proposed approach provides a better performance than a conventional LT code and memory-based robust soliton distributed LT code, as well as that of a Gaussian elimination assisted LT code, particularly for short data lengths.

• Korean Journal of Clinical Pharmacy
• /
• v.28 no.1
• /
• pp.57-64
• /
• 2018

Background: Patients experience significant differences in aspects of mortality, quality of life, and costs between during the year of receiving liver transplant (LT) and the subsequent years (post-LT). This study aimed to estimate the medical utilization and cost of LT for patients compared to post-LT patients by using a recent National Patient Sample (NPS) data provided by the Korean Health Insurance Review and Assessment Service (HIRA). Methods: This study used a subset of the 2015 HIRA-NPS. Patient claims data that included Z944 (Korean Standard Classification of Diseases code for LT status) were selected. Within the selected data, LT patients were identified based on whether the national health insurance number code of Q80 (procedure code for LT surgery) was included, and they were compared to post-LT patients. Results: In the analysis, 330 patients were included. The average cost per patient was $90,066{\pm}36,959$ thousand KRW and $10,557{\pm}9,668$ thousand KRW for LT and post-LT patients, respectively. Especially, LT patients' costs for injection/procedure, surgery/treatment, and examination were higher than other costs, being $35,983{\pm}18,115$ thousand KRW, $28,246{\pm}9,408$ thousand KRW, and $12,131{\pm}6,604$ thousand KRW, respectively. For inpatients, the average number of hospitalized days was $63.5{\pm}66.0$ days for LT patients and $22.3{\pm}35.1$ days for post-LT patients. Conclusion: Compared to post-LT patients, LT patients had higher costs, especially for injection/procedure, surgery/treatment, and examination. Additionally, the LT group had longer hospitalization duration and higher costs for their hospital admission, whereas they did not show a significant difference in number of visits and medical costs for outpatient-care.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2010.07a
• /
• pp.112-115
• /
• 2010

본 논문은 그림 1과 같은 네트워크 환경에서 두 송신단이 LT code를 오류정정 부호로 사용할 때, 두 송신단이 생성하는 인코딩 심볼과 수신단이 수신하는 인코딩 심볼들의 degree distribution의 관계에 대해 다룬다. LT code를 복호하기 위해 belief propagation 방법을 사용했을 때, 수신단이 받은 인코딩 심볼들의 degree distribution은 robust soliton distribution(RSD)을 따를 때, overhead 대비 가장 높은 확률로 복호에 성공한다. 하지만 그림 1과 같은 네트워크 환경에서, 두 송신단 모두 RSD에 따라 인코딩 심볼을 생성하여 송신하면, 수신단에서 수신한 심볼은 RSD를 따르지 않는다. 본 논문은 한 송신단($S_1$) 이 생성하는 인코딩 심볼의 degree distribution을 알 때, 수신단에서의 인코딩 심볼의 분포가 근사적으로 RSD를 따르도록 하는 또 다른 송신단($S_2$)에서의 degree distribution을 구하는 방법을 제시한다.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.8 no.1
• /
• pp.65-70
• /
• 2013

In this paper, we propose the construction of Raptor code using LDGM code instead of LDPC code as precode. To see their merits, the simulations are done. The results show that the performance in case of using LDGM code is worse than that of using LDPC code as precode, and the complexity of encoding LDGM code is lower than that of LDPC.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.7 no.4
• /
• pp.223-228
• /
• 2014

It is known that a belief propagation algorithm is a fast decoding scheme for LT codes but it require a large overhead, especially for a short block length LT codes. In this paper an improved belief decoding algorithm using searching method for degree-1 packets is proposed for a small overhead. The proposed decoding scheme shows the desirable performance in terms of overhead while guaranteeing the same computational complexity with respect to the conventional BP decoding scheme.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.10 no.4
• /
• pp.117-125
• /
• 2014

In this paper, a novel hardware architecture of the LT codec is presented where non-BP based decoding algorithm is applied. Novel LT codec architecture is designed with an efficient degree distribution unit using Verilog HDL. To perform permutation operation, different initial valued or time shifted counters have been used to get pretty well permutations and an effect of randomness. The codec will take 128 bits as input and produce 256 encoded output bits. The simulation results show expected performances as the implemented distribution and the original distribution are pretty same. The proposed LT codec takes 257.5 cycle counts and $2.575{\mu}s$ for encoding and decoding instead of 5,204,861 minimum cycle counts and 4.43s of the design mentioned in the previous works where iterative soft BP decoding was used in ASIC and ASIP implementation of the LT codec.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.3
• /
• pp.441-447
• /
• 2020

In a situation in which around 50 million metric tons of electrical and electronic products is generated globally per year, the total installed base of Internet of Things (IoT) devices is projected to amount to around 75 billion worldwide by 2025. However, there is very little research on identification schemes for end-of-life treatment (EoLT) of IoT devices. To address this issue, this paper proposes new identifiers including EoLT information such as recyclability rate (Rcyc) and recoverability rate (Rcov) of an IoT device, recycling rate (RCR) and recovery rate (RVR) of each part in the IoT device, etc. and implements them by using object identifier (OID), mobile radio frequency identification (RFID) and quick response (QR) code. The implemented OID and mobile RFID can be used with cooperation of a remote server via communication networks and the implemented QR code can be used simply with a smartphone app.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.9 no.5
• /
• pp.503-510
• /
• 2016

In this paper I analyzed two decoding algorithms of decentralized LT codes for distributed storage by simulations in small-scale wireless sensor network. From the simulation results we can see that when the decoding ration is above 2.0, the successful decoding probability of OBP decoding is about 99%, while that of BP decoding is below 50% with n=100, and about 70% with n=200. We showed that OBP decoding algorithm is an efficient decoding scheme for decentralized LT codes for distributed storage in small-scale wireless sensor network.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.6
• /
• pp.57-62
• /
• 2011

In this paper an efficient LT decoding scheme using GE triangularization is proposed. The proposed algorithm has the desirable performance in terms of both overhead and computational complexity. Belief propagation algorithm is a fast and simple decoding scheme for LT codes. However, for a small code block length k, it requires a large overhead to decode, and OFG which has a small overhead has a large computational complexity. Simulation results show that the proposed algorithm noticeably reduces the computational complexity by more than 1/5 with respect to that of OFG and also its overhead has a small value about 1~5%.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.12 no.2
• /
• pp.1-10
• /
• 1975

This paper presents an adaptive data compression algorithm for video data. The coling complexity due to the high correlation in the given data sequence is alleviated by coding the difference data, sequence rather than the data sequence itself. The adaptation to the nonstationary statistics of the data is confined within a code set, which consists of two constant length cades and six modified Shannon.Fano codes. lt is assumed that the probability distributions of tile difference data sequence and of the data entropy are Laplacian and Gaussion, respectively. The adaptive coding performance is compared for two code selection criteria: entropy and $P_r$[difference value=0]=$P_0$. It is shown that data compression ratio 2 : 1 is achievable with the adaptive coding. The gain by the adaptive coding over the fixed coding is shown to be about 10% in compression ratio and 15% in code efficiency. In addition, $P_0$ is found to he not only a convenient criterion for code selection, but also such efficient a parameter as to perform almost like entropy.