請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/17734
完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.advisor | 林茂昭 | |
dc.contributor.author | Hsuan-Kuan Wu | en |
dc.contributor.author | 吳炫寬 | zh_TW |
dc.date.accessioned | 2021-06-08T00:42:45Z | - |
dc.date.copyright | 2015-08-17 | |
dc.date.issued | 2015 | |
dc.date.submitted | 2015-08-15 | |
dc.identifier.citation | [1] Berrou C. and Glavieux A., “Near optimum error correcting coding and decoding:
Turbo codes,” IEEE Trans. Commun., vol. 44, pp. 1261–1271, Oct. 1996. [2] R. G. Gallager, “Low-density parity-check codes,” IRE Trans. on Inf. Theory, vol. 8, pp. 21–28, Jan. 1962. [3] D. J. C. Mackay and R. M. Neal, “Near shannon limit performance of low density parity check codes,” Electron. Lett., vol. 32, pp. 1645–1646, Aug. 1996. [4] H. Jin, A. Khandekar and R. J. McEliece, “Irregular repeat-accumulate codes,” in Proceedings of the 2nd International Symposium on Turbo Codes and Related Topics, (Seoul, South Korea), Sep 2000. [5] P. W. Nedeljko Varnica, Emina Soljanin, “LDPC code ensembles for incremental redundancy hybrid ARQ,” in in Proc. Int. Symp0 Inform. theory 2005., (Adelaide, SA), pp. 995 – 999, Sept 2005. [6] G. V. G. Sesia, S.; Caire, “Incremental redundancy hybrid arq schemes based on low-density parity-check codes,” EEE Trans. Commun., vol. Volume:52 , Issue: 8, pp. 1311 – 1321, Aug. 2004. [7] S. W. M. Jeongseok Ha, Jaehong Kim, “Puncturing for Finite Length Low-Density Parity-Check Codes,” in in Proc. Int. Symp0 Inform. theory 2004., (Chicago, SA), June 2004. [8] S. W. M. Jeongseok Ha, Jaehong Kim, “Rate-Compatible Punctured Low-Density Parity-Check Codes With Short Block Lengths,” IEEE Trans. Inf. Theory, vol. Volume: 52 , no2, Feb 2006. [9] M. Luby, “Lt codes,” Nov, 2002. [10] J. W. Z. Garcia-Frias, “Approaching shannon performance by iterative decoding of linear codes with low-density generator matrix,” IEEE Commun. Letters, vol. Volume: 7 ,NO.6, June 2003. [11] A. Shokrollahi, “Raptor codes,” IEEE Trans. Inf. Theory, vol. Volume:52 , no.6, pp. 2551–2567, june 2006. [12] A. S. O. Etesami, “Raptor codes on binary memoryless symmertic channels,” IEEE Trans. Inf. Theory, vol. Volume:52 , no.5, pp. 2033–2051, may 2006. [13] J. Y. M. Zhong Cheng; Castura, “On the design of raptor codes for binary-input gaussian channels,” IEEE Trans. Commun., vol. Volume:57 , no.11, pp. 3269– 3277, Nov. 2009. [14] J. M. S. Richard J. Barron, Caleb K. Lo, “Global design methods for raptor codes using binary and higher-order modulations,” IEEE ,MILCOM.2009, pp. 1–17. [15] S.-H. K. Y. L. G. S.-K. L. M.-C. Lin, “A design of physical-layer raptor codes for wide snr ranges,” IEEE Commun. Letters, vol. Volume:18 ,Issue:3, pp. 491–494, Mar. 2014. [16] D. Xiao-Yu Hu; Eleftheriou, E.; Arnold, “Regular and irregular progressive edgegrowth tanner graphs,” IEEE Trans. Inf. Theory, vol. Volume:51 , Issue: 1, pp. 386– 398, 2005. [17] A. Asvadi, R.; Banihashemi, “A rate-compatible puncturing scheme for finitelength ldpc codes,” IEEE Commun. Letters, vol. Volume:17 ,issue:1, 2013. [18] V. Vukobratovic, D.; Senk, “Transactions papers evaluation and design of irregular LDPC codes using ACE spectrum,” IEEE Trans. Commun., vol. Volume:57 , Issue: 8, 2009. [19] E. Soljanin, N. Varnica, and P. Whiting, “Incremental redundancy hybrid ARQ with LDPC and raptor codes,” IEEE Trans. Inf. Theory, 2005. | |
dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/17734 | - |
dc.description.abstract | 本論文針對討論使用於實體層之混合式自動重送請求(以下簡稱HARQ)之通道編碼,HARQ分為三種型態,本論文主要集中探討型態二,前次傳送之解碼失敗封包不會被丟棄,而重傳資料與前次傳輸不同,並合併兩者形成糾錯能力更強的錯誤更正碼。常見的型態二HARQ為穿刺型低密度奇偶檢查碼與猛禽碼,兩者各有優缺點,傳統猛禽碼使用高碼率之低密度奇偶檢查碼,會有較佳表現,我們試著以較低碼率之穿刺型低密度奇偶檢查碼取代之,並做出各種嘗試修正,些微提高在最佳化目標訊雜比點位的通道傳輸量並降低複雜度。
並在第二部份,我們考慮不同類型之調變系統,成功將非系統性猛禽碼用於高階脈衝編碼調變,因文獻已證實用於高斯雜訊通道中之通用猛禽碼並不存在,我們應用一個可適性非系統性猛禽碼之設計,使其在高階脈衝編碼調變依舊在一個廣泛的雜訊比範圍有很高的通道使用效率。 | zh_TW |
dc.description.abstract | This thesis describes a study into coding and modulation techniques for incremental redundancy automatic repeat request (IR-HARQ) and high order modulation schemes designed to increase throughput over the AWGN channel.
The research is based on two major classes in IR-HARQ: Raptor Codes and Punctured LDPC codes. In the first part of this thesis, an analysis of the conventional optimizing method is conducted for both schemes before presenting an efficient approach to combining systematic Raptor Codes and Punctured LDPC codes in order to construct a code that provides an improvement in SNR ranges lower than the specific optimized SNR compared with the same pre-code as conventional systematic Raptor Codes. In the second part, the linear programming in Raptor Codes is applied to the high order modulation. Adaptive degree distribution is used on Gray-mapped 4PAM and 8PAM modulation, which can be easily implemented on 16QAM and 64QAM modulation. The simulation shows the adaptive degree distribution is able to retain a high channel efficiency for wide SNR regions. | en |
dc.description.provenance | Made available in DSpace on 2021-06-08T00:42:45Z (GMT). No. of bitstreams: 1 ntu-104-R02942117-1.pdf: 7738498 bytes, checksum: 3e189df5f742d95d6674c9f818cac578 (MD5) Previous issue date: 2015 | en |
dc.description.tableofcontents | 1 Introduction 1
2 Background Review of Incremental Redundancy Hybrid ARQ 6 2.1 Introduction to Finite-length Punctured LDPC Codes . . . . . . . . . . 6 2.1.1 PEG LDPC codes . . . . . . . . . . . . . . . . . . . . . . . . . 7 2.1.2 Punctured algorithm with approximate cycle extrinsic message degrees . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 v 2.2 Review of conventional physical layer Fountain codes in BIAWGN channels . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18 2.2.1 Review of LT codes . . . . . . . . . . . . . . . . . . . . . . . 18 2.2.2 Review of Raptor codes . . . . . . . . . . . . . . . . . . . . . 21 2.2.3 Linear programming for !(x) . . . . . . . . . . . . . . . . . . 25 3 A design of combining punctured LDPC and Systematic Raptor codes 28 3.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 28 3.2 Raptor code with lower rate LDPC pre-coding . . . . . . . . . . . . . 30 3.3 Partial-systematic Raptor code . . . . . . . . . . . . . . . . . . . . . . 32 3.3.1 Modified EXIT analysis for Partial-systematic Raptor code . . . 34 3.3.2 Linear Programming for PSR codes . . . . . . . . . . . . . . . 37 3.3.3 Modified EXIT analysis for unequal decoding threshold . . . . 40 3.4 Chapter discussion . . . . . . . . . . . . . . . . . . . . . . . . . . . . 45 4 Adaptive non-systematic Raptor codes for Higher-order modulations 47 4.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 47 4.2 BICM for Linear Programming processing . . . . . . . . . . . . . . . . 48 4.2.1 4PAM optimized Raptor code . . . . . . . . . . . . . . . . . . 48 4.3 Adaptive Degree Distributions for physical layer Raptor codes . . . . . 50 4.3.1 Adaptive Degree Distributions for 16QAM modulation . . . . . 53 4.3.2 Adaptive Degree Distributions for 64QAM modulation . . . . . 57 5 Conclusions and Future Research 60 5.1 Future work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 61 Bibliography 62 | |
dc.language.iso | en | |
dc.title | 實體層猛禽碼之數種研究結果 | zh_TW |
dc.title | Some Results on Physical-Layer Raptor Codes | en |
dc.type | Thesis | |
dc.date.schoolyear | 103-2 | |
dc.description.degree | 碩士 | |
dc.contributor.oralexamcommittee | 趙啟超,蘇賜麟,鐘嘉德,蘇育德 | |
dc.subject.keyword | 無碼率編碼,穿刺型低密度奇偶檢查碼,實體層猛禽碼,通道容量,高斯雜訊通道,外在資訊傳遞分析, | zh_TW |
dc.subject.keyword | Rateless codeing,Raptor code,Puncdured LDPC,Channel capacity,AWGN channel,EXIT analysis, | en |
dc.relation.page | 64 | |
dc.rights.note | 未授權 | |
dc.date.accepted | 2015-08-15 | |
dc.contributor.author-college | 電機資訊學院 | zh_TW |
dc.contributor.author-dept | 電信工程學研究所 | zh_TW |
顯示於系所單位: | 電信工程學研究所 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-104-1.pdf 目前未授權公開取用 | 7.56 MB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。