Results 121 to 130 of about 190 (145)

Symbol-Decision Successive Cancellation List Decoder for Polar Codes [PDF]

open access: yesIEEE Transactions on Signal Processing, 2016
13 pages, 17 ...
Chenrong Xiong, Zhiyuan Yan
exaly   +3 more sources

Efficient adaptive list successive cancellation decoder for polar codes

2014 48th Asilomar Conference on Signals, Systems and Computers, 2014
By 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   +2 more
exaly   +2 more sources

List Estimation-aided Successive-Cancellation List Decoding of Polar Codes

2018 IEEE/CIC International Conference on Communications in China (ICCC), 2018
List size determines the ability of successive-cancellation list (SCL) decoding algorithm assisted by the cyclic redundancy check (CRC) for polar codes. To decode a received codeword correctly with exactly matching a list size, a just right list size is required to be estimated.
Hongxu Jin, Rongke Liu
openaire   +1 more source

Efficient stochastic successive cancellation list decoder for polar codes

Science China Information Sciences, 2020
Polar 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

Partitioned Adaptive Successive-Cancellation List Decoder for Polar Codes

2020 IEEE 20th International Conference on Communication Technology (ICCT), 2020
This 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   +1 more source

Efficient adaptive successive cancellation list decoders for polar codes

2016 IEEE International Conference on Digital Signal Processing (DSP), 2016
As 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

A Reduced-Complexity Successive Cancellation List Decoding of Polar Codes

2013 IEEE 77th Vehicular Technology Conference (VTC Spring), 2013
Polar 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   +1 more source

Efficient stochastic list successive cancellation decoder for polar codes

2015 28th IEEE International System-on-Chip Conference (SOCC), 2015
Representing continuous values by streams of random binary bits, stochastic decoding has shown advantages in both hardware efficiency and fault tolerance, therefore has been widely adopted by iterative decoding of error correction codes such as low-density parity-check (LDPC) codes and so on.
Xiao Liang 0005   +4 more
openaire   +1 more source

A Sequence Repetition Node-Based Successive Cancellation List Decoder for 5G Polar Codes: Algorithm and Implementation

IEEE Transactions on Signal Processing, 2022
Yuqing Ren   +2 more
exaly  

An Adaptive Fusion Successive Cancellation List Decoder for Polar Codes with Cyclic Redundancy Check

IEICE Transactions on Communications, 2020
Yuhuan Wang, Hang Yin, Zhanxin Yang
exaly  

Home - About - Disclaimer - Privacy