A Study on the Efficient LT Decoding Scheme using GE Triangularization

Abstract

Abstract 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 propagationalgorithm 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%. Key Words : Triangularization, On-the-fly Gaussian Elimination, Belief Propagation, Overhead, Computational complexity. * 정회원, 남서울대학교 정보통신공학과(교신저자)접수일자 2011.10.8, 수정완료 2011.11.16게재확정일자 2011.12.16 Ⅰ. 서 론 최근 erasure 채널을 통해 오류 없이 데이터를 전송하기 위한 FEC 부호로서 LT 부호와 Raptor 부호가 많은 관심을 받고 있다 [1] . BEC(binary erasure channel)는 erasure 채널의 대표적인 형태로 패킷 스위칭을 사용하는 유선 인터넷 망이 대표적인 예이다