請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/25917
完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.advisor | 許大山(Da-shan Shiu) | |
dc.contributor.author | Chia-Jung Chang | en |
dc.contributor.author | 張家榮 | zh_TW |
dc.date.accessioned | 2021-06-08T06:57:01Z | - |
dc.date.copyright | 2009-07-23 | |
dc.date.issued | 2009 | |
dc.date.submitted | 2009-07-20 | |
dc.identifier.citation | [1] D.J.C. MacKay. Fountain codes. IEE Proceedings Communications, 152(6):1062,
2005. [2] D. Sejdinovic, D. Vukobratovic, A. Doufexi, V. Senk, and R.J. Piechocki. Expanding Window Fountain Codes for Unequal Error Protection. In Conference Record of the Forty-First Asilomar Conference on Signals, Systems and Computers, 2007 (ACSSC 2007), pages 1020–1024, 2007. [3] EA Bodine and MK Cheng. Characterization of Luby Transform Codes with Small Message Size for Low-Latency Decoding. In IEEE International Conference on communications, 2008 (ICC’08), pages 1195–1199, 2008. [4] 3GPP TS 26.346 v7.4.0: ”Technical Specification Group Services and System Aspects; Multimedia Broadcast/Multicast Service (MBMS); Protocols and codecs(Release 7)”. [5] P. Cataldi, M.P. Shatarski, M. Grangetto, and E. Magli. Implementation and performance evaluation of LT and Raptor codes for multimedia applications. In Proc. of the International Conference on Intelligent Information Hiding and Multimedia Signal Processing, 2006. (IIH-MSP’06). [6] S. Ahmad, R. Hamzaoui, and M. Al-Akaidi. Robust live unicast video streaming with rateless codes. Packet Video 2007, pages 78–84, 2007. [7] M.G. Luby, M. Mitzenmacher, M.A. Shokrollahi, and D.A. Spielman. Efficient erasure correcting codes. IEEE Transactions on Information Theory, 47(2):569– 584, 2001. [8] M. Luby. LT Codes. In Proceedings of the 43rd Symposium on Foundations of Computer Science. IEEE Computer Society Washington, DC, USA, 2002. [9] A. Shokrollahi. Raptor codes. IEEE/ACM Transactions on Networking (TON), 14:2551–2567, 2006. [10] Ghid Maatouk. Recursions for the LT Decoder. Master Project, 2008. [11] P. Elias. ”Coding for two noisy channels”. In Proc. 3rd London Symp. Information Theory, London, U.K., pages 61–76, 1955. [12] F.J. MacWilliams and N.J.A. Sloane. The theory of error-correcting codes. North- Holland Amsterdam, 1977. [13] JW Byers, M. Luby, and M. Mitzenmacher. A digital fountain approach to asynchronous reliable multicast. IEEE Journal on Selected Areas in Communications, 20(8):1528–1540, 2002. [14] J.W. Byers, M. Luby, M. Mitzenmacher, and A. Rege. A digital fountain approach to reliable distribution of bulk data. ACM SIGCOMM Computer Communication Review, 28(4):56–67, 1998. [15] M.C.O. Bogino, P. Cataldi, M. Grangetto, E. Magli, and G. Olmo. Sliding- window digital fountain codes for streaming multimedia contents. In IEEE International Symposium on Circuits and Systems (ISCAS), New Orleans, 2007. [16] D. Vukobratovic, V. Stankovic, D. Sejdinovic, L. Stankovic, and Z. Xiong. Scalable Data Multicast Using Expanding Window Fountain Codes. 2007. [17] D. Vukobratovic, V. Stankovic, D. Sejdinovic, and L. Stankovic. Expanding Window Fountain codes for scalable video multicast. In IEEE International Conference on Multimedia and Expo. 2008, pages 77–80, 2008. [18] S. Sanghavi and MIT LIDS. Intermediate Performance of Rateless Codes. In IEEE Information Theory Workshop, 2007 (ITW’07), pages 478–482, 2007. [19] M.G. Luby, M. Mitzenmacher, and M.A. Shokrollahi. Analysis of random processes via And-Or tree evaluation. In Proceedings of the ninth annual ACMSIAM symposium on Discrete algorithms, pages 364–373. Society for Industrial and Applied Mathematics Philadelphia, PA, USA, 1998. [20] N. Rahnavard, B.N. Vellambi, and F. Fekri. Rateless Codes With Unequal Error Protection Property. IEEE Transactions on Information Theory, 53(4):1521– 1532, 2007. [21] R. Karp, M. Luby, and A. Shokrollahi. Finite length analysis of LT codes. In Proceedings. International Symposium on Information Theory, 2004 (ISIT 2004). | |
dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/25917 | - |
dc.description.abstract | 噴泉碼 (fountain codes) 適合用在二進抹去通道 (binary erasure channel) 上的資料傳輸。當這種噴泉碼用於現場直播的即時傳輸應用時,由於有限的傳輸頻寬以及傳輸時間上的限制,往往會因為資料處理上的便利,而將串流媒體分割成許多小資料區塊,並依序對每一小資料區塊獨立進行編碼及解碼。但是,使用小塊的資料區塊做編碼及解碼會導致編碼的效率降低。因此,在此論文中我們介紹了一種方法來提高編碼效率,即利用逐漸加大的資料區塊做編碼及解碼。我們所採用的方法可以視為是更為一般化的擴展視窗噴泉碼 [6]。除此之外,我們還推導出了廣義擴展視窗噴泉碼的錯誤率分析,此分析是利用狀態產生函數 (state generating function) 所推導出來的。此狀態產生函數可以幫助廣義擴展噴泉碼的分析及設計,並可以做為一個效能評估的工具。 | zh_TW |
dc.description.abstract | Fountain codes are suitable for data transmission over binary erasure channels. When such codes are applied in live broadcast applications, due to the limited bandwidth and delay constraints, it is often convenient to treat the input media stream as a concatenation of short data blocks and to encode each block individually. However, the use of a small block size may result in poor coding efficiency. In this thesis, we introduce an approach to enhance the coding efficiency by encoding over progressively more source bits. Our approach can be considered as a generalization of the expanding window fountain code concept. In addition, we provide an error analysis based on state generating functions. The state generating function is useful both as a
performance evaluation tool and as a design criterion for the generalized expanding window codes. | en |
dc.description.provenance | Made available in DSpace on 2021-06-08T06:57:01Z (GMT). No. of bitstreams: 1 ntu-98-R96942058-1.pdf: 859238 bytes, checksum: cbefc98f7ed71e6509831584a1b1590f (MD5) Previous issue date: 2009 | en |
dc.description.tableofcontents | 1 Introduction 1
1.1 Motivation.......................................... 1 1.2 Application ........................................ 9 1.2.1 LiveStreaming ................................... 10 1.3 ThesisOrganizations ............................... 13 2 Background 14 2.1 TransmissionControlProtocol(TCP) .................. 15 2.2 ErasureCorrectingCode ............................. 16 2.2.1 BlockErasureCorrectingCode ...................... 16 2.2.2 RatelessErasureCorrectingCode ................... 20 3 Generalized Expanding Window Fountain Codes 28 3.1 RelatedWorks....................................... 29 3.1.1 ExpandingWindowFountainCodes .................... 29 3.1.2 SlidingWindowFountainCodes ...................... 31 3.2 Definition of Generalized Expanding Window Fountain Codes ... 34 3.3 ApplicationsofGEWFCodes ........................... 35 4 Analysis of the Error Probability of LT Codes 36 4.1 A Survey of Non-finite Length Analysis of the Error Probability of LT Codes ................................... 36 4.2 Finite Length Analysis of the Error Probability of LT Codes ...37 5 Recursive State Generating Function for GEWF Decoder 45 5.1 Notations for the State Generating Function of GEWF Decoders ... 45 5.2 Recursive State Generating Function Derivation .... 47 5.3 Verification of the Recursion for GEWF codes ...... 57 6 Conclusions 60 7 Future Works 62 Bibliography 64 | |
dc.language.iso | en | |
dc.title | 廣義擴展視窗噴泉碼之有限長度分析 | zh_TW |
dc.title | Finite Length Analysis of Generalized Expanding Window Fountain Codes | en |
dc.type | Thesis | |
dc.date.schoolyear | 97-2 | |
dc.description.degree | 碩士 | |
dc.contributor.oralexamcommittee | 王忠炫,蘇炫榮,葉丙成,呂忠津 | |
dc.subject.keyword | 噴泉碼,二進抹去通道,現場直播串流媒體應用,廣義擴展視窗噴泉碼,有限長度分析,狀態產生函數, | zh_TW |
dc.subject.keyword | fountain codes,binary erasure channel,live media streaming application,generalized expanding window fountain codes,finite length analysis,state generating function, | en |
dc.relation.page | 66 | |
dc.rights.note | 未授權 | |
dc.date.accepted | 2009-07-20 | |
dc.contributor.author-college | 電機資訊學院 | zh_TW |
dc.contributor.author-dept | 電信工程學研究所 | zh_TW |
顯示於系所單位: | 電信工程學研究所 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-98-1.pdf 目前未授權公開取用 | 839.1 kB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。