Results 31 to 40 of about 11,113 (194)
Threshold-Based Fast Successive-Cancellation Decoding of Polar Codes [PDF]
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
Folded successive cancelation decoding of polar codes [PDF]
Polar codes are the first explicit class of codes that are provably capacity-achieving under the successive cancelation (SC) decoding. As a suboptimal decoder, SC has quasi-linear complexity N(1 + log N) in the code length N. In this paper, we propose a new non-binary SC decoder with reduced complexity N/2(1 + log N/2) based on the folding operation ...
Sinan Kahraman +2 more
openaire +1 more source
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
In this paper, we discuss and analyze the effect of error propagation on the performance polar codes decoded using the successive cancellation algorithm.
O. Gazi, A. A. Andi
doaj +1 more source
Frequency-Domain Turbo Equalisation in Coded SC-FDMA Systems: EXIT Chart Analysis and Performance [PDF]
In this paper, we investigate the achievable performance of channel coded single-carrier frequency division multiple-access (SC-FDMA) systems employing various detection schemes, when communicating over frequency-selective fading channels.
Hanzo, Lajos +2 more
core +1 more source
Hardware architectures for successive cancellation decoding of polar codes [PDF]
Submitted to ICASSP ...
Leroux, Camille +3 more
openaire +2 more sources
List successive cancellation decoding of polar codes
A list successive cancellation (LSC) decoding algorithm to boost the performance of polar codes is proposed. Compared with traditional successive cancellation decoding algorithms, LSC simultaneously produces at most L locally best candidates during the decoding process to reduce the chance of missing the correct codeword.
K. Chen, K. Niu, J.R. Lin
openaire +1 more source
On the Derivation of Optimal Partial Successive Interference Cancellation [PDF]
The necessity of accurate channel estimation for Successive and Parallel Interference Cancellation is well known. Iterative channel estimation and channel decoding (for instance by means of the Expectation-Maximization algorithm) is particularly ...
Blasco, Francisco Lazaro +1 more
core +2 more sources
Successive-Cancellation Decoding of Linear Source Code [PDF]
This paper investigates the error probability of several decoding methods for a source code with decoder side information, where the decoding methods are: 1) symbol-wise maximum a posteriori decoding, 2) successive-cancellation decoding, and 3) stochastic successive-cancellation decoding.
openaire +2 more sources
Universal Polar Codes for More Capable and Less Noisy Channels and Sources
We prove two results on the universality of polar codes for source coding and channel communication. First, we show that for any polar code built for a source $P_{X,Z}$ there exists a slightly modified polar code - having the same rate, the same encoding
Renes, Joseph M., Sutter, David
core +1 more source

