Results 31 to 40 of about 1,141 (250)
An implementation of list successive cancellation decoder with large list size for polar codes [PDF]
Polar codes are the first class of forward error correction (FEC) codes with a provably capacity-achieving capability. Using list successive cancellation decoding (LSCD) with a large list size, the error correction performance of polar codes exceeds other well-known FEC codes.
ChenYang Xia +6 more
openaire +2 more sources
Segmented Successive Cancellation List Polar Decoding with Tailored CRC [PDF]
As the first error correction codes provably achieving the symmetric capacity of binary-input discrete memory-less channels (B-DMCs), polar codes have been recently chosen by 3GPP for eMBB control channel. Among existing algorithms, CRC-aided successive cancellation list (CA-SCL) decoding is favorable due to its good performance, where CRC is placed at
Huayi Zhou 0002 +5 more
openaire +3 more sources
Bit-Flip Algorithm for Successive Cancellation List Decoder of Polar Codes
A successive cancellation list (SCL) decoder with the assistance of a cyclic redundancy check (CRC) can provide competitive decoding performance for polar codes compared with the state-of-the-art codes.
Fengyi Cheng +3 more
doaj +1 more source
Efficient Sorting Architecture for List-Fast-SSC Decoding of Polar Codes
Polar codes have been proven to achieve the symmetric capacity of memoryless channel. Compared with a successive cancellation list decoder, list-Fast simplified-successive cancellation generates more candidate paths, which leads to more resource costs ...
Xiaojun Zhang +4 more
doaj +1 more source
Multi-CRC Polar Codes and M-SCFlip-Based Decoding
A multi-cyclic redundancy check (Multi-CRC) polar code construction algorithm is proposed in this paper to solve the error propagation problem of successive cancellation decoding for polar codes.
Rui Guo, Kangni Chen, Huaping Liu
doaj +1 more source
A Low-Complexity Sorting Network for a Fast List Polar Decoder
Fast list decoding algorithms for polar codes have been proposed to achieve low latency and high error correction performance. In the Rate-1 and SPC nodes of fast list decoding, a high-complexity sorter is required if multiple bits are to be decoded ...
Yongje Lee +3 more
doaj +1 more source
Enhanced Adaptive Successive-Cancellation List Decoder
Abstract Adaptive successive cancellation list decoder (ASCLD) with upsizing scheme as a well-known approach can significantly reduce the average list size of SCL algorithm for polar codes with cyclic redundancy check (CRC). Since it needs to re-decode the whole received bits if no survival path verifies CRC, it dramatically increases ...
Ren Jing, Fengyi Cheng
openaire +1 more source
Simplified polar code decoding algorithm
Polar code is an error correction coding technique, which can prove from the mathematical point of view to reach Shannon′s limit. However, the traditional decoding algorithm, such as the successive cancellation(SC) and the successive cancellation list ...
Wang Dan +3 more
doaj +1 more source
Soft-Output Successive Cancellation List Decoding
We introduce an algorithm for approximating the codebook probability that is compatible with all successive cancellation (SC)-based decoding algorithms, including SC list (SCL) decoding. This approximation is based on an auxiliary distribution that mimics the dynamics of decoding algorithms with an SC decoding schedule.
Peihong Yuan +2 more
openaire +2 more sources
An Area-Efficient Hybrid Polar Decoder With Pipelined Architecture
As the first kind of capacity-achieving forward error correction (FEC) codes, polar codes have attracted much research interest recently. Compared with traditional FEC codes, polar codes show better error correction performance when successive ...
Yu Wang +4 more
doaj +1 more source

