研究生: |
高紹宇 Shao-Yu Gao |
---|---|
論文名稱: |
神經網路輔助區塊循序消除列表解碼器 Neural-Network-Aided Partitioned Successive Cancellation List Decoder |
指導教授: |
王煥宗
Huan-Chun Wang 林敬舜 Ching-Shun Lin |
口試委員: |
林敬舜
Ching-Shun Lin 王瑞堂 Jui-Tang Wang 王煥宗 Huan-Chun Wang 劉建成 Jian-Cheng Liu |
學位類別: |
碩士 Master |
系所名稱: |
電資學院 - 電子工程系 Department of Electronic and Computer Engineering |
論文出版年: | 2023 |
畢業學年度: | 111 |
語文別: | 中文 |
論文頁數: | 69 |
中文關鍵詞: | 極化碼 、神經網路解碼器 、卷積神經網路 |
外文關鍵詞: | Polar Code, Neural Network Decoder, Convolution Neural Network |
相關次數: | 點閱:406 下載:0 |
分享至: |
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報 |
本論文提出神經網路輔助之區塊循序消除列表(NA-PSCL)解碼器之演算法設計,利用PSCL的區塊解碼特性,與CNN結合,演算法上,減少解碼流程,模擬結果顯示此演算法之效能可接近傳統SCL。
本論文使用Python做為軟體模擬與驗證平台,並利用Xilinx Vivado實現此演算法之硬體設計,使用之FPGA模擬環境為Xilinx Virtex-7 VC707,而設計的電路是以TSMC 40nm CMO實作。
論文內容包含介紹極化碼、傳統SC、SCL、PSCL解碼器介紹、NSC解碼器介紹,演算法模擬與驗證及解碼器硬體架構設計,最後為本論文總結並描述未來展望。
This paper proposes a new algorithm named Neural-Network-Aided Partitioned Successive Cancellation List (NA-PSCL) decoder, utilizing the block decoding chara-cteristic of PSCL and combining CNN Decoder. It could reduce the decoding process in algorithm. Results also show that the algorithm has same performance as traditional SCL algorithm.
We use python as the software simulation and verification platform in this paper, and use Vivado to implement the hardware design of this algorithm. Our FPGA simu-lation environment is Xilinx Virtex-7 VC707, and implement out circuit with TSMC 40nm CMOS.
The paper covers an introduction to polar codes, traditional SC, SCL, PSCL dec-oder introductions, NSC decoder introduction, algorithm simulation and verification, and decoder hardware architecture design. Finally, the paper concludes and provides future prospects.
[1] E. Arikan, “Channel Polarization: A method for constructing capacity-achieving Codes for symmetric binary-input memoryless channels,” IEEE Trans. Inf. The-ory, vol. 55, no. 7, pp. 3051–3073, Jul. 2009.
[2] 3GPP TSG RAN WG1 Meeting 87, November 2016.
[3] H. Zhang et al., "Parity-check polar coding for 5G and beyond", Proc. IEEE Int. Conf. Commun. (ICC), pp. 1-7, May 2018.
[4] E. Arikan, "A performance comparison of polar codes and Reed-Muller codes", IEEE Communications Letters, vol. 12, no. 6, pp. 447-449, 2008.
[5] I. Tal and A. Vardy, "List decoding of polar codes", 2011 IEEE International Sy-mposium on Information Theory Proceedings, pp. 1-5, 2011.
[6] A. B. 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.
[7] S. A. Hashemi, A. Balatsoukas-Stimming, P. Giard, C. Thibeault and W. J. Gro-ss, "Partitioned successive-cancellation list decoding of polar codes", Proc. IEE-E Int. Conf. Acoust. Speech Signal Process., pp. 957-960, 2016.
[8] E. Nachmani, Y. Be'ery and D. Burshtein, "Learning to decode linear codes usi-ng deep learning", 54th Annual Allerton Conf. on Communication Control and Computing, 2016.
[9] T. Gruber, S. Cammerer, J. Hoydis and S. Ten Brink, "On deep learning-based channel decoding", Annual Conf. on Inf. Sciences and Syst., pp. 1-6, May 2017.
[10] W. Lyu, Z. Zhang, C. Jiao, K. Qin and H. Zhang, "Performance evaluation of c-hannel decoding with deep neural networks", 2017.
[11] S. Cammerer, T. Gruber, J. Hoydis and S. T. Brink, "Scaling deep learning based decoding of polar codes via partitioning", IEEE Global Communications Confe-rence (GLOBECOM), pp. 1-6, 2017.
[12] N. Doan, S. A. Hashemi and W. J. Gross, "Neural successive cancellation deco-ding of polar codes", Proc. IEEE 19th Int. Workshop Signal Process. Adv. Wire-less Commun. (SPAWC), pp. 1-5, Jun. 2018.
[13] C. Zhang, B. Yuan and K. K. Parhi, "Reduced-latency SC polar decoder archite-ctures," 2012 IEEE International Conference on Communications (ICC), Ottaw-a, ON, Canada, 2012, pp. 3471-3475, doi: 10.1109/ICC.2012.6364209.
[14] C. -F. Teng and A. -Y. Wu, "A 7.8–13.6 pJ/b Ultra-Low Latency and Reconfigu-rable Neural Network-Assisted Polar Decoder With Multi-Code Length Suppor-t," in IEEE Transactions on Circuits and Systems I: Regular Papers, vol. 68, no. 5, pp. 1956-1965, May 2021, doi: 10.1109/TCSI.2021.3060585.