完整後設資料紀錄
DC 欄位語言
dc.contributor.authorTsai, Pei-Chuanen_US
dc.contributor.authorChen, Chih-Mingen_US
dc.contributor.authorChen, Ying-pingen_US
dc.date.accessioned2014-12-08T15:29:04Z-
dc.date.available2014-12-08T15:29:04Z-
dc.date.issued2012en_US
dc.identifier.isbn978-1-4673-1509-8en_US
dc.identifier.urihttp://hdl.handle.net/11536/20975-
dc.description.abstractLuby 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.en_US
dc.language.isoen_USen_US
dc.titleSparse Degrees Analysis for LT Codes Optimizationen_US
dc.typeProceedings Paperen_US
dc.identifier.journal2012 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC)en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000312859300006-
顯示於類別:會議論文