請用此 Handle URI 來引用此文件：
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/70690完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.advisor | 林茂昭(Mao-Chao Lin) | |
| dc.contributor.author | Hui-Ming Wang | en |
| dc.contributor.author | 王會名 | zh_TW |
| dc.date.accessioned | 2021-06-17T04:35:03Z | - |
| dc.date.available | 2023-08-16 | |
| dc.date.copyright | 2018-08-16 | |
| dc.date.issued | 2018 | |
| dc.date.submitted | 2018-08-09 | |
| dc.identifier.citation | [1] E. Soijanin, N. Varnica, and P. Whiting, “Punctured vs rateless codes for hybrid ARQ,” in Proc. Inform.Theory Workshop (ITW), (Punta del Este, Uruguay),pp. 155–159, Mar. 2006.
[2] M. Luby, “LT codes,” in Proc. 43rd Annual IEEE Symp. Found. of Computer Science, pp. 271–280, 2002. [3] X. Yuan and L. Ping, “On systematic LT codes,” vol. 12, pp. 681–683, Sept. 2008. [4] A. Shokrollahi, “Raptor codes,” vol. 52, pp. 2551-2567, June 2006. [5] O. Etesami and A. Shokrollahi, “Raptor codes on binary memoryless symmetric channels,” vol. 52, pp. 2033–2051, May 2006. [6] Z. Cheng, J. Castura, and Y. Mao, “On the design of raptor codes for binary-input gaussian channels,” vol. 57, pp. 3269–3277, Nov. 2009. [7] G.-T. Li, H.-K. Wu, H.-C. Lee, H.-M. Wang, and M.-C. Lin, “Systematic physical-layer raptor coding to attain low decoding complexity,” vol. 22, no. 6, pp. 1124–1127, 2018. [8] S.-H. Kuo, Y. L. Guan, S.-K. Lee, and M.-C. Lin, “A design of physical-layer raptor codes for wide SNR ranges,” vol. 18, pp. 491–494, Mar. 2014. [9] J. Garcia-Frias and W. Zhong, “Approaching shannon performance by iterative decoding of linear codes with low-density generator matrix,” vol. 7, pp. 266–268, June 2003. [10] R. Barron, C. Lo, and J. Shapiro, “Global design methods for raptor codes using binary and higher-order modulations,” in Proc. IEEE Military Comm. Conf.(MILCOM), pp. 1–7, Oct. 2009. [11] G. Y. C. Gong and X. Wang, “Analysis and optimization of a rateless coded joint relay system,” vol. 9, pp. 1175–1185, Mar. 2010. [12] T. Richardson, A. Shokrollahi, and R. Urbanke, “Design of capacity-approaching irregular low-density parity-check codes,” vol. 47, pp. 619–637, Feb. 2001. [13] T. D. Nguyen, L. L. Yang, and L. Hanzo, “Systematic luby transform codes and their soft decoding,” in IEEE Workshop on Signal Processing Systems, Oct. 2007. [14] V. H. Tran, K. T. Lay, and L. C. Peng, “Modified lt coding with systematic connections,” in Anti-counterfeiting, Security, and Identification, pp. 1–4, Aug 2012. | |
| dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/70690 | - |
| dc.description.abstract | 本論文討論使用於實體層之混合式自動重送請求(已下簡稱HARQ)之通道編碼，HARQ結合前饋式錯誤更正碼及自動重送請求，實體層猛禽碼為其一種無碼率之錯誤更正編碼。傳統上實體層猛禽碼能針對單一訊雜比做最佳化，文獻已證實於二位元輸入高斯雜訊通道中，可以適用所有訊雜比的通用猛禽碼並不存在，達到準通用的猛禽碼設計即為研究目標。而在非系統化的盧比轉換碼中，為了達到接近通道容量的效果，所需要的盧比轉換碼和低密度奇偶檢查碼的疊帶次數非常之高，並伴隨著長運算時間和高複雜度，此篇論文根據單一訊雜比設計相對應之系統性猛禽碼，並藉由互消息分析其疊帶次數和效能之間之轉換，在經由提前終止技術，設計一套能適用於廣泛雜訊比之逼近通道容量且又能在低復雜度完成之猛禽碼。 | zh_TW |
| dc.description.abstract | This thesis studies physical-layer channel coding with incremental redundancy over the additive white Gaussian noise channel together with a feedback channel. More specifically, we study the physical layer Raptor (PLR) Codes. Raptor Codes is a rateless code that is composed of a Luby transform (LT) codes and a Low-Density Parity-check (LDPC) code. For practical applications, the decoding complexity is an important issue. It has been shown that systematic PLR codes can be implemented with much lower complexity as compared to the nonsystematic counterparts. We propose a design to find a systematic PLR code with adaptive degree distributions which can obtain throughput at least as good as the nonsystematic counterpart. Moreover, we provide convergence analysis to predict the number of iterations needed for obtaining successful decoding. The analysis matches well with the throughput obtained from simulation. | en |
| dc.description.provenance | Made available in DSpace on 2021-06-17T04:35:03Z (GMT). No. of bitstreams: 1 ntu-107-R05942116-1.pdf: 2991024 bytes, checksum: 66722d48f00ab63873bbc797b52398af (MD5) Previous issue date: 2018 | en |
| dc.description.tableofcontents | 口試委員審定書 i
致謝 ii 中文摘要 iii Abstract iv Contents v List of Figures vii List of Tables ix 1 Introduction 1 2 Review of physical-layer Raptor codes in BIAWGN channel 5 2.1 Review of LT codes 5 2.2 Review of Raptor codes 7 2.3 Belief Propagation algorithm 10 3 A design of combining punctured LDPC and Systematic Raptor codes 16 3.1 Introduction 16 3.2 Code Construction 17 3.3 Conventionally Optimized systematic PLR codes 22 3.4 Proposed Raptor codes 23 3.4.1 Adaptive Degree Distributions 26 3.4.2 Numerical Results 28 4 Convergence Analysis and some comparison with simulation result 31 4.1 Systematic Versus Non-systematic 31 4.2 Convergence Analysis and Throughput 32 5 Early termination 38 5.1 Early termination for LT code 39 5.1.1 Algorithm I 39 5.1.2 Algorithm II 48 6 Conclusions and Future Research 55 6.1 Future Direction 56 Bibliography 57 | |
| dc.language.iso | en | |
| dc.subject | 提前終止技術 | zh_TW |
| dc.subject | 無碼率編碼 | zh_TW |
| dc.subject | 實體層猛禽碼 | zh_TW |
| dc.subject | 外在資訊傳第分析 | zh_TW |
| dc.subject | early termination | en |
| dc.subject | Rateless code | en |
| dc.subject | EXIT analysis | en |
| dc.subject | Physical-layer Raptor code | en |
| dc.title | 實體層系統性猛禽碼之研究 | zh_TW |
| dc.title | A Design of Systematic Physical-layer Raptor Codes for High throughput and Low complexity | en |
| dc.type | Thesis | |
| dc.date.schoolyear | 106-2 | |
| dc.description.degree | 碩士 | |
| dc.contributor.oralexamcommittee | 蘇育德,呂忠津,趙啟超,蘇賜麟 | |
| dc.subject.keyword | 無碼率編碼,實體層猛禽碼,外在資訊傳第分析,提前終止技術, | zh_TW |
| dc.subject.keyword | Rateless code,EXIT analysis,Physical-layer Raptor code,early termination, | en |
| dc.relation.page | 58 | |
| dc.identifier.doi | 10.6342/NTU201802869 | |
| dc.rights.note | 有償授權 | |
| dc.date.accepted | 2018-08-09 | |
| dc.contributor.author-college | 電機資訊學院 | zh_TW |
| dc.contributor.author-dept | 電信工程學研究所 | zh_TW |
| 顯示於系所單位： | 電信工程學研究所 | |
文件中的檔案：
| 檔案 | 大小 | 格式 | |
|---|---|---|---|
| ntu-107-1.pdf 未授權公開取用 | 2.92 MB | Adobe PDF |
系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。