arrow
Return

Fast Polar Decoders: Algorithm and Implementation

delete2014-05-01
delete304
delete
OA
AI
G
Gabi Sarkis *
P
Pascal Giard
A
Alexander Vardy
C
Claude Thibeault
W
Warren J. Gross
DOI:10.1109/JSAC.2014.140514delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Polar codes provably achieve the symmetric capacity of a memoryless channel while having an explicit construction. The adoption of polar codes however, has been hampered by the low throughput of their decoding algorithm. This work aims to increase the throughput of polar decoding hardware by an order of magnitude relative to successive-cancellation decoders and is more than 8 times faster than the current fastest polar decoder. We present an algorithm, architecture, and FPGA implementation of a flexible, gigabit-per-second polar decoder.
Keywords:
polar codes
successive-cancellation decoding
storage systems

Journal

IEEE Journal on Selected Areas in Communications cover
IEEE Journal on Selected Areas in Communications
IF:
17.2
Papers:
6.4K
Citations:
3.1W

Organization

University of California System cover
University of California System
Scholars:
37.5W
Papers: 33.7W
Citations: 6.6K
U
University of California San Diego
Scholars:
4.6W
Papers: 3.5W
Citations: 924
M
McGill University
Scholars:
5.5W
Papers: 4.9W
Citations: 7.0W
researcher View more organizations