TY - GEN
T1 - Sparse degrees analysis for LT codes optimization
AU - Tsai, Pei Chuan
AU - Chen, Chih Ming
AU - Chen, Ying-Ping
PY - 2012/10/4
Y1 - 2012/10/4
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84866848301&partnerID=8YFLogxK
U2 - 10.1109/CEC.2012.6252861
DO - 10.1109/CEC.2012.6252861
M3 - Conference contribution
AN - SCOPUS:84866848301
SN - 9781467315098
T3 - 2012 IEEE Congress on Evolutionary Computation, CEC 2012
BT - 2012 IEEE Congress on Evolutionary Computation, CEC 2012
T2 - 2012 IEEE Congress on Evolutionary Computation, CEC 2012
Y2 - 10 June 2012 through 15 June 2012
ER -