簡易檢索 / 詳目顯示
| 研究生： |
趙冠筌 Kuan-Chuan Chao |
|---|---|
| 論文名稱： |
5G短碼長低密度奇偶檢查碼之基於停止集的解碼方法 Stopping-set Based Decoder for Short Block Length LDPC in 5G |
| 指導教授： |
林士駿
Shih-Chun Lin |
| 口試委員: |
林士駿
Shih-Chun Lin 黃昱智 Yu-Chih Huang 沈中安 Chung-An Shen |
| 學位類別： |
碩士 Master |
| 系所名稱： |
電資學院 - 電子工程系 Department of Electronic and Computer Engineering |
| 論文出版年： | 2018 |
| 畢業學年度： | 106 |
| 語文別： | 中文 |
| 論文頁數： | 47 |
| 中文關鍵詞： | 第五代行動通訊 、低密度奇偶檢查碼 、停止集 、置信傳遞 、和積演算法 、短碼長低密度奇偶檢查碼 |
| 外文關鍵詞： | eMBB, sum product algorithm, short block length for low density parity check |
| 相關次數： | 點閱：411 下載：3 |
| 分享至: |
| 查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報 |
在本論文，我們專注設計短碼長的低密度奇偶檢查( low density parity check , LDPC)的解碼演算法。一般來說，為了達到香農容量( Shannon capacity )必須使用長碼字( codelength )，而在應用上過長的碼字會造成無法忍受的延遲( latency )，但是對於較短的碼字，傳統的置信傳遞( belief propagation)解碼演算法的解碼效能不夠好。為了改善短碼下的解碼效能的問題，我們提出了新的解碼方法，利用臨界值(threshold)來找出停止集中不可信的變量點，藉由除去(erasure)不可信的變量點來提高解碼效能，我們的模擬結果顯示出當使用5G標準eMBB下的低密度奇偶檢查碼時，我們提出的演算法比起一般的置信傳遞的解碼效能更好，而且跟一般的置信傳遞法一樣，我們提出的演算法複雜度還是與碼長呈線性比例。
關鍵字： 5G； eMBB； 低密度奇偶檢查碼； 停止集； 置信傳遞；
和積演算法； 短碼長低密度奇偶檢查碼；
In this thesis, we focus on designing a decoding algorithm for short length low density parity check (LDPC) code. Typically, a long codebook length is necessary to achieve the Shannon capacity. However, long codebook length prohibits real-time applications due to the intolerable latency. For the short codebook length regime, the performance of conventional belief propagation(BP) decoding algorithm is not good enough. To improve this problem, we propose a new decoding algorithm which use the threshold to find the unreliable variable node in the stopping set. We improve performance by erasuring the unreliable variable node. By the proposed decoding with the stopping set, our simulation results show that our proposed algorithm outperform the BP for the LDPC code adopted in 5G. And as BP algorithm, the complexity of proposed one is still linear in codeword length.
Key word： 5G； eMBB； low density parity check； stopping set；
belief propagation； Sum Product Algorithm；
short block length for low density parity check；
[1] Oumer Teyeb, Gustav Wilstrom et al., “Evolving LTE to fit the 5G future,” Ericsson Technology Review, Jan. 2017
[2] R. G. Gallager, “Low-density parity-check codes,” IRE Trans. Inform. Theory, vol. IT-8, pp. 21–28, Jan. 1962.
[3] Oumer Teyeb, Gustav Wilstrom et al., “Evolving LTE to fit the 5G future,” Ericsson Technology Review, January 2017
[4] “ TU-R, IMT Vision –Framework and overall objectives of the future development of IMT for 2020 and beyond, ” Recommendation ITU-R M.2083-0, September 2015
[5] MLA Tanner, R. Michael. “A recursive approach to low complexity codes,” Information Theory, IEEE Transactions on 27.5 (1981): 533-547.
[6] 3GPP Final Report of 3GPP TSG RAN WG1 #87 v1.0.0
[7] M. P. C. Fossorier, “Quasi-cyclic low density parity check codes from circulant permutation matrices,” IEEE Trans. Inform. Theory, vol. 50, pp. 1788-1794, Aug. 2004
[8] 3GPP TSG RAN WG1 NR AH #2 , R1-1711982
[9] 3GPP Final Report of 3GPP TSG RAN WG1 #90 v1.0.0 , R1-1714324
[10] 3GPP TSG RAN WG1 Meeting #89, Email discussion on LDPC base graph 2, “Design for LDPC base graph 2,” Nokia, Alcatel-Lucent Shanghai Bell
[11] Di, Changyan, et al. “Finite-length analysis of low-density parity-check codes on the binary erasure channel.” Information Theory, IEEE Transactions on 48.6 (2002): 1570-1579.
[12] Rosnes, Eirik. “An efficient algorithm to find all small-size stopping sets of low-density parity-check matrices.” Information Theory, IEEE Transactions on 55.9 (2009): 4167-4178.
[13] S. Kang, J. Moon, J. Ha, and J. Shin, “Breaking the trapping sets in LDPC codes: check node removal and collaborative decoding,” IEEE Trans. Commun., vol. 64, no. 1, pp. 15–26, Jan. 2016..
