Results 21 to 30 of about 53,028 (278)
Polar Codes based on Bit Flipping Improved BP Decoding Algorithm
Guangtongxin yanjiu, 2021 Polar codes is the only coding scheme in the world that has been proved that the Shannon threshold is reachable. Because of the high time delay caused by the serial characteristic of Successive Cancellation (SC) decoding, the Belief Propagation (BP ...
Hua-hua WANG +4 more
doaj +1 more source
BER Evaluation Based SCFlip Algorithm for Polar Codes Decoding
IEEE Access, 2020 Successive cancellation (SC) decoding of polar codes may bring about error propagation that needs to be mitigated. In this paper, we present a new SC Flipping (SCFlip) decoder, named bit error rate (BER) evaluation based SCFlip (BER-SCFlip), which can ...
Xueting Zhang +2 more
doaj +1 more source
Error performance analysis of the symbol-decision SC polar decoder [PDF]
2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2016 Polar codes are the first provably capacity-achieving forward error correction codes. To improve decoder throughput, the symbol-decision SC algorithm makes hard-decision for multiple bits at a time. In this paper, we prove that for polar codes, the symbol-decision SC algorithm is better than the bit-decision SC algorithm in terms of the frame error ...
Chenrong Xiong +2 more
openaire +2 more sources
Complexity‐adjustable SC decoding of polar codes for energy consumption reduction [PDF]
IET Communications, 2019 This study proposes an enhanced list‐aided successive cancellation stack (ELSCS) decoding algorithm with adjustable decoding complexity. Also, a logarithmic likelihood ratio‐threshold based path extension scheme is designed to further reduce the memory consumption of stack decoding.
Haotian Zheng +4 more
openaire +2 more sources
Simplified polar code decoding algorithm
Dianzi Jishu Yingyong, 2018 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
IEEE Access, 2023 In the conventional successive cancellation (SC) decoder for polar codes, all the future bits to be estimated later are treated as random variables. However, polar codes inevitably involve frozen bits, and their concatenated coding schemes also include ...
Min Jang +3 more
doaj +1 more source
Analysis of Spatially-Coupled Counter Braids [PDF]
, 2015 A counter braid (CB) is a novel counter architecture introduced by Lu et al. in 2007 for per-flow measurements on high-speed links. CBs achieve an asymptotic compression rate (under optimal decoding) that matches the entropy lower bound of the flow size ...
Amat, Alexandre Graell i, Rosnes, Eirik
core +2 more sources
Progressive Bit-Flipping Decoding of Polar Codes: A Critical-Set Based Tree Search Approach
IEEE Access, 2018 In successive cancellation (SC) polar decoding, an incorrect estimate of any prior unfrozen bit may bring about severe error propagation in the following decoding, and thus it is desirable to find out and correct an error as early as possible.
Zhaoyang Zhang +3 more
doaj +1 more source
An Area-Efficient Hybrid Polar Decoder With Pipelined Architecture
IEEE Access, 2020 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
IET Communications, 2022 Spatially coupled low‐density parity‐check (SC‐LDPC) codes generally use a window decoding scheme, which is known to yield a near‐optimal decoding, compared to full block decoding.
Sirawit Khittiwitchayakul +2 more
doaj +1 more source