DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Park, In-Cheol | - |
dc.contributor.advisor | 박인철 | - |
dc.contributor.author | Choi, Jaejoon | - |
dc.date.accessioned | 2018-06-20T06:22:39Z | - |
dc.date.available | 2018-06-20T06:22:39Z | - |
dc.date.issued | 2017 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=675449&flag=dissertation | en_US |
dc.identifier.uri | http://hdl.handle.net/10203/243340 | - |
dc.description | 학위논문(석사) - 한국과학기술원 : 전기및전자공학부, 2017.2,[iii, 30 p. :] | - |
dc.description.abstract | Polar codes are a class of error-correcting codes that provably achieve the channel capacity with the low-complexity encoding and decoding algorithms. Traditionally, successive-cancellation decoding is widely to decode polar codes. However, the serial nature of SC decoding leads to a long latency for long polar codes. This thesis proposes an improved method for the successive-cancellation decoding of polar codes to reduce the long latency. To avoid computations associated with redundant tree-traversals and syndrome calculations, recursive properties of polar codes are newly exploited in the proposed algorithm. Instead of computing a syndrome vector at every node, some syndrome vectors are directly obtained by recursively decomposing the syndrome vector computed previously. Furthermore, a modified syndrome check rule is proposed to prune unnecessary sub-trees efficiently. Compared to the latest pruning method, the proposed pruning method reduces the latency by 23% for a (2048, 1024) polar code without sacrificing the error-correcting performance. Moreover, the thesis proposes an efficient hardware architecture implementing the proposed SC decoding algorithm. A depth-constraint and a hardware sharing scheme are adopted to increase the hardware efficiency. As a result, the throughput of the polar decoder increases significantly at the cost of small amount of the additional hardware. | - |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | Polar codes | - |
dc.subject | polar decoder | - |
dc.subject | successive-cancellation decoding | - |
dc.subject | syndrome check | - |
dc.subject | pruning method | - |
dc.subject | low latency | - |
dc.subject | 극 부호 | - |
dc.subject | 극 부호 복호기 | - |
dc.subject | 연속 제거 복호 | - |
dc.subject | 신드롬 체크 | - |
dc.subject | 가지치기 방법 | - |
dc.subject | 낮은 지연 시간 | - |
dc.title | (An) efficient pruning method and its hardware architecture for successive-cancellation decoding of polar codes | - |
dc.title.alternative | 극 부호의 연속 제거 복호를 위한 효율적인 가지치기 방법과 하드웨어 구조 | - |
dc.type | Thesis(Master) | - |
dc.identifier.CNRN | 325007 | - |
dc.description.department | 한국과학기술원 :전기및전자공학부, | - |
dc.contributor.alternativeauthor | 최재준 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.