1,153 research outputs found
On the Construction and Decoding of Concatenated Polar Codes
A scheme for concatenating the recently invented polar codes with interleaved
block codes is considered. By concatenating binary polar codes with interleaved
Reed-Solomon codes, we prove that the proposed concatenation scheme captures
the capacity-achieving property of polar codes, while having a significantly
better error-decay rate. We show that for any , and total frame
length , the parameters of the scheme can be set such that the frame error
probability is less than , while the scheme is still
capacity achieving. This improves upon 2^{-N^{0.5-\eps}}, the frame error
probability of Arikan's polar codes. We also propose decoding algorithms for
concatenated polar codes, which significantly improve the error-rate
performance at finite block lengths while preserving the low decoding
complexity
Symbol-Based Successive Cancellation List Decoder for Polar Codes
Polar codes is promising because they can provably achieve the channel
capacity while having an explicit construction method. Lots of work have been
done for the bit-based decoding algorithm for polar codes. In this paper,
generalized symbol-based successive cancellation (SC) and SC list decoding
algorithms are discussed. A symbol-based recursive channel combination
relationship is proposed to calculate the symbol-based channel transition
probability. This proposed method needs less additions than the
maximum-likelihood decoder used by the existing symbol-based polar decoding
algorithm. In addition, a two-stage list pruning network is proposed to
simplify the list pruning network for the symbol-based SC list decoding
algorithm.Comment: Accepted by 2014 IEEE Workshop on Signal Processing Systems (SiPS
Polar Codes with Dynamic Frozen Symbols and Their Decoding by Directed Search
A novel construction of polar codes with dynamic frozen symbols is proposed.
The proposed codes are subcodes of extended BCH codes, which ensure
sufficiently high minimum distance. Furthermore, a decoding algorithm is
proposed, which employs estimates of the not-yet-processed bit channel error
probabilities to perform directed search in code tree, reducing thus the total
number of iterations.Comment: Accepted to ITW201
- …