연속 제거 리스트 복호기를 위한 노드 공유된 빠른 다중 비트 결정 방법

Author(s)
정서린
Advisor
선우명훈
Department
일반대학원 전자공학과
Publisher
The Graduate School, Ajou University
Publication Year
2019-02
Language
eng
Alternative Abstract
Successive-cancellation list (SCL) is a decoding algorithm for polar codes that require high latency owing to serial operations. While several algorithms have been proposed to improve this latency with additional circuits, the area was enlarged. In this paper, we propose a fast multibit decision method with small area based SCL decoding algorithm. First, multiple bits can be determined to consume only fewer clock cycles using nodes represented by the information bits and frozen bits. The nodes called shared nodes in this paper. There are two combined nodes with similar bit patterns for hardware efficiency and one node with the rest bits grouped into 8 bits for fast multibit decision. In addition, a short-tailed sorter is proposed to reduce the critical path delay. As a large number of path metrics cause sorter delays, the proposed sorter can achieve high throughput with a small area. The proposed (1024, 512) SCL decoder showed negligible performance degradation in the simulation and was synthesized using 65 nm CMOS technology. The proposed decoder achieves about 1.3Gbps with a small area. As a result, area-throughput efficiency is the best among decoders above 1Gbps.
URI
https://dspace.ajou.ac.kr/handle/2018.oak/14856
Fulltext

Appears in Collections:
Graduate School of Ajou University > Department of Electronic Engineering > 3. Theses(Master)
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse