請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/5199
完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.advisor | 闕志達(Tzi-Dar Chiueh) | |
dc.contributor.author | Wei Lan | en |
dc.contributor.author | 藍瑋 | zh_TW |
dc.date.accessioned | 2021-05-15T17:53:24Z | - |
dc.date.available | 2018-02-03 | |
dc.date.available | 2021-05-15T17:53:24Z | - |
dc.date.copyright | 2015-02-03 | |
dc.date.issued | 2014 | |
dc.date.submitted | 2014-11-25 | |
dc.identifier.citation | 參考文獻
[1] A. Ronen. “Where is the Money in Growing Streaming Video?” Internet: http://broabandtrafficmanagement.blogspot.tw/2013/02/informa-where-is-money-in-growing.html, Feb. 9, 2013 [Feb. 9, 2013]. [2] WIKIPEDIA “Luby transform code.” Internet: http://en.wikipedia.org/wiki/Luby_transform_code, Feb. 26, 2007[May 5, 2014]. [3] A. Shokrollahi, “Raptor Codes,” IEEE Transactions on Information Theory, vol. 52, no. 6, pp. 2551-2567, Jun. 2006. [4] WIKIPEDIA “Raptor code.” Internet: http://en.wikipedia.org/wiki/Raptor_code, Jan. 17, 2007[Apr. 16, 2014]. [5] M. Luby, A. Shokrollahi, M. Watson, and T. Stockhammer, “Raptor forward error correction scheme for object delivery,” Internet Engineering Task Force (IETF), Tech. Rep. RFC 5053 (2007). [6] 3GPP, ”Rationale for MBMS AL-FEC enhancements,” 3rd generation partnership project (3GPP), Tdoc S4-110449, 2011. [7] C. Bouras, N. Kanakis, V. Kokkinos, and A. Papazois, “Application layer forward error correction for multicast streaming over LTE networks,” International Journal Communication Systems, 2012. [8] M. Luby, A. Shokrollahi, M. Watson, T. Stockhammer, and L. Minder. “RaptorQ Forward Error Correction Scheme for Object Delivery,” Internet Engineering Task Force (IETF), Tech. Rep. RFC 6330 (2011). [9] M. Luby, “LT codes,” in Proc. of the 43rd Annual IEEE Symposium on Foundations of Computer Science, pp. 271-282, Nov. 2002. [10] G. H. Golub, and C. F. Van Loan, Matrix Computations. Baltimore, Maryland: The Johns Hopkins University Press, 1996. [11] Y. P. Lu, I. W. Lai, and T. D. Chiueh, “A 52.7 mW RaptorQ Code Decoder IC Using a Cache-based Tabulating Indices Architecture,” IEEE Transactions on Communications, Jan. 2014. [12] Y. P. Lu, I. W. Lai, C. H. Lee, and T. D. Chiueh, “Low-Complexity Decoding for RaptorQ Codes Using a Recursive Matrix Inverse Lemma,” IEEE Wireless Communications Letters, vol. 3, no. 2, pp. 217-220, Apr. 2014. [13] A. Bogdanov, M. Mertens, P.C., J.Pelzl, and A.Rupp, “A parallel hardware architecture for fast gaussian elimination over gf(2),” in Proc. of the 14th Annual IEEE Symposium on Field-Programmable Custom Computing Machine, pp. 237-248, 2006. [14] Xilinx Official Website. Internet: http://www.xilinx.com/products/silicon-devices/fpga/spartan-6/ [15] SMIMS Official Website. Internet: http://tw.smims.com/index.php?active=ProductItem&item=20 [16] S. Kim, S. Lee, and S. Y. Chung, “An efficient algorithm for ML decoding of Raptor codes over binary erasure channel,” IEEE Communication Letters, vol. 12, no. 8, pp. 578-580, Aug. 2008. [17] P. Cataldi, M. Shatarski, M. Grangetto, and E. Magli, “Implementation and performance evaluation of LT and Raptor codes for multimedia applications,” in Proc., Int. Conf. on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP), Dec. 2006, pp 263-266. [18] S. S. Arslan, P. C. Cosman, and L. B. Milstein, “Generalized Unequal Error Protection LT Codes for Progressive Data Transmission,” IEEE Transactions on Image Processing, vol. 21, no. 8, Aug. 2012. [19] L. Hu, S. Nooshabadi, and T. Mladenov, 'Forward error correction with Raptor GF(2) and GF(256) codes on GPU,' IEEE Transactions on Consumer Electronics, vol. 59, no. 1, pp. 273-280, Feb. 2013. [20] T. Mladenov, S. Nooshabadi, and K. Kim, “Efficient GF(256) raptor code decoding for multimedia broadcast/multicast services and consumer terminals,” IEEE Transactions on Consumer Electronics, vol. 58, no. 2, pp. 356-363, May 2012. [21] A. U. Pandya, S. D. Trapasiya, and S. S. Chinnam, “Implementation of AL-FEC Raptorq Code Over 3GPP Embms Network,” International Journal of Engineering Research & Technology, vol. 2, no. 5, May 2013. [22] R. Razavi, and H. Claussen, “Digital Fountain Codes with Reduced Latency, Complexity and Buffer Requirements for Wireless Communications,” in Proc. of IEEE Vehicular Technology Conference (VTC), May 2014. [23] X. He, M. Holm, and M. Neytcheva, “Efficiently parallel implementation of the inverse Sherman-Morrison algorithm,” Technical Report no. 2012-017, Department of Information Technology, Uppsala, Sweden, 2012. [24] Y. Shan, and A. Zakhor, 'Cross layer techniques for adaptive video streaming over wireless networks,' in Proc. of IEEE International Conference on ICME, vol. 1, 2002, pp. 277-280. [25] T. Mladenov, S. Nooshabadi, and K. Kim, “Implementation and Evaluation of Raptor Codes on Embedded Systems,” IEEE Transactions on Computers, vol. 60, no. 12, pp. 1678-1691, Dec. 2011. | |
dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/5199 | - |
dc.description.abstract | 隨著科技越來越發達,智慧型手機可以提供的功能也越來越多,其中多媒體串流是普遍大眾經常使用到的ㄧ項服務;然而在此項服務中,傳遞延遲是影響視聽體驗最重要的影響因素。不幸的是,無線通訊常常會受到通道效應的影響,因此若沒有有效錯誤更正碼的協助,要提供ㄧ個可靠的無線通訊架構是幾乎不太可能的。傳統的無線通訊主要是透過重新傳送直到接收端成功地收到為止,以提供可靠的無線傳輸;然而湧泉碼的概念則是保留已成功收到的訊號,並繼續接收其他的編碼訊號直到足以成功解碼為止,此一概念在近年來吸引了大量的注意,而且也已應用在許多的環境設定中。
RaptorQ code是目前最新ㄧ代的湧泉碼,相較於之前的湧泉碼,RaptorQ code提供了更大的設計彈性以及更低的解碼失敗率,然而其解碼的架構亦相當複雜。傳統的RaptorQ code解碼器需要求得ㄧ個相當大矩陣的反矩陣,為了避免此ㄧ部分所需要的大量運算量,本論文改為事先求得ㄧ反矩陣,再根據遺失訊號所對應的列向量去對已知的反矩陣作修正,使得大部分的運算量皆移至離線狀態。另ㄧ方面,傳統演算法會先經由求得反矩陣的過程,同時得到中間訊號值,接著再利用中間訊號進而還原出來源訊號;然而新式演算法在此ㄧ部分利用事先求得傳送矩陣反矩陣的特性,將兩個步驟合併以進一步地化簡運算量。最後則是利用RaptorQ code的有系統特性,避免再次求得成功收到的來源訊號。 本論文所提出的新式解碼演算法不僅用軟體完成模擬,亦將其實現成硬體電路以及利用FPGA板驗證,以證明此一演算法的可行性。 | zh_TW |
dc.description.abstract | With advances in technology, there are much more services that a smartphone can provide. The multimedia streaming is the most common one that people use. However, transmission latency is of utmost important to quality of viewing/listening experiences. Unfortunately, wireless transmission often suffers channel fading that renders robust transmission almost impossible without effective error correction mechanism. Conventional protocol generally retransmits the erased coded sequence until the receiver receives it correctly. Fountain codes, on the other hand, keep the partially decoded information and continue to receive and decode the coded symbol until the whole information sequence can be recovered. Such rateless code has drawn a great deal of attention and has been applied in many scenarios.
RaptorQ code is the latest generation of Raptor codes. Compared with the previous version, RaptorQ code provides higher flexibility and the lower decoding failure probability. However, the decoding procedure is also much more complicated. Conventionally, the decoding of RaptorQ codes requires inverting a huge matrix. Instead of such costly matrix inversion, we proposed to calculate the inverse of another matrix whose rows are a little different from the one that needs to be decoded. Therefore, most computations are shifted offline. Next, previous decoding usually decodes the intermediate symbols while inverting the matrix, and recovers the information sequence from the intermediate symbols. With the pre-calculated inverse, the proposed algorithm combines the intermediate sequence decoding and the procedure of information sequence recovery to reduce the complexity. Last, due to the systematic code property of the RaptorQ code, we proposed a new method that avoids many unnecessary computation when decoding the received information sequence. Finally, the proposed decoding algorithm is not only simulated on software, but also verified with FPGA board to prove its feasibility. | en |
dc.description.provenance | Made available in DSpace on 2021-05-15T17:53:24Z (GMT). No. of bitstreams: 1 ntu-103-R01943133-1.pdf: 4333615 bytes, checksum: 05a8095390ce4d6e9fc4ca4acb0d0c0d (MD5) Previous issue date: 2014 | en |
dc.description.tableofcontents | 目錄
國立臺灣大學電機資訊學院電子工程學研究所 I 誌謝 V 摘要 VII ABSTRACT IX 圖目錄 XIII 表目錄 XV 第一章 緒論 1 1.1 研究動機 1 1.2 湧泉碼介紹 3 1.2.1 湧泉碼概念 3 1.2.2 湧泉碼特性 3 1.3 論文組織 4 第二章 湧泉碼 5 2.1 FOUNTAIN CODE 5 2.2 LT CODE 6 2.2.1 編碼方式 6 2.2.2 Belief-propagation Decoding 7 2.3 RAPTOR CODE 11 2.3.1 編碼方式 11 2.3.2 未活躍解碼 12 2.3.3 解碼失敗率 18 2.4 RAPTORQ CODE 18 2.4.1 Systematic code 19 2.4.2 Permanent Inactivation 19 2.4.3 Galois Field 21 2.4.4 解碼失敗率 22 第三章 RAPTORQ 規格及其編解碼器架構 23 3.1 RAPTORQ CODE規格介紹 23 3.1.1 來源區塊組成 23 3.1.2 八位組的算術運算 24 3.2 編碼器架構 25 3.2.1 加入填補訊號 26 3.2.2 產生中間訊號 26 3.2.3 產生編碼訊號 28 3.3 解碼器架構 29 3.3.1 Inactivation Decoding Gaussian Elimination[] 30 3.3.2 索引基礎解碼演算法[11] 34 3.3.3 遞迴解碼演算法[12] 36 第四章 新式解碼器演算法 41 4.1 SYSTEMATIC CODE 41 4.2 MATRIX INVERSE LEMMA 42 4.3 結合LT編碼矩陣以及接收矩陣反矩陣 44 4.4 通道狀況 46 4.5 演算法效能比較 49 第五章 新式解碼器硬體設計 56 5.1 演算法硬體架構設計 56 5.1.1 Read Only Memory 57 5.1.2 Matrix Multiplication 59 5.1.3 Gaussian Elimination 60 5.1.4 RTL Simulation Result 65 5.2 電路架構彈性度 66 5.3 FPGA板驗證 69 5.4 電路效能比較 73 第六章 結論與展望 75 參考文獻 76 | |
dc.language.iso | zh-TW | |
dc.title | 高速率湧泉碼解碼器之硬體架構設計與實現 | zh_TW |
dc.title | High-throughput Hardware Architecture Design and Realization of RaptorQ Code Decoder | en |
dc.type | Thesis | |
dc.date.schoolyear | 103-1 | |
dc.description.degree | 碩士 | |
dc.contributor.oralexamcommittee | 蘇柏青(Bor-Ching Su),李佳翰(Chia-Han Li) | |
dc.subject.keyword | 猛禽碼解碼器,湧泉碼,反矩陣定理, | zh_TW |
dc.subject.keyword | RaptorQ code decoder,fountain code,Matrix inverse lemma, | en |
dc.relation.page | 94 | |
dc.rights.note | 同意授權(全球公開) | |
dc.date.accepted | 2014-11-25 | |
dc.contributor.author-college | 電機資訊學院 | zh_TW |
dc.contributor.author-dept | 電子工程學研究所 | zh_TW |
顯示於系所單位: | 電子工程學研究所 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-103-1.pdf | 4.23 MB | Adobe PDF | 檢視/開啟 |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。