Results 41 to 50 of about 11,140 (207)
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
Low complexity list successive cancellation decoding of polar codes [PDF]
IET Communications, 2014 The authors propose a low complexity list successive cancellation (LCLSC) decoding algorithm, where the advantages of the successive cancellation (SC) decoding and the list successive cancellation (LSC) decoding are both considered. In the proposed decoding, SC decoding instead of LSC decoding is implemented when all information bits from bad ...
Cao, Congzhe +3 more
openaire +2 more sources
Low Complexity Belief Propagation Polar Code Decoders
, 2015 Since its invention, polar code has received a lot of attention because of its capacity-achieving performance and low encoding and decoding complexity.
Abbas, Syed Mohsin +3 more
core +2 more sources
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
Soft-Output Successive Cancellation List Decoding
IEEE Transactions on Information TheoryWe introduce an algorithm for approximating the codebook probability that is compatible with all successive cancellation (SC)-based decoding algorithms, including SC list (SCL) decoding. This approximation is based on an auxiliary distribution that mimics the dynamics of decoding algorithms with an SC decoding schedule.
Peihong Yuan +2 more
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
Successive cancellation decoding of polar codes using stochastic computing [PDF]
2015 IEEE International Symposium on Circuits and Systems (ISCAS), 2015 accepted by International Symposium on Circuits and Systems (ISCAS ...
Yuan, Bo, Parhi, Keshab K.
openaire +2 more sources
Adaptive channel decoding method for polar codes
Shenzhen Daxue xuebao. Ligong ban, 2022 The polar code is a channel coding technology which can reach the Shannon limit in theory and has the advantage of low coding and decoding complexity. It is now one of the channel coding solutions in 5G communication.
YE Maolin +3 more
doaj +1 more source
Tensor Networks and Quantum Error Correction
, 2014 We establish several relations between quantum error correction (QEC) and tensor network (TN) methods of quantum many-body physics. We exhibit correspondences between well-known families of QEC codes and TNs, and demonstrate a formal equivalence between ...
Ferris, Andrew J., Poulin, David
core +1 more source
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