• 한국위성정보통신학회논문지
• /
• 제9권2호
• /
• pp.45-51
• /
• 2014

Luby transform (LT) 부호는 무율(rateless) 부호의 하나로써, 주어진 정보 길이에 대해 이론적으로 무한대의 부호어를 생성해 낼 수 있도록 설계된 부호이다. 이와 같은 무율부호는 방송 및 멀티캐스팅 서비스에서 수신자 별로 서로 다른 채널의 상황에 대비하여 사용될 수 있다는 점에서 효과적인 방식이다. 위성 시스템에서도 이와 같은 무율부호를 적용하는 여러 가지 경우에 대하여 연구가 진행 중이다. 본 논문에서는 이와 같은 연구 추세를 감안하여 무율부호 중 가장 먼저 개발된 LT 부호에 대한 하드웨어 구현을 위하여, VHDL을 이용하여 LT 부호의 구현 결과를 소개한다. 본 논문에서 제시된 결과는 향후 위성 시스템에서 무율 부호가 효과적으로 활용될 수 있는 기초적인 자료로 활용될 것이다.

• 한국통신학회논문지
• /
• 제36권9A호
• /
• pp.749-757
• /
• 2011

본 논문에서는 무선 네트워크 환경에서의 패킷 손실에 따른 영상 스트리밍 서비스의 영상 열화를 최소화 시키는 And-Or 트리 기반의 LT 패킷화 알고리즘을 제안한다. 심볼들의 효율적인 패킷화를 위해 And-Or 트리를 통한 심볼들 간의 관계를 분석하고 이 관계를 바탕으로 LT 부호화 심볼들이 포함된 패킷들 간의 의존성을 줄여 패킷손실에 대한 영향을 최소화 시키는 패킷화 알고리즘을 설계한다. 마지막으로 무선 네트워크 환경에서 영상 스트리밍 시스템을 통해 제안한 패킷화 알고리즘이 기존의 패킷화 알고리즘보다 더 향상된 복호화 성능과 영상 화질을 제공할 수 있음을 보인다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권4호
• /
• pp.748-766
• /
• 2013

In this paper, we consider an infrastructure-vehicle-vehicle (I2V2V) based Vehicle Ad-hoc Networks (VANETs), where one base station multicasts data to d vehicular users with the assistance of r vehicular users. A Distributed Luby Transform (DLT) codes based transmission scheme is proposed over lossy VANETs to reduce transmission latency. Furthermore, focusing on the degree distribution of DLT codes, a Modified Deconvolved Soliton Distribution (MDSD) is designed to further reduce the transmission latency and improve the transmission reliability. We investigate the network behavior of the transmission scheme with MDSD, called MDLT based scheme. Closed-form expressions of the transmission latency of the proposed schemes are derived. Performance simulation results show that DLT based scheme can reduce transmission latency significantly compared with traditional Automatic Repeat Request (ARQ) and Luby Transform (LT) codes based schemes. In contrast to DLT based scheme, the MDLT based scheme can further reduce transmission latency and improve FER performance substantially, when both the source-to-relay and relay-to-sink channels are erasure channels.

• 한국정보전자통신기술학회논문지
• /
• 제9권5호
• /
• pp.503-510
• /
• 2016

본 논문에서는 소규모 무선 센서 네트워크에서 데이터 저장을 위한 분산 LT 부호의 2 가지 복호 알고리즘의 성능을 시뮬레이션을 통해 분석하였다. 시뮬레이션 결과 복호율이 2.0 이상일 때 OBP 복호 알고리즘의 복호 성공 확률은 약 99%에 이르지만, BP 복호 방식의 경우 n=100일 때 약 50%를 하회하며 n=200일 때 약 70%에 이르는 것을 볼 수 있다. 따라서 소규모 무선 센서 네트워크에서 분산 저장을 위한 LT 부호의 복호 방식은 OBP 복호 방식이 크게 유리함을 알 수 있다.

• ETRI Journal
• /
• 제38권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.

• Journal of Communications and Networks
• /
• 제11권6호
• /
• pp.564-573
• /
• 2009

In this paper, we consider a wireless multiple path network in which a transmitting node would like to send a message to the receiving node with a certain probability of success. These two nodes are separated by N erasure paths, and we devise two algorithms to determine minimum redundancy and optimal symbol allocation for this setup. We discuss the case with N = 3 and then extend the case to an arbitrary number of paths. One of the algorithms minimum redundancy algorithm in exponential time is shown to be optimal in several cases, but has exponential running time. The other algorithm, minimum redundancy algorithm in polynomial time, is sub-optimal but has polynomial worstcase running time. These algorithms are based off the theory of maximum-distance separable codes. We apply the MRAET algorithm on maximum-distance separable, Luby transform, and Raptor codes and compare their performance.

• Journal of Communications and Networks
• /
• 제15권4호
• /
• pp.411-421
• /
• 2013

Digital fountain codes are record-breaking codes for erasure channels. They have many potential applications in both wired and wireless communications. Most existing digital fountain codes operate over binary fields using an iterative belief-propagation (BP) decoding algorithm. In this paper, we propose a new iterative decoding algorithm for both binary and nonbinary fields. The basic form of our proposed algorithm considers both degree-1 and degree-2 check nodes (instead of only degree-1 check nodes as in the original BP decoding scheme), and has linear complexity. Extensive simulation demonstrates that it outperforms the original BP decoding scheme, especially for a small number of source packets. The enhanced form of the proposed algorithm combines the basic form of the algorithm and a guess-based algorithm to further improve the decoding performance. Simulation results demonstrate that it can provide better decoding performance than the guess-based algorithm with fewer guesses, and can achieve decoding performance close to that of the maximum likelihood decoder at a much lower decoding complexity. Last, we show that our nonbinary scheme has the potential to outperform the binary scheme when choosing suitable degree distributions, and furthermore it is insensitive to the size of the Galois field.