研究生: |
陳昱宏 Yu-Hong Chen |
---|---|
論文名稱: |
搭配自動重傳機制之極化碼的最佳能量分配 Optimal Energy Allocation for Polar Codes with Hybrid Automatic Repeat Request |
指導教授: |
賴坤財
Kuen-Tsair Lay |
口試委員: |
賴坤財
Kuen-Tsair Lay 曾德峰 Der-Feng Tseng 方文賢 Wen-Hsien Fang |
學位類別: |
碩士 Master |
系所名稱: |
電資學院 - 電子工程系 Department of Electronic and Computer Engineering |
論文出版年: | 2019 |
畢業學年度: | 107 |
語文別: | 中文 |
論文頁數: | 73 |
中文關鍵詞: | 極化碼 、合併式自動重傳機制 、冗餘式自動重傳機制 、高斯近似通道建構 、能量分配 |
外文關鍵詞: | Polar code, CC-HARQ, IR-HARQ, Gaussian approximation, energy allocation |
相關次數: | 點閱:179 下載:0 |
分享至: |
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報 |
數位傳輸已經成為人類生活中不可或缺的部分,其中極化碼(polar codes)就是時下最熱門並且準備應用於第五代行動通訊(5G)的編碼方式。由於傳輸過程往往會因為受到各種干擾、雜訊影響等等因素導致接收到錯誤封包無法進行解碼。因此除了持續加強編碼技術降低錯誤率之外,發生傳輸錯誤後的重傳機制也成為了很重要的一環。
近年來,應用在極化碼的重傳機制上主要有兩種,分別是合併式自動重傳機制(CC-HARQ)以及冗餘式自動重傳機制(IR-HARQ)。前者的運作原理較為傳統,接收到重傳指令後重傳相同封包,然後在接收端整合兩次觀測結果並進行解碼;後者則是會根據極化碼固有的特性,重傳拓展碼長後的部分封包,之後再經由接收端將兩次觀測結果合併成新的極化碼,再進行解碼。
極化碼在經過重傳並且結合重傳的觀測結果之後,將會大幅降低錯誤率。本論文提出針對使用者所提出的碼長、碼率、通道環境等條件,利用兩項通訊傳輸上常見的指標,包括成功傳送的能量期望值(expected energy)以及吞吐量(throughput),在固定傳送總能量下,調整前後傳送能量來估計出較好的整體傳送效果。
然而為了做分析而必須去做大量的模擬求得各種錯誤率,這件事本身是極度費時的,因此我們透過高斯近似的作法,快速的估測出有參考價值的不同條件下的錯誤率,來達到實用的最佳化估測。
With the advancement and convenience of technology, digital transmission has become an indispensable part of human life. Among them, polar code is the most popular one and ready to be applied to the fifth generation mobile communication (5G) coding. Because the transmission process is often influenced by various interferences, noise, and other factors, receiving an erroneous packet could lead the transmission failure. Therefore, in addition to continuously enhancing the coding technology to reduce the error rate, the retransmission mechanism in case of transmission error has become an important part.
There are two major types of retransmission mechanisms for polar codes, namely, the Chase Combined Hybrid Automatic Repeat reQuest (CC-HARQ) and Incremental Redundancy Hybrid Automatic Repeat reQuest (IR-HARQ). The former scheme operates in a conventional manner. That is, after receiving the retransmission command, the same packet is retransmitted, and then the observation result is integrated and decoded at the receiver. The latter scheme retransmits part of the extended code word. After the packet is retransmitted, the two observations are merged into the extended polar code, and then decoded.
Retransmission will greatly reduce the error rate. Considering the conditions of code length, code rate, and channel environment, this work proposes energy allocation among transmission and retransmission. The goal is to minimizing an indicator that consider the expected energy consumption and the expected throughput. However, in order to do the consumption for the energy allocation, it is necessary to do a lot of simulations to obtain various error rates. This is extremely time-consuming.
Therefore, we use Gaussian approximation to quickly estimate the value of reference under different conditions. The error rate thus obtained is then used to achieve a fast optimization for energy allocation.
[1] E. Arikan, “Channel Polarizaion: A Method for Constructing Capacity Achieving Codes for Symmetric Binary-Input Memoryless Channels,” IEEE Trans. Inf. Theory, vol. 56, no. 7, pp. 3051-3073, Jul. 2009.
[2] E. Arikan, “A Performance Comparison of Polar Codes and Reed-Muller Codes,” IEEE Comm. Lett. vol. 12, pp. 447-449, June. 2008.
[3] I. Tal and A. Vardy, “How to construct polar codes,” IEEE Trans. Inf. Theory, vol. 59, no. 10, pp. 6562–6582, October 2013
[4] R. Mori and T. Tanka, “Performance of Polar Codes with the Construction Using Density Evolution,” IEEE Comm. Lett. vol. 13, no. 7, pp. 519-521, July. 2009.
[5] S. Y. Chung, T. Richardson, and R. Urbanke, “Analysis of Sum-Prodcut Decoding of Low-Density-Parity-Check Codes Using a Gaussian Approximation,” IEEE Trans. Inf. Theory, vol. 47, no. 2, Feb. 2001.
[6] G. Benelli, “An ARQ scheme with memory and soft error detectors,” IEEE Trans. Comm. vol. 33 no. 3 pp. 285-288 Mar. 1985.
[7] M. Zorzi R. Rao “On the use of renewal theory in the analysis of ARQ protocols,” IEEE Trans. Comm. vol. 44 no. 9 pp. 1077-1081 Sep. 1996.
[8] G. Caire D. Tuninetti “The throughput of hybrid-ARQ protocols for the Gaussian collision channel,” IEEE Trans. Inf. Theory vol. 47 no. 5 pp. 1971-1988 Jul. 2001.
[9] K. Chen K. Niu J. Lin “A hybrid ARQ scheme based on polar codes,” IEEE Comm. Lett. vol. 17 pp. 1996-1999 2013.
[10] K. Chen K. Niu Z. He J. Lin “Polar coded HARQ scheme with Chase combining,” Proc. IEEE WCNC pp. 474-479 Apr. 2014.
[11] H. Wang and Y. Chang “Novel Hybrid-ARQ Chase Combining Algorithms for ZF-SIC V-BL AST,” Comm. ICC. IEEE International Conference on pp. 5118- 5122 2008.
[12] M.-M. Zhao G. Zhang C. Xu H. Zhang R. Li J. Wang “An adaptive IR-HARQ scheme for polar codes by polarizing matrix extension,” IEEE Comm. vol. 22 no. 7 pp. 1306-1309 Jul. 2018.
[13] L. Ma et al. “An incremental redundancy HARQ scheme for polar code,” [online] Available: https://arxiv.org/abs/1708.09679. Aug. 2017
[14] HiSilicon, Huawei, “HARQ scheme for polar codes,” R1-16113301, November 14-18, 2016
[15] H. Liang A. Liu Y. Zhang Q. Zhang "Analysis and adaptive design of polar coded HARQ transmission under SC-list decoding" IEEE Wireless Comm. Lett. vol. 6 no. 6 pp. 798-801 Dec. 2017.