A Practical Optimization Framework for the Degree Distribution in LT Codes

Chih-Ming CHEN; Ying-ping CHEN; Tzu-Ching SHEN; John K. ZAO

doi:10.1587/transcom.E96.B.2807

A Practical Optimization Framework for the Degree Distribution in LT Codes

Chih-Ming CHEN, Ying-ping CHEN, Tzu-Ching SHEN, John K. ZAO

Full Text Views

0

Cite this

Summary :

LT codes are the first practical rateless codes whose reception overhead totally depends on the degree distribution adopted. The capability of LT codes with a particular degree distribution named robust soliton has been theoretically analyzed; it asymptotically approaches the optimum when the message length approaches infinity. However, real applications making use of LT codes have finite number of input symbols. It is quite important to refine degree distributions because there are distributions whose performance can exceed that of the robust soliton distribution for short message length. In this work, a practical framework that employs evolutionary algorithms is proposed to search for better degree distributions. Our experiments empirically prove that the proposed framework is robust and can customize degree distributions for LT codes with different message length. The decoding error probabilities of the distributions found in the experiments compare well with those of robust soliton distributions. The significant improvement of LT codes with the optimized degree distributions is demonstrated in the paper.

Publication: IEICE TRANSACTIONS on Communications Vol.E96-B No.11 pp.2807-2815

Publication Date: 2013/11/01

Publicized

Online ISSN: 1745-1345

DOI: 10.1587/transcom.E96.B.2807

Type of Manuscript: PAPER

Category: Fundamental Theories for Communications

Authors

Chih-Ming CHEN
  National Chiao Tung University
Ying-ping CHEN
  National Chiao Tung University
Tzu-Ching SHEN
  National Chiao Tung University
John K. ZAO
  National Chiao Tung University

Keyword

LT codes, degree distribution, forward error correction, evolutionary algorithms, digital fountain

Cite this

Copy

Chih-Ming CHEN, Ying-ping CHEN, Tzu-Ching SHEN, John K. ZAO, "A Practical Optimization Framework for the Degree Distribution in LT Codes" in IEICE TRANSACTIONS on Communications, vol. E96-B, no. 11, pp. 2807-2815, November 2013, doi: 10.1587/transcom.E96.B.2807.
Abstract: LT codes are the first practical rateless codes whose reception overhead totally depends on the degree distribution adopted. The capability of LT codes with a particular degree distribution named robust soliton has been theoretically analyzed; it asymptotically approaches the optimum when the message length approaches infinity. However, real applications making use of LT codes have finite number of input symbols. It is quite important to refine degree distributions because there are distributions whose performance can exceed that of the robust soliton distribution for short message length. In this work, a practical framework that employs evolutionary algorithms is proposed to search for better degree distributions. Our experiments empirically prove that the proposed framework is robust and can customize degree distributions for LT codes with different message length. The decoding error probabilities of the distributions found in the experiments compare well with those of robust soliton distributions. The significant improvement of LT codes with the optimized degree distributions is demonstrated in the paper.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E96.B.2807/_p

Copy

@ARTICLE{e96-b_11_2807,
author={Chih-Ming CHEN, Ying-ping CHEN, Tzu-Ching SHEN, John K. ZAO, },
journal={IEICE TRANSACTIONS on Communications},
title={A Practical Optimization Framework for the Degree Distribution in LT Codes},
year={2013},
volume={E96-B},
number={11},
pages={2807-2815},
abstract={LT codes are the first practical rateless codes whose reception overhead totally depends on the degree distribution adopted. The capability of LT codes with a particular degree distribution named robust soliton has been theoretically analyzed; it asymptotically approaches the optimum when the message length approaches infinity. However, real applications making use of LT codes have finite number of input symbols. It is quite important to refine degree distributions because there are distributions whose performance can exceed that of the robust soliton distribution for short message length. In this work, a practical framework that employs evolutionary algorithms is proposed to search for better degree distributions. Our experiments empirically prove that the proposed framework is robust and can customize degree distributions for LT codes with different message length. The decoding error probabilities of the distributions found in the experiments compare well with those of robust soliton distributions. The significant improvement of LT codes with the optimized degree distributions is demonstrated in the paper.},
keywords={},
doi={10.1587/transcom.E96.B.2807},
ISSN={1745-1345},
month={November},}

Copy

TY - JOUR
TI - A Practical Optimization Framework for the Degree Distribution in LT Codes
T2 - IEICE TRANSACTIONS on Communications
SP - 2807
EP - 2815
AU - Chih-Ming CHEN
AU - Ying-ping CHEN
AU - Tzu-Ching SHEN
AU - John K. ZAO
PY - 2013
DO - 10.1587/transcom.E96.B.2807
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E96-B
IS - 11
JA - IEICE TRANSACTIONS on Communications
Y1 - November 2013
AB - LT codes are the first practical rateless codes whose reception overhead totally depends on the degree distribution adopted. The capability of LT codes with a particular degree distribution named robust soliton has been theoretically analyzed; it asymptotically approaches the optimum when the message length approaches infinity. However, real applications making use of LT codes have finite number of input symbols. It is quite important to refine degree distributions because there are distributions whose performance can exceed that of the robust soliton distribution for short message length. In this work, a practical framework that employs evolutionary algorithms is proposed to search for better degree distributions. Our experiments empirically prove that the proposed framework is robust and can customize degree distributions for LT codes with different message length. The decoding error probabilities of the distributions found in the experiments compare well with those of robust soliton distributions. The significant improvement of LT codes with the optimized degree distributions is demonstrated in the paper.
ER -