극 부호를 위한 저지연 Bit-Flipping Successive-Cancellation 복호
Low Latency Bit-Flipping Successive-Cancellation Decoding for Polar Codes
- 주제(키워드) Polar Codes , Successive-Cancellation , Successive-Cancellation Flip , Cyclic Redundancy Check
- 발행기관 아주대학교
- 지도교수 선우명훈
- 발행년도 2020
- 학위수여년월 2020. 2
- 학위명 석사
- 학과 및 전공 일반대학원 전자공학과
- 실제URI http://www.dcollection.net/handler/ajou/000000029891
- 본문언어 영어
- 저작권 아주대학교 논문은 저작권에 의해 보호받습니다.
초록/요약
The Successive-cancellation (SC) algorithm of polar codes used a sequential decoding process that decodes one bit at a time. Thus, polar codes can propagate the error if an error occurs. To solve this problem, the SC-Flip (SCF) decoding method was proposed, which can improves the error correction performance by flipping the first error bit. However, it is not suitable for hardware implementation because the latency significantly increases in the worst case. In this paper, we propose an efficient decoding method to reduce the latency of the conventional SCF decoding algorithm. The proposed decoding method divides the information bits into several sub-frames and performs a flip decoding process only within the corresponding sub-frame through cyclic redundancy check (CRC) detection for each sub-frame. As a result of Matlab simulation, the proposed decoding method shows that the average clock cycles are reduced by up to 67.3% at 1dB and up to 10.53% at 2dB while maintaining the high error correction performance of the existing SCF decoding.
more목차
I. Introduction 1
II. Review of Polar Codes 4
A. Encoding of Polar Codes 4
B. Successive-Cancellation Decoding 4
C. Successive-Cancellation List Decoding 5
D. Flip Decoding 6
III. Proposed SCF Decoding 8
A. First Error Bit Occurrence Frequency 8
B. Encoding of Proposed SCF 10
C. Decoding of Proposed SCF 12
IV. Simulation Results and Comparisons 14
V. Conclusion 18
Bibliography 19
