On Path Memory in List Successive Cancellation Decoder of Polar Codes
arXiv:1712.02053 · doi:10.1109/ISCAS.2018.8351462
Abstract
Polar code is a breakthrough in coding theory. Using list successive cancellation decoding with large list size L, polar codes can achieve excellent error correction performance. The L partial decoded vectors are stored in the path memory and updated according to the results of list management. In the state-of-the-art designs, the memories are implemented with registers and a large crossbar is used for copying the partial decoded vectors from one block of memory to another during the update. The architectures are quite area-costly when the code length and list size are large. To solve this problem, we propose two optimization schemes for the path memory in this work. First, a folded path memory architecture is presented to reduce the area cost. Second, we show a scheme that the path memory can be totally removed from the architecture. Experimental results show that these schemes effectively reduce the area of path memory.
arXiv comment5 pages, 6 figures, 2 tables
References in corpus (7)
- Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels
- LLR-based Successive Cancellation List Decoding of Polar Codes
- Fast and Flexible Successive-Cancellation List Decoders for Polar Codes
- Symbol-Decision Successive Cancellation List Decoder for Polar Codes
- A Low-Latency List Successive-Cancellation Decoding Implementation for Polar Codes
- A High Throughput List Decoder Architecture for Polar Codes
- Low Complexity Belief Propagation Polar Code Decoders