Results 21 to 30 of about 52,949 (260)
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 ...
Xiong, Chenrong, Lin, Jun, Yan, Zhiyuan
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
Threshold-Based Fast Successive-Cancellation Decoding of Polar Codes [PDF]
, 2020 Fast SC decoding overcomes the latency caused by the serial nature of the SC decoding by identifying new nodes in the upper levels of the SC decoding tree and implementing their fast parallel decoders.
Balatsoukas-Stimming, Alexios +6 more
core +2 more sources
Low Latency SC Decoder Architecture for Interleaved Polar Codes
Radioengineering, 2022 Interleaved polar (I-Polar) codes, a new facet of polar codes to achieve better channel capacity, is designed by placing the interleaver and deinterleaver blocks midway between the stages of the polar codes. Low latency hardware optimization makes their implementation even more suitable for ultra-reliable low latency applications.
Jali, N., Muralidhar, P., Patri, S. R.
openaire +3 more sources
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
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
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
Iterative Multiuser Detection and Decoding with Spatially Coupled Interleaving [PDF]
, 2013 Spatially coupled (SC) interleaving is proposed to improve the performance of iterative multiuser detection and decoding (MUDD) for quasi-static fading multiple-input multiple-output systems.
Horio, Shuhei, Takeuchi, Keigo
core +1 more source