효율적인 극 부호 복호기
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | 홍송남 | - |
dc.contributor.author | 정민오 | - |
dc.date.accessioned | 2019-04-01T16:42:08Z | - |
dc.date.available | 2019-04-01T16:42:08Z | - |
dc.date.issued | 2019-02 | - |
dc.identifier.other | 28878 | - |
dc.identifier.uri | https://dspace.ajou.ac.kr/handle/2018.oak/15184 | - |
dc.description | 학위논문(석사)--아주대학교 일반대학원 :전자공학과,2019. 2 | - |
dc.description.tableofcontents | CHAPTER I. Introduction 1 CHAPTER II. Preliminaries 3 2.1 Polar Codes 3 2.2 Successive Cancellation Decoding 9 CHAPTER III. Improved Decoding Algorithm 11 3.1 SC List Decoder 11 3.2 Deep Learning Decoder 14 3.3 SC Flip Decoder 16 CHAPTER IV. Proposed Decoding Algorithm 18 4.1 The proposed path-metric 18 4.2 The proposed decoding algorithm 19 CHAPTER V. Simulation Results 24 CHAPTER VI. Conclusions 28 References 29 | - |
dc.language.iso | eng | - |
dc.publisher | The Graduate School, Ajou University | - |
dc.rights | 아주대학교 논문은 저작권에 의해 보호받습니다. | - |
dc.title | 효율적인 극 부호 복호기 | - |
dc.title.alternative | Minoh Jeong | - |
dc.type | Thesis | - |
dc.contributor.affiliation | 아주대학교 일반대학원 | - |
dc.contributor.alternativeName | Minoh Jeong | - |
dc.contributor.department | 일반대학원 전자공학과 | - |
dc.date.awarded | 2019. 2 | - |
dc.description.degree | Master | - |
dc.identifier.localId | 905588 | - |
dc.identifier.uci | I804:41038-000000028878 | - |
dc.identifier.url | http://dcoll.ajou.ac.kr:9080/dcollection/common/orgView/000000028878 | - |
dc.description.alternativeAbstract | In this paper, we study several decoding algorithms for Polar Codes and provide simulation results of each decoding algorithms. Also, we provide a new low-complexity decoding algorithm, namely Successive Cancellation Fano (SC-Fano) decoding algorithm by appropriately incorporating Fano sequential decoding into the standard Successive Cancellation (SC) decoding. The proposed decoding follows the SC decoding with the additional process at every SC decoding stage such that it determines whether to move forward along the current path or move backward to find a better path. In this way, the SC-Fano decoding can prevent the SC decoding from error propagation (i.e., generating a wrong codeword). Compared with the other improvements of the SC decoding as SC list (SCL) decoding, SC stack (SCS) decoding and SC Flip (SCFlip) decoding, the proposed SC-Fano decoding has a very low memory requirement and thus is more suitable for hardware implementations. Simulation results demonstrate that the proposed decoding can significantly improve the performance about 0.25 dB with an almost same complexity. | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.