簡易檢索 / 詳目顯示

研究生: 呂育瑋
Yu-Wei Lu
論文名稱: 高效快速可適性極化碼解碼搭配分段CRC 順續消除列表法
Efficient Fast Adaptive SC List Decoders For Segmented CRC Polar Codes
指導教授: 賴坤財
Kuen-Tsair Lay
口試委員: 賴坤財
Kuen-Tsair Lay
方文賢
Wen-Hsien Fang
曾德峰
Der-Feng Tseng
學位類別: 碩士
Master
系所名稱: 電資學院 - 電子工程系
Department of Electronic and Computer Engineering
論文出版年: 2020
畢業學年度: 108
語文別: 中文
論文頁數: 83
中文關鍵詞: 極化碼順續消去法順續消去列表法循環冗餘校驗分段循環冗餘校驗解碼複雜度可適性順續消去列表法
外文關鍵詞: polar code, successive-cancellation, successive-cancellation list, cyclic redundancy check, segmented cyclic redundancy check, decoding complexity, adaptive successive-cancellation list
相關次數: 點閱:208下載:9
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 近年來,極化碼在第五代行動通訊(5G)應用下得到了許多關注,
    2008年時由土耳其教授Erdal Arıkan首度提出通道極化的概念,2016年確定Polar Code作為5G eMBB(增強型行動寬頻通訊場景下)所使用的錯誤更正碼。
    極化碼的解碼方法中最普遍使用的有順續消去法(SC)和改善前者的順續消去列表法(SCL)。由於SC解碼時是依照其順序性且下一個位元解碼時需要使用前一個位元解碼的資訊,假使前面位元解碼發生錯誤,則會造成錯誤資訊不斷傳遞;為了解決此問題SCL相較於SC則是保留了更多條路徑,但同時也造成解碼複雜度的提升。
    本篇論文中主要以SC和SCL為概念結合做延伸,提出一種可適性調整列表大小解碼方法,搭配分段循環冗餘校驗(CRC)因子,稱為分段循環冗餘校驗輔助高效可適性順續消除列表法(SCA-EADSCL),在高訊雜比中達到與分段循環冗餘校驗輔助順續消去列表法(SCA-SCL)錯誤率相近的情況下,大大的降低解碼複雜度,並且套用特殊節點快速解碼進一步降低解碼所造成的延遲。


    In recent years, polar codes has gained lots of attention, with the application to the fifth generation mobile communication (5G). The concept of channel polarization was first proposed by Turkish professor Erdal Arıkan in 2008. In 2016 3GPP agreed to adopt polar codes for the eMBB (Enhanced Mobile Broadband) control channels.
    The conventional decoders of polar codes are the successive-cancellation (SC) and an improvement to the SC decoder, namely, a successive-cancellation list(SCL) decoding. SC decoder is based on the order and a next bit to be decoded requires the information of the previous bits. If an error occurs in one bits, the error information will proprgate to the succeeding bits. As an improved modification from SC, the SCL decoder reserves more paths than the SC decoder to alleviate this problem of error propagation. At the same time, however, it also increases the decoding complexity.
    In this work, we propose an efficient adaptive Successive-Cancellation list decoder with a segment cyclic redundancy check bits (SCA-EADSCL) by combining SC and SCL decoders. It can achieve lower decoding complexity while maintaining a similar block error rate (BLER) performance. Its BLER performance and the analysis of complexity reduction as compared to SCL, CA-SCL, SCA-SCL are also presented.

    摘要 i ABSTRACT ii 致謝 iv 目錄 v 圖索引 viii 中英對照表 xi 第一章 緒論 1 1.1引言 1 1.2研究動機 1 1.3本文架構、論文章節 2 第二章 文獻探討 3 2.1 極化碼 3 2.1.1 極化碼的架構 4 2.1.2極化碼的通道排序 5 2.1.3極化碼的編碼 8 2.2 極化碼的解碼:順續消去法、順續消去列表法 9 2.2.1 順續消去法 10 2.2.2 順續消去列表法 12 2.3 循環冗餘校驗輔助極化碼的解碼 14 2.3.1 CRC輔助順序消去列表法 15 2.3.2 分段CRC輔助順序消去列表法 17 2.4 Simplified SC&SCL 19 2.4.1 Rate-0 node 20 2.4.2 Rate-1 node 21 2.4.3 REP node 23 第三章 高效可適性順續消去列表法 25 3.1 W運算 25 3.1.1 Decoding Tree 25 3.1.2 W運算 28 3.2 高效可適性順續消去列表法 29 3.2.1 高效可適性順續消去列表法基本概念 30 3.2.2 決策門檻值的方法 34 3.3 快速高效可適性順續消去列表法 35 3.3.1 Rate-1 node 36 3.3.2 Rep node 37 3.3.3 Rep block node 39 3.4 CRC輔助高效可適性順續消去列表法 40 3.4.1 CRC輔助高效可適性順續消去列表法 41 3.4.2 分段CRC輔助高效可適性順續消去列表法 44 第四章 實驗結果與討論 48 4.1 錯誤率與複雜度的比較 48 4.2 時間延遲的討論 57 第五章 結論與未來展望 63 參考文獻 65

    [1] E. Arikan, "Channel polarization: A method for constructing capacity-achieving codes," IEEE International Symposium on Information Theory, pp. 1173-1177, 2008.
    [2] E. Arikan, "Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels," IEEE Transactions on Information Theory, vol. 55, no. 7, pp. 3051-3073, 2009.
    [3] E. Arikan, "Polar codes: A pipelined implementation," in Proc. 4th Int. Symp. on Broad. Commun. ISBC 2010, pp. 11-14, July 2010.
    [4] I. Tal and A. Vardy, "List Decoding of Polar Codes," IEEE Transactions on Information Theory, vol. 61, no. 5, pp. 2213-2226, 2015.
    [5] A. Balatsoukas-Stimming, M. B. Parizi, and A. Burg, "LLR-Based Successive Cancellation List Decoding of Polar Codes," IEEE Transactions on Signal Processing, vol. 63, no. 19, pp. 5165-5179, 2015.
    [6] K. Niu and K. Chen, "CRC-Aided Decoding of Polar Codes," IEEE Communications Letters, vol. 16, no. 10, pp. 1668-1671, 2012.
    [7] R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
    [8] C. Sae-Young, T. J. Richardson, and R. L. Urbanke, "Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation," IEEE Transactions on Information Theory, vol. 47, no. 2, pp. 657-670, 2001.
    [9] "ETSI TS 138 212 V15.2.0 Technical Specification - 5G, NR, Multiplexing and channel coding,",ETSI, July 2018.
    [10] G. He et al., "Beta-Expansion: A Theoretical Framework for Fast and Recursive Construction of Polar Codes," IEEE Global Communications Conference, pp. 1-6, 2017.
    [11] C. Schürch, "A partial order for the synthesized channels of a polar code," IEEE International Symposium on Information Theory (ISIT), pp. 220-224, 2016.
    [12] H. Huawei, "3GPP, R1-167209, Polar code design and rate matching," 2016.
    [13] A. Alamdar-Yazdi and F. R. Kschischang, "A Simplified Successive-Cancellation Decoder for Polar Codes," IEEE Communications Letters, vol. 15, no. 12, pp. 1378-1380, 2011.
    [14] G. Sarkis, P. Giard, A. Vardy, C. Thibeault, and W. J. Gross, "Fast Polar Decoders: Algorithm and Implementation," IEEE Journal on Selected Areas in Communications, vol. 32, no. 5, pp. 946-957, 2014.
    [15] S. A. Hashemi, C. Condo, and W. J. Gross, "Simplified Successive-Cancellation List decoding of polar codes," IEEE International Symposium on Information Theory (ISIT), pp. 815-819, 2016.
    [16] 張靖欣,“增強型的快速極化碼解碼,”國立台灣科技大學電子工程所,2019
    [17] C. Condo, F. Ercan and W. J. Gross, "Improved successive cancellation flip decoding of polar codes based on error distribution", Proc. IEEE Wireless Commun. Netw. Conf. Workshops (WCNCW), pp. 19-24, Apr. 2018
    [18]O. Afisiadis, A. Balatsoukas-Stimming and A. Burg, "A low-complexity improved successive cancellation decoder for polar codes", IEEE 48th Asilomar Conference on Signals Systems and Computers, pp. 2116-2120, 2014

    QR CODE