Results 41 to 50 of about 11,243 (215)
A Complexity Reduction Method for Successive Cancellation List Decoding [PDF]
IEEE Transactions on Circuits and Systems II: Express Briefs, 2020 This brief introduces a hardware complexity reduction method for successive cancellation list (SCL) decoders. Specifically, we propose to use a sorting scheme so that L paths with smallest path metrics are also sorted according to their path indexes for path pruning.
openaire +3 more sources
Advanced Electromagnetics, 2019 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]
, 2012 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
LLR-Based Successive Cancellation List Decoding of Polar Codes [PDF]
IEEE Transactions on Signal Processing, 2014 We show that successive cancellation list decoding can be formulated exclusively using log-likelihood ratios. In addition to numerical stability, the log-likelihood ratio based formulation has useful properties which simplify the sorting step involved in successive cancellation list decoding.
Alexios Balatsoukas-Stimming +2 more
openaire +2 more sources
Chained successive cancellation decoding of the extended Golay code [PDF]
2018 Iran Workshop on Communication and Information Theory (IWCIT), 2018 The extended Golay code is shown to be representable as a chained polar subcode. This enables its decoding with the successive cancellation algorithm and its stack generalization. The decoder can be further simplified by employing fast Hadamard transform. The complexity of the obtained algorithm is comparable with that of the Vardy algorithm.
openaire +2 more sources
A Split-Reduced Successive Cancellation List Decoder for Polar Codes
, 2015 This paper focuses on low complexity successive cancellation list (SCL) decoding of polar codes. In particular, using the fact that splitting may be unnecessary when the reliability of decoding the unfrozen bit is sufficiently high, a novel splitting ...
Poor, H. Vincent +4 more
core +1 more source
Interference Networks with Point-to-Point Codes [PDF]
, 2011 The paper establishes the capacity region of the Gaussian interference channel with many transmitter-receiver pairs constrained to use point-to-point codes.
Baccelli, Francois +2 more
core +5 more sources
Multiple Folding for Successive Cancelation Decoding of Polar Codes
IEEE Wireless Communications Letters, 2014 Polar coding is known as the first provably capacity-achieving coding scheme under low-complexity suboptimal successive cancelation decoding (SCD). The large error-correction capability of finite-length polar codes is mostly achieved with relatively long codes.
Sinan Kahraman +2 more
openaire +2 more sources
Universal Polar Codes for More Capable and Less Noisy Channels and Sources
, 2014 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
On the Derivation of Optimal Partial Successive Interference Cancellation [PDF]
, 2011 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