Sparse degrees analysis for LT Codes Optimization

• Published in: 2012 IEEE Congress on Evolutionary Computation pp. 1 - 6
• Main Authors: Pei-Chuan Tsai, Chih-Ming Chen, Ying-ping Chen
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.06.2012
• Subjects: Decoding; Encoding; Error probability; Evolutionary computation; Optimization; Robustness; Solitons
• ISBN: 1467315109; 9781467315104
• ISSN: 1089-778X
• DOI: 10.1109/CEC.2012.6252861

Luby Transform (LT) codes are a new member in the family of forward error correction codes without a fixed code rate. The property called rateless is attractive to researchers in last decade, and lots of studies have been proposed and attempted to improve the performance of LT codes. One variation is the use of a sparse degree distribution instead of a full one referred to in the encoding process of LT codes to reduce the search space. Observing a fact that the ability of a sparse degree distribution is limited by the nonempty degrees, we introduce a tag selection scheme to choose reasonable sparse degrees for LT codes in this paper. We firstly investigate the influence of different degrees on the error rate of LT codes and then propose a general selection algorithm based on our observations. After that, the covariance matrix adaptation evolution strategy (CMA-ES) is applied to find the optimal sparse degree distributions of which the degrees are defined by our selection algorithm. Finally, the experimental results are presented as evidence to show the proposed scheme is effective and practical.