Results 171 to 180 of about 1,679,303 (194)
Multi-Bit Successive Cancellation List Decoding of Polar Codes Using One-Bit Error Boundary
IEEE Communications LettersThis letter proposes an efficient method to reduce path splits in the successive cancellation list (SCL) decoding. We construct the boundary consisting of single-bit and multi-bit nodes that have a low error probability within the SC-decoding tree.
In-Cheol Park, Jaeyoung Lee
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Partitioned Adaptive Successive-Cancellation List Decoder for Polar Codes
2020 IEEE 20th International Conference on Communication Technology (ICCT), 2020This paper focuses on a generalization of the well-known adaptive successive cancellation list decoding decoding (ASCLD) of polar codes, characterized by several extra decoding attempts with larger list size, when all the previous decoding attempts fail.
Fengyi Cheng +3 more
openaire +2 more sources
Efficient stochastic successive cancellation list decoder for polar codes
Science China Information Sciences, 2020Polar codes are one of the most favorable capacity-achieving codes owing to their simple structures and low decoding complexity. Successive cancellation list (SCL) decoders with large list sizes achieve performances very close to those of maximum-likelihood (ML) decoders.
Xiao Liang 0005 +5 more
openaire +1 more source
Efficient adaptive list successive cancellation decoder for polar codes
2014 48th Asilomar Conference on Signals, Systems and Computers, 2014By keeping a size-L list of intermediate candidates at each decoding step, list successive cancellation (SC) polar decoder successfully achieves better performance compared to the conventional SC polar decoder. However, the size-L list SC decoder will result in linear increase of hardware complexity, which hinders the efficient implementation and ...
Chuan Zhang 0001 +3 more
openaire +2 more sources
A Reduced-Complexity Successive Cancellation List Decoding of Polar Codes
2013 IEEE 77th Vehicular Technology Conference (VTC Spring), 2013Polar codes are the first constructive and provable capacity-achieving codes. In finite code length cases, successive cancellation list (SCL) decoding algorithm is reported to have performance very close to maximum-likelihood (ML) decoding. In this paper, a reduced-complexity version of SCL decoding algorithm is proposed to boost the finite- length ...
Kai Chen 0013, Kai Niu 0001, Jiaru Lin
openaire +2 more sources
Efficient adaptive successive cancellation list decoders for polar codes
2016 IEEE International Conference on Digital Signal Processing (DSP), 2016As improved versions of the successive cancellation (SC) decoder, the adaptive SC list (SCL) decoder and the segmented CRC-aided SCL (SCA-SCL) decoder can achieve notable complexity reduction compared to the traditional SCL one. However, the former only shows good reduction in high SNR region whereas the latter only works good in low SNR region.
Wenqing Song +3 more
openaire +1 more source
Neural Network Aided Path Splitting Strategy for Polar Successive Cancellation List Decoding
IEEE Transactions on Vehicular Technology, 2023Francis C M Lau, Yulong Zou, Dai Bin
exaly
Post-Processing for CRC-Aided Successive Cancellation List Decoding of Polar Codes
IEEE Communications Letters, 2020Yi-Han Pan +2 more
exaly
An Information-Theoretic Perspective on Successive Cancellation List Decoding and Polar Code Design
IEEE Transactions on Information Theory, 2022Henry D Pfister, Mustafa Cemil Coşkun
exaly