以演化計算之機制與工具對LT Codes進行改良之研究

噴泉碼(digital fountain)是近年來被提出的一種錯誤糾正碼類別。它最重要的一項性質為無固定編碼率(ratelessness)，其特色是不需要一個固定的編碼率而編碼封包可以無限制地產生。對於任何想要接收資料的接收端，只要收集一定數量的編碼資訊即可完整解出原始資料，且不需要顧慮收到的封包順序。其相對應的好處是接收端不需要回傳訊息的傳輸通道來處理封包遺失的問題，因此同時面對多個傳輸品質不同的接收端也可以用同一套編碼程序。這個特性使噴泉碼十分適合做為網路廣播系統或是需要在異質網路環境間傳輸資料的應用。盧比變換碼(Luby Transform Codes)是第一個真正可實用的噴泉碼。它於2002年被提出，許多的現實應用便開始嘗試以噴泉碼作為解決方案，也因此對於盧比變換碼的改良研究也變成一個很熱門的議題。本論文整合兩個不同的研究領域，試圖以演化計算裡的工具與機制對盧比變換碼進行改良。文中探討了一系列的研究工作，包含盧比變換碼的最佳化與如何設計更優良的編碼機制。這些研究都針對同一個目標–期望以噴泉碼提供更穩定優良的傳輸方案。本論文的各項成果將有助於提升噴泉碼的應用品質，並推進相關領域的研究。

關鍵字

無編碼率編碼；盧比變換碼；演化計算；最佳化；多組態盧比變換碼

並列摘要

Digital fountain is a novel category of forward error correction proposed in the last decade. The most important characteristic of digital fountain is ratelessness which means that unlimited encoding codewords can be generated on the fly and a fixed code rate is not necessary. Any receiver interested in the message could reconstruct it while a sufficient amount of codewords were received without care of the order. No extra communication is required for handling lost packages, even though the channel status of each receiver is different. The feature is a critical reason for that digital fountain codes are good solutions for broadcasting application and transmission in heterogeneous network. Luby Transform (LT) codes are the first practical implementation of digital fountain. Since LT codes were introduced, lots of applications were proposed based on the code. Thus, to improve the performance of LT codes becomes an important issue. The thesis integrates two research fields and makes study on improving LT codes via the methods in evolutionary computation. A series of works are presented including the optimization of LT codes and the developing of advanced coding schemes. All these works aim to an identical objective that is to provide better solution for reliable communications. The results in the thesis would contribute to the applications of digital fountain codes. We also expect that the effort would be help for further achievement in the research field.

並列關鍵字

Rateless Codes ； LT Codes ； Evolutionary Computation ； Optimization ； Connection Choice Codes ； Multiple Configuration LT Cods

參考文獻

[3] M. Luby, “LT codes,” in Proc. 43rd annual IEEE Symposium on Foundations of Computer Science, 2002, pp. 271–280.

[8] E. A. Bodine and M. K. Cheng, “Characterization of Luby Transform codes with small message size for low-latency decoding,” in Proc. IEEE Interna- tional Conference on Communications (ICC 2008), 2008, pp. 1195–1199.

[9] J. P. Wagner, J. Chakareski, and P. Frossard, “Streaming of scalable video from multiple servers using rateless codes,” in Proceedings of the IEEE Inter- national Conference on Multimedia and Expo, 2006, pp. 1501–1504.

[13] M. Luby, M. Watson, T. Gasiba, T. Stockhammer, and X. Wen, “Raptor codes for reliable download delivery in wireless broadcast systems,” in Proc. 3rd IEEE Consumer Communications and Networking Conference, vol. 1, 2006, pp. 192–197.

[14] M. Luby, T. Gasiba, T. Stockhammer, and M. Watson, “Reliable multimedia download delivery in cellular broadcast networks,” IEEE Transactions on Broadcasting, vol. 53, no. 1, pp. 235–246, 2007.

國際替代計量

以演化計算之機制與工具對LT Codes進行改良之研究

全文下載

主題瀏覽