完整後設資料紀錄
DC 欄位語言
dc.contributor.authorZao, John K.en_US
dc.contributor.authorHornansky, Martinen_US
dc.contributor.authorDiao, Pei-lunen_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/20977-
dc.description.abstractLuby Transform (LT) and its companion Raptor codes are the most popular implementations of digital fountain codes. Performance of these rateless forward erasure correction codes is determined mainly by the degree distributions of their encoded symbols. Although the asymptotic behaviors of LT codes with large (>10(5)) symbol blocks have been deduced analytically, a proficient method for finding the optimal degree distributions of short length (<10(3)) LT codes is still absent. In this paper, we propose a practical approach to employ evolution strategies in finding the degree distributions of optimal short-length LT codes for different applications. Our approach begins with the development of a new performance model for LT codes based on three measurements: coding overhead epsilon, failure ratio r and failure occurrence probability p. Three evolution strategies (DE, CMA-ES and NES) were then employed to minimize these performance measurements separately with careful design of fitness functions and necessary transformations of decision variables. Throughout the evolution process, the performance of individual LT code in the population was evaluated with numerical simulations. Our experiments showed that the optimal degree distributions can be found using all three evolution strategies but with different convergence rates and the (r, p, epsilon) values of these optimized codes are all distributed on a smooth concave surface.en_US
dc.language.isoen_USen_US
dc.subjectDigital Fountain Codesen_US
dc.subjectLuby Transform (LT)en_US
dc.subjectDifferential Evolution (DE)en_US
dc.subjectCovariance Matrix Adaptation - Evolution Strategy (CMA-ES)en_US
dc.subjectNatural Evolution Strategy (NES)en_US
dc.titleDesign of Optimal Short-Length LT Codes Using Evolution Strategiesen_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:000312859301073-
顯示於類別:會議論文